WO2007065296A1 - Method for managing the sctp output stream queue and implementing date transmission - Google Patents
Method for managing the sctp output stream queue and implementing date transmission Download PDFInfo
- Publication number
- WO2007065296A1 WO2007065296A1 PCT/CN2005/002114 CN2005002114W WO2007065296A1 WO 2007065296 A1 WO2007065296 A1 WO 2007065296A1 CN 2005002114 W CN2005002114 W CN 2005002114W WO 2007065296 A1 WO2007065296 A1 WO 2007065296A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- output
- control
- message
- messages
- output stream
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Ceased
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/60—Network streaming of media packets
- H04L65/65—Network streaming protocols, e.g. real-time transport protocol [RTP] or real-time control protocol [RTCP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/80—Responding to QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/40—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
- H04W28/065—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information using assembly or disassembly of packets
Definitions
- the following P is controlled by the ETF e ne Eng nee ng ask Fo ce e ne project but was not encountered in the P.
- the P with message is the part to establish the next generation of high communication and use for various purposes on P.
- P in 3 cores are mainly used in the P TN pub c Sw ched e ephone n o k public exchange letter messages and the letter messages in the user LP Up e Laye Po o ocO 3U 2U 2P U Ah.
- T The item of T is to support Duo He and the same without each other. P can make the message reliable and within
- the wood to be solved is to provide TP output column management and mathematical methods to solve the same problem of different TP outputs.
- control receives the news from the upper user
- d encapsulate the retrieved message into a control.
- the step-by-step method may have the following special steps. a she is the way to the biggest judge whether to go up
- the one-step method can have the following special methods.
- the output is also managed and distributed according to the following steps
- the one-step-up method may have the upper average of the next special segment.
- One step method can have special control
- the number of allocated segments of each output occupied segment is compared with the storage utilization judgment output or solution.
- the one-step method can have the following characteristics.
- the parameters that determine whether the output is used and whether it is released or not are controlled.
- the parameters indicating the output utilization rate can be modified.
- the step-by-step method can have the following special user-controlled sequence.
- Step b is saving the message.
- the sequence of messages that are divided into different outputs is the same.
- the multi-messages divided into the upper part are allocated the same, and the steps c ⁇ and the following steps are taken out from each input
- step m Check if the message fetched in the previous output is the one fetched in the previous message. If yes, return to step m. Otherwise, go to the next step.
- the above method can have the following features to control all messages in all outputs to be reset.
- the step-by-step method can have the following special user profiles, if not needed, control to not message
- Each output can be based on taking out messages. If method messages are needed, messages are output in the order in which they are needed.
- the above method may have the following special step d: encapsulate the retrieved message into a control to encapsulate multiple messages into a single control if the upper limit is reached and the size of the receive window size, window size, number of waits is satisfied With no news, the message is encapsulated into a medium to control
- the above method can have the following special step d in the control To reassess. .
- This has the following wood effect
- S TP her gesture includes the following steps
- ULP is stored in a medium to output the instruction of ULP. She can output a number of different messages that are different from each other. But 5.
- the storage of essays for segmented effort messages may be stored in 15. Into one or more segments. The LP of each segment. The average of is conducive to improving the internal utilization rate, but this is not the case
- the ssage inbound table is taken out or more than the number stored in essag.
- the output of the phase is updated.
- the one-way table is pointed to the next.
- the first introduction of the work table can also be the first work or the middle of the Arab, so there is no limit to the number of the table
- each output takes out Message. In taking out the output, the essa e in ULP is switched to the next output. The number in the output is in each output
- step b Remove the essage from the previous output. If the es age is removed, it is the same. Return to step b otherwise
- Function can be functioned in one go.
- S TP needs TP to provide
- the function can be used to indicate the e-ab e TP de nd to indicate the order of the same number of different outputs ULP TP. The way that P no longer needs P to provide functions
- step 0 takes out Message and encapsulates it into
- step 20 The ULP instruction determines whether there will be more es a e. If the next step is executed, otherwise step 80
- Step 1 determine whether the essage is the undivided ULP or the most ssage of ULP. If yes, go to the next step; otherwise, step 50
- Step 4 Switch to the next output
- Step 50 the previous output takes out the new essage and encapsulates it into Da a hu step.
- Step 60 Determine whether the new essage satisfies the limits of ax m Ze and x ke z. If it is satisfied, go to the next step, otherwise go to step 00, where axPacke z goes to the maximum PU axEm ze nd nd u S d ng ze + the minimum nd receiving window size in PU d the size of the window U and g ze wait
- step 30 Remove the essage from the output before step 70 and encapsulate it into a a hunk.
- Step 100 To determine whether the essag is not divided into ULP or L is divided into the minimum age if yes. Go to the next step No. Step 100
- Step 90 Switch to the next output Step 00 It is possible that the previous aahk together only has a Da a hunk encapsulated as a TP and goes out. Return to step 0 Next
- the T o o e in 2 is controlled on o hUnk
- the on o hu k ue e controlled is o o hunk.
- Step T is packaged.
- the content can refer to the content of the existing wooden revaluation system.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Communication Control (AREA)
Abstract
Description
木領域 Wood field
本 涉及 P輸出 列管理和數 她理方法。 尤其涉及 不同輸出 的數 順序 的方法。 背景 木 This involves P output column management and mathematical methods. In particular, it involves methods of different output numbers. Background wood
P ea on o T ansm ss on P o oco 于 P阿 的 . P ea on o T ansm ss on P o oco in P Ah.
控制 以下 P 是由 ETF e ne Eng nee ng ask Fo ce e ne 工程 在 P 碰上 而未的 含消息在 上 的一 P是在 P阿 上建立下一代高 通信和 于 各 用的 部分。 The following P is controlled by the ETF e ne Eng nee ng ask Fo ce e ne project but was not encountered in the P. The P with message is the part to establish the next generation of high communication and use for various purposes on P.
P 于3 核心 各 主要用于在 P阿 中 P TN pub c Sw ched e ePhone n o k 公共交換 阿 的信 消息 和 P 內的信 消息 上 用戶 LP Up e Laye P o ocO 3U 2U 2P U 阿的 。 P in 3 cores are mainly used in the P TN pub c Sw ched e ephone n o k public exchange letter messages and the letter messages in the user LP Up e Laye Po o ocO 3U 2U 2P U Ah.
令能否可靠 快速的 是 系統性能的 第三代 系統也不例外 P 令是 多 系統 de od v s o u p e ccess ,以下 的可 令之一 T 是 令的 如何將 令快速可靠的 到目的信令 是 P需要完成的主要 所 如何充分 TP 的 功能 如何有效地管理 如何高 她 理數 的 如何 控制 制的作用 到 P 能否在 系統中快速可靠的 令 到第三代 系統的 定性和可 靠性。 Whether it is reliable or fast is the third-generation system of system performance. P is multi-system de od vsoupe ccess. The main reason is how to fully manage the function of TP, how to effectively manage, how to control the effect of high math, how to control the system to whether P can quickly and reliably make the qualitative and reliable of the third generation system.
T 的 項 的 就是 支持多 和 之同相 互不干 。 P可 令消息的可靠、在 內 The item of T is to support Duo He and the same without each other. P can make the message reliable and within
于如何 一介 TP 不同的輸出 的數 順序 即 ULP 不同輸出 的先 順序將 送出去 E F的 中 沒有 提供解決方法。 There is no solution in how to introduce the order of the different outputs of the TP, that is, the order of the different outputs of the ULP will be sent to the E F.
. .
.此外 在 TP輸出 列管理和數 中 如何提高 的效 率 避免 輸出 中出現 即 如何提高內 的 .利用率和 活性 如果在需要 不同輸出 的 ess ge ULP . In addition, how to improve the efficiency of the TP output column management and data to avoid appearing in the output is how to improve the internal. Utilization and activity If different output ess ge ULP is needed
P的順序 等 也是需要 的 。 內容 The order of P, etc. is also required. content
本 所要解決的 木 是提供 TP輸出 列管理和數 她理方法 解決 TP 不同輸出 在 內的 同 。 The wood to be solved is to provide TP output column management and mathematical methods to solve the same problem of different TP outputs.
解決上 木 本 提供了一 控制 輸出 列管 理和數 她理方法 包括以下步驟 Solving the problem of woody provides a control output column management and data management method, including the following steps
a 在 控制 中 多 輸出 , 控制 接收到上 用戶的上 她 得到消息 a Multiple outputs in the control, the control receives the news from the upper user
b 將 上 分成的 介或多 消息 存入同 輸出 輸出 占用不同的 空河 b. Store the media or multiple messages divided into the same output and output and occupy different empty rivers
( c 的方式 某一輸出 中取 由 上 分成的一介或多 消息 再切換到下一介輸出 (The way of c is to take one or more messages divided by on one output and then switch to the next output
d 將取出的消息 封裝成 控制 。 d encapsulate the retrieved message into a control.
一步 上 方法 可具有 下特 步驟. a 她 是 的路往最大 判斷是否 上 The step-by-step method may have the following special steps. a she is the way to the biggest judge whether to go up
如需要 將其分成多 消息 否則將 作力一介消息 。 If you need to divide it into multiple messages, otherwise it will work hard to mediate the message.
一步 上 方法 可具有以下特 方法中 輸出 的 同是按照以下步驟 行管理和分配的 The one-step method can have the following special methods. The output is also managed and distributed according to the following steps
將十段 的內存空間作力 所有輸出 的 大小 所有 的 的 和 Use ten segments of memory space for all output sizes, all sums
p 將 內 分成 千分段 使用內 地址將 的分段連接成一 介 內 分段作力 的 介 p divides the internal into thousands of segments using the internal address to connect the segments into a medium
q 消息 內 表的 取出一介或多 于存儲 坎的數 然 將取出的 入相 的輸出 q Message in the table, take out one or more than the number of storage thresholds
更新 表的 數目 將 指向下一 The number of update tables will point to the next
某一輸出 釋放一介內 分段 將 作力一介 將 表的 數目 。 一步 上 方法 可具有 下特 分段的 上 的平均 。 When an output releases an internal segment, it will work for the number of tables. The one-step-up method may have the upper average of the next special segment.
一步 上 方法 可具有 下特 控制 各 輸出 占用的分段 其分配的分段數目相 較 得到 存儲 的利用率 判斷 輸出 或 解 . One step method can have special control The number of allocated segments of each output occupied segment is compared with the storage utilization judgment output or solution.
除 控制 居上 上 用戶 告之 以及 的 輸出 。 In addition to controlling the output of the top user notification and.
一步 「上 方法 可具有以下特 . 控制住 是 的 判斷輸出 是否 和 是否解除的 均力表示輸出 利用率的參數 是可修改的。 The one-step method can have the following characteristics. The parameters that determine whether the output is used and whether it is released or not are controlled. The parameters indicating the output utilization rate can be modified.
. 一步 上 方法 可具有以下特 上 用戶要求 控 制 的順序 上 步驟 b 在將消息 存入 . 輸出 不同上 分成的消息 順序 同 . . The step-by-step method can have the following special user-controlled sequence. Step b is saving the message. The sequence of messages that are divided into different outputs is the same.
上 分成的多 消息 則分配相同的 且 步驟 c》 以 下步驟 各輸 中取出 The multi-messages divided into the upper part are allocated the same, and the steps c》 and the following steps are taken out from each input
輸出 。 取出 中由 上 分成 的 或多 消息 然 切換到下一介輸出 Output. In the process of taking out, the message divided by the above is switched to the next output
檢查 前輸出 中 取出的消息 的 是否 前 取 出的消息 的 如果是 返回步驟 m 否則 軌行下一步 Check if the message fetched in the previous output is the one fetched in the previous message. If yes, return to step m. Otherwise, go to the next step.
n 切換 輸出 M 返回步驟 n Switch output M Return to step
上 方法 可具有以下特 控制 所 有輸出 中的消息 全部 把 重新 。 The above method can have the following features to control all messages in all outputs to be reset.
一步 上 方法 可具有以下特 上 用戶 一介 上 如果不需要 則 控制 以 不 消息 The step-by-step method can have the following special user profiles, if not needed, control to not message
各 輸出 依 取出消息 即可 如果需要 方法 消息 在 需要 消息 的順序 各 輸出 中 消息 。 Each output can be based on taking out messages. If method messages are needed, messages are output in the order in which they are needed.
上 方法 可具有 下特 步驟 d 將取出的消息 封裝成 控制 以 如果上 的指示是 消息 則在滿足 往最大 羊元和接收窗口大小、 窗口大小、 等待 的數 大小的限制 將多 消息 封裝成一介 控制 加上 不 消息 則將 消息 封裝成一介 控制住 The above method may have the following special step d: encapsulate the retrieved message into a control to encapsulate multiple messages into a single control if the upper limit is reached and the size of the receive window size, window size, number of waits is satisfied With no news, the message is encapsulated into a medium to control
。 .
上 方法 可具有以下特 步驟 d 在 控制 以 重估 。 . 本 具有以下 木效果 The above method can have the following special step d in the control To reassess. . This has the following wood effect
1、 在一介 TP 內部沒有多 輸出 每一介輸出 一介 同的數 互不于 令消息在 內 1. There is no multi-output within one TP, each output has the same number, and the message is not in
2、 的方式 各 輸出 解決了 2. The output of the method is solved
避免某一輸出 同不 到而造成 現象 提高教 的效率。 . 提出了一 輸出 的 內 管理方法 方法可以 內 使用的 活性 提高利用率 非可以 算出 的利用率 預知 情況 及 上 U P Avoid the phenomenon that a certain output can't be reached, and improve the teaching efficiency. . An output internal management method is proposed, which can be used within the activity to increase the utilization rate. The non-calculable utilization rate prediction situation and the UP
4、 P可以 需要 提供 不同輸出 之阿的數 ULP 4. P may need to provide the number of different output ULP
TP的順序 的功能。 TP order function.
此外 本 的方法 方便可靠 本 P 阿 的 方式 及 P她理方式沒有特殊要求 通用性 效率高 提高第三代 系統 如 系統 的 定性和可靠性。 In addition, this method is convenient and reliable. There is no special requirement for the method and the method of this method. Generality High efficiency Improve the qualitative and reliability of the third generation system such as the system.
1是本 T 她 的示意 。1 is Ben T's sign.
2是本 各 輸出 的流程 。 2 is the flow of each output.
是本 S TP 輸出 的示意 。 . 本 的最佳 方式 This is the output of this S TP. . The best way of this
.下面結合 團和 休 方式 本 的 . The following combines the group and the way of rest
. 是本 .S TP 她 的示意 包括以 下步驟 . Is this. S TP her gesture includes the following steps
步驟 在一介 TP 中 多 輸出 接收到上 用戶ULP Uppe Laye P o Oco 上 以 TP 以 她 即 的路往最大 單元 U 判斷是否需要 如需要.將 UL 分成多 esSage 消息 否則 將 UL. 作 力一介 essage ; 步驟 將 ULP 分成的 ssag 存入多 輸出 中的 占用不同的 Steps: In the TP, multiple outputs are received to the upper user ULP Uppe Laye P o Oco. Use TP to go to the largest unit U with her. Determine whether it is needed if necessary. Divide UL into multiple esSage messages; Work hard to essage; Steps to store the ssag divided by ULP into multiple outputs
ULP 存入 一介輸出 ULP的指示 。 她 可以 不同輸出 的數 互不千 令消息在 內可以 。 但 5 . ULP is stored in a medium to output the instruction of ULP. She can output a number of different messages that are different from each other. But 5.
. 是 如果各 輸出 分別占用物理上 同 那 就有可能 某些輸出 很小 空河利用率低 而另 些輸出 . Yes, if each output occupies the same physical, it is possible that some outputs are very small, the utilization rate of the river is low, and others
很大 的 。 了避免 現象的出現 同 不 同.的輸出 互不 本 用 下方法未完成 多數 的存儲 very big . In order to avoid the emergence of different phenomena. The output of each other is not used. The method is not completed. Most of the storage
將一段 的內存空何作力 所有輸出 的 大 小 所有輸出 的恩和 How to make a section of memory empty, the size of all outputs, the grace of all outputs
將 內 分成 于分段 egme 每二段的 ULP 的平均 使用內 地址將 的分段 接成 向 內 分段就是 中的 Divide the internal into the segment egme The average of the ULP of every two segments Use the internal address to connect the segment into the inward segment is in
. 分段 作力Message 的 存儲 休 essage 可能存入 15 . 到一介或多 分段中。 將每 段的 LP. 的平均 有利于 提高內 的利用率 但本 不 于此 . The storage of essays for segmented effort messages may be stored in 15. Into one or more segments. The LP of each segment. The average of is conducive to improving the internal utilization rate, but this is not the case
3 e.ssage 內 向 表的 取出 介或多 于存儲 essag 中的數 然 將 入相 的輸出 更新單向 表的 指向下一 3 e. The ssage inbound table is taken out or more than the number stored in essag. The output of the phase is updated. The one-way table is pointed to the next.
0 . 4 . 輸出 釋放一介內 分段 , 將 作力一介 0.4. The output releases an internal segment, will work hard
作力 表的第一介 也可以作力最 一介 或中阿的 此不作限制 向 表的 數目 The first introduction of the work table can also be the first work or the middle of the Arab, so there is no limit to the number of the table
同 輸出 所占用的分段 將 占用的 分段數目除以 其分配的可以占用的分段 就可以 算出 輸出 Same as output Occupied segments Divide the number of occupied segments by its allocated occupable segments to calculate the output
. .
2 的 同的利用率 而提前預知輸出 中 的 。本 The same utilization rate of 2 is predicted in advance in the output. This
中 輸出 余的 同小于等于 同的 5 就 輸出 她于 大于等于 空用的40拆 就 輸出 的 解除。 的某一輸出流出 現象..或者 解除 T 合上 上 用戶 ULP, 告之 的 以及 的輸出 30 由 LP 她 。 或解除 的 不固定力 5 和4 而是 可 ULP 用戶的需求 悉地修改 可以 e P o Oco Pa ame e s 的 修改 參數。 步驟 的方式 各 輸出 取出Message 在取出 輸出 中 于 ULP 的 essa e 切換到下一介輸出 . 的方式 輸出 中的數 于各 輸出 When the output of the same is less than or equal to 5, the output of 5 is greater than or equal to the empty 40, and the output is released. A certain output outflow phenomenon. . Or lift T to close the user ULP, and report the output of 30 by LP. Or the unfixed forces 5 and 4 are lifted, but the parameters that can be modified can be modified by the needs of ULP users. Step method: each output takes out Message. In taking out the output, the essa e in ULP is switched to the next output. The number in the output is in each output
5 是均等的 可 很好 解決 同 避免某一輸出 而造 成的 。 但是 有可能出現UL 先 到 輸出 A 的 . 5 is equal, which can be solved well and avoided by a certain output. However, it is possible that UL will output A first.
esSage .比UL 到 T 輸出 B上的 essage 2 送出去 不 精神相 只是 了 內 可以 。 于不同輸出 的 s a e ULP P的順序 E F的 中沒有要求也沒有 山 提供解決方法 esSage. Than UL to T output essage 2 on B is not sent out, it's just mental. There is no requirement nor a mountain in the order of s a e ULP P for different outputs. Provide solutions
但是 于 TP的上 有的 它需要 不同輸出 之 的數 ULp 蛇 的順序 的功能。 例如 U TP3用戶 的 P 活的 各 端的 3U 收到 的此 e . . 同 夏一介 c ve k 哈利 一介 T 5 假定 c ve k 送到 T 的 輸出 上 T 送到 的 輸出 上 在 神情況下 假如 T 比 c ve Ck先到客戶 那 客戶端的 U 合 D T 是 候的消息。 就需要 TP提供 不同輸出 之 的數 .UL P的順序 的功能。 But for TP, it needs the function of the order of the number of different output ULp snakes. For example, the U received by the TP3 user's P at each end of the 3U e. . Same as Xia Yijie c ve k Harry Yisuo T 5 Suppose c ve k sent to the output of T. T sent to the output. Under God's situation, if T comes to the client before c ve Ck, the client's U and DT are waiting for the message. . Need TP to provide the number of different outputs. UL P order function.
了 功能.本 在 的 依然 各 輸出 0 的方式 不 essa e坎的 小到大的順序 。 休的步 驟如下 The function. Originally, the way of outputting 0 is not in the order of essa ekan's small to large. Hugh's steps are as follows
a 將 essage 存入某一輸出 順序 essage 分配 只有 P 分成的 Ssage 分配相同 的 a save essage in a certain output order essage distribution only the Ssage distribution of P is the same
b . 輸出 取出 中 ULP 分成的一介或 多 essage 然 切換到下 介輸出 b. One or more essages divided by ULP in the output, and then switched to the intermediate output
c 前輸出 中 取出 essage 的 是否 前一介已 .取出的 es age坎的 相 如果是.返回步驟b 否則 行下 c Remove the essage from the previous output. If the es age is removed, it is the same. Return to step b otherwise
. .
d 切換到下一介輸出 返回步驟 )。 d Switch to the next media output and return to step).
0 所有輸出 中的 e age. 全部 送完 要把 新 。 0 e age in all outputs. New items will be sent after all items are delivered.
功能作力一介可 功能 。 S TP的上 需要 TP提供 功能 通 一介 出一介e ab e TP de nd指示 將 不同輸出 之同的數 ULP TP的順序 的方式 P的上 不再需要 P提供 功能的 也 Function can be functioned in one go. S TP needs TP to provide The function can be used to indicate the e-ab e TP de nd to indicate the order of the same number of different outputs ULP TP. The way that P no longer needs P to provide functions
出一介d sab e TP de nd指示 Out of the instructions for sab e TP de nd
將 到 的 方式。 上 可以 增加一介ULP到 TP的原 汞 將作力保 TP 不同輸出 的數 順序 的一 介 。 步驟 將取出的.Message 封裝成 TP ULP的指示決定0 是否在 TP 文中 多 es age The way to. The original mercury that can be added from ULP to TP will be used to ensure the order of the different output of TP. Steps to take out. Message encapsulated into TP ULP indicates whether 0 is more es age in TP text
各 輸出 取出 essage 的 是 在一起 的 3所示 包括以下步驟 The output of each output is taken together as shown in 3, including the following steps
步驟 0 前的輸出 取出 Message 將 封裝成 The output before step 0 takes out Message and encapsulates it into
a a huk a a huk
..步驟20 ULP的指示判斷是否 將多 es a e 如果 執行下一步, 否則 執行步驟80 . . Step 20: The ULP instruction determines whether there will be more es a e. If the next step is executed, otherwise step 80
步驟 0,判斷 essage 是否是未分 的ULP 或ULP 的 最 一介 ssage 如果是 執行下一步 否則 步驟50 Step 0, determine whether the essage is the undivided ULP or the most ssage of ULP. If yes, go to the next step; otherwise, step 50
步驟4 切換到下一輸出 Step 4 Switch to the next output
. :步驟50, 前的輸出 取出新 essage 封裝成Da a hu 步 . . : Step 50, the previous output takes out the new essage and encapsulates it into Da a hu step.
驟 60 判斷將新的 essage 是否滿足 ax m Ze 和 x ke z 限制 如果滿足 執行下一步 否則 執行步驟 00 其中 axPacke z 往最大 P U axEm ze nd nd u S d ng ze + P U 中的最小 nd 接收窗口 大小 d 窗口的大小 U and g ze 等待 Step 60: Determine whether the new essage satisfies the limits of ax m Ze and x ke z. If it is satisfied, go to the next step, otherwise go to step 00, where axPacke z goes to the maximum PU axEm ze nd nd u S d ng ze + the minimum nd receiving window size in PU d the size of the window U and g ze wait
的數 量的大小。 The size of the number.
步驟70 前的輸出 中取出 essage 將 封裝成 a a hunk 返回步驟30 Remove the essage from the output before step 70 and encapsulate it into a a hunk. Return to step 30
步驟 判斷 essag 是否未分 的ULP 或 L 分成的最 一介 age 如果是.執行下 步 否 。 步驟100 Step To determine whether the essag is not divided into ULP or L is divided into the minimum age if yes. Go to the next step No. Step 100
步驟90 切換到下一 輸出 步驟 00 將 前的 在一起的 a a h k 有可能只有一介 Da a hunk 封裝成 介 TP 非 出去 返回步驟 0 下一 Step 90 Switch to the next output Step 00 It is possible that the previous aahk together only has a Da a hunk encapsulated as a TP and goes out. Return to step 0 Next
的封裝 。 Package.
2中的 T o o e 是控制 on o hUnk 控制 的 on o hu k ue e就是 o o hunk的 。 The T o o e in 2 is controlled on o hUnk The on o hu k ue e controlled is o o hunk.
步驟 封裝好的 T 。 Step T is packaged.
了 征數 安全可靠 需要在兩端 各的 TP 之同建 立 的重 。 2 TP 輸出 在 T 的 中 除了 的每一介輸出 一介輸出 外、 了一 介 u s and ng 和一介重估 其中 輸出 申存放 逐末 的新 中存放已 但 未收到 的 數 重估 中存放 未收到需要 的數 都是 In order to be safe and reliable, it is necessary to establish the same TP on each end. 2 TP output in T, in addition to the output of each medium, a medium and us and ng and a medium revaluation. The numbers are
相 的 。 Phase of.
在 中 遵循 下原則 Follow the following principles in
.第一 如果到 地址上等待 的 大于或等于 wnd 則 不能再向此地址 新的數 . First, if the waiting at the address is greater than or equal to wnd, then no new number can be sent to this address
.第二 在任何 nd指示 沒有空同 . Second, there is no space in any nd instruction
都不能再 任何新 即 nd= 。 如果 wnd 不管 d .是多少 包括 0 是可以有一介 essage 正在 接 收 Nothing new can be called nd =. If wnd does not matter d. How many, including 0, can there be an essage being received
第三 在 新的 essage 前 必 須要先 那些 重估的 essage 由 前的 w d 限制 然 方可以 )和原則b)允 的數 汞 新的 essage 。 . 內容可參照現有 木 于重估 制的內容。 Third, before the new essage, those re-estimated essages must be limited by the previous w d) and principle b) allow the number of new mercury essages. . The content can refer to the content of the existing wooden revaluation system.
並 用性 Concurrency
.本 可以 于第三代 通信系統 如 系統 P輸 出 列管理和數 她 。 . It could have been used in third-generation communication systems such as system P for output management and counting.
Claims
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2005/002114 WO2007065296A1 (en) | 2005-12-07 | 2005-12-07 | Method for managing the sctp output stream queue and implementing date transmission |
| CN2005800513834A CN101248618B (en) | 2005-12-07 | 2005-12-07 | A flow control transmission protocol output flow queue management and data transmission processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2005/002114 WO2007065296A1 (en) | 2005-12-07 | 2005-12-07 | Method for managing the sctp output stream queue and implementing date transmission |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2007065296A1 true WO2007065296A1 (en) | 2007-06-14 |
Family
ID=38122454
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/CN2005/002114 Ceased WO2007065296A1 (en) | 2005-12-07 | 2005-12-07 | Method for managing the sctp output stream queue and implementing date transmission |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN101248618B (en) |
| WO (1) | WO2007065296A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546626A (en) * | 2011-12-31 | 2012-07-04 | 华为技术有限公司 | Data processing method, device and system |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101651687B (en) * | 2009-09-14 | 2012-07-04 | 华为技术有限公司 | Packet forming method, transmission method and device of data packet of flow control transmission protocol |
| CN111459417B (en) * | 2020-04-26 | 2023-08-18 | 中国人民解放军国防科技大学 | A lock-free transmission method and system for NVMeoF storage network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020126683A1 (en) * | 2001-03-12 | 2002-09-12 | Ulf Ahlfors | Scheduler method and device in a switch |
| CN1494277A (en) * | 2002-11-01 | 2004-05-05 | ��Ϊ��������˾ | Management method of data sending/receiving buffer in network communication |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100417156C (en) * | 2003-07-16 | 2008-09-03 | 中兴通讯股份有限公司 | Method and system for implementing data transmission in flow control transmission protocol |
-
2005
- 2005-12-07 WO PCT/CN2005/002114 patent/WO2007065296A1/en not_active Ceased
- 2005-12-07 CN CN2005800513834A patent/CN101248618B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020126683A1 (en) * | 2001-03-12 | 2002-09-12 | Ulf Ahlfors | Scheduler method and device in a switch |
| CN1494277A (en) * | 2002-11-01 | 2004-05-05 | ��Ϊ��������˾ | Management method of data sending/receiving buffer in network communication |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546626A (en) * | 2011-12-31 | 2012-07-04 | 华为技术有限公司 | Data processing method, device and system |
| WO2013097611A1 (en) * | 2011-12-31 | 2013-07-04 | 华为技术有限公司 | Data processing method, device and system |
| CN102546626B (en) * | 2011-12-31 | 2014-11-05 | 华为技术有限公司 | Data processing method, device and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101248618B (en) | 2010-11-24 |
| CN101248618A (en) | 2008-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| RU2007134860A (en) | METHOD AND SYSTEM OF INTELLECTUAL ROUTING | |
| SE521424C2 (en) | Surface systems for assigning service resources to users and device for maintaining at least one queue | |
| CN102098323A (en) | Status prompt method and system | |
| CN103152316A (en) | Achieving method, device and system for interactive voice response (IVR) | |
| WO2019128647A1 (en) | Message transmission method and device, storage medium and electronic device | |
| CN101355488B (en) | Method and system for controlling flow of information series business initiated by network | |
| WO2010148806A1 (en) | Self-adaptive method and system for dialing based on access point name (apn) | |
| WO2012062052A1 (en) | Method and system for queue processing based on call center | |
| CN102707997A (en) | Device and method for driving multi-PDP data communication of mobile broadband equipment | |
| CN102326376A (en) | Method, call center and system for agent terminal to access call | |
| WO2007065296A1 (en) | Method for managing the sctp output stream queue and implementing date transmission | |
| CN101127950B (en) | A SMS retry processing method, device and SMS center applying the same | |
| CN102065382B (en) | Method and system for dynamic flow control on message issuing of multimedia message service | |
| CN103200620A (en) | Method and device for accessing core network in long term evolution (LTE) system | |
| CN113037695A (en) | System, method, device and storage medium for realizing multimedia business card service | |
| CN104581659A (en) | Method for processing short message service information when transmission is refused and communication system | |
| CN112188545B (en) | Access control method, device, storage medium and base station | |
| CN100584055C (en) | Method and system for sending location information in queuing system | |
| CN101909283B (en) | M2M (Machine-to-Machine) platform and method for sharing load downloaded with in high capacity | |
| CN108076119B (en) | A kind of pre-service processing method and system | |
| TW201608510A (en) | Web server and network connection method thereof | |
| CN114710811B (en) | Data stream forwarding method, device, electronic device and storage medium | |
| CN119652871B (en) | Method for expanding concurrent incoming call quantity of VoIP equipment based on SIP message | |
| US20070159989A1 (en) | SIP enhancements to support network-wide overload control | |
| JP4146833B2 (en) | VoIP service system, call control server, and call control method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
| WWE | Wipo information: entry into national phase |
Ref document number: 200580051383.4 Country of ref document: CN |
|
| NENP | Non-entry into the national phase |
Ref country code: DE |
|
| 122 | Ep: pct application non-entry in european phase |
Ref document number: 05818634 Country of ref document: EP Kind code of ref document: A1 |