WO2008092325A1 - Procédé et nœud central pour réaliser un retard de paquet en rafale - Google Patents

Procédé et nœud central pour réaliser un retard de paquet en rafale Download PDF

Info

Publication number
WO2008092325A1
WO2008092325A1 PCT/CN2007/003094 CN2007003094W WO2008092325A1 WO 2008092325 A1 WO2008092325 A1 WO 2008092325A1 CN 2007003094 W CN2007003094 W CN 2007003094W WO 2008092325 A1 WO2008092325 A1 WO 2008092325A1
Authority
WO
WIPO (PCT)
Prior art keywords
core node
packet
delay
bhp
burst
Prior art date
Application number
PCT/CN2007/003094
Other languages
English (en)
French (fr)
Inventor
Yulei Qi
Sheng Wang
Du Xu
Shizhong Xu
Yi Zhang
Original Assignee
Huawei Technologies Co., Ltd.
University Of Electronic Science And Technology Of China
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co., Ltd., University Of Electronic Science And Technology Of China filed Critical Huawei Technologies Co., Ltd.
Priority to EP07816707.9A priority Critical patent/EP2073456B1/en
Priority to ES07816707.9T priority patent/ES2458143T3/es
Publication of WO2008092325A1 publication Critical patent/WO2008092325A1/zh
Priority to US12/469,286 priority patent/US8059535B2/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/11—Identifying congestion
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/17—Interaction among intermediate nodes, e.g. hop by hop
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H04Q11/0066—Provisions for optical burst or packet networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0005—Switch and router aspects
    • H04Q2011/0007—Construction
    • H04Q2011/002—Construction using optical delay lines or optical buffers or optical recirculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0005—Switch and router aspects
    • H04Q2011/0037—Operation
    • H04Q2011/0045—Synchronisation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0005—Switch and router aspects
    • H04Q2011/0037—Operation
    • H04Q2011/005—Arbitration and scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H04Q2011/0064—Arbitration, scheduling or medium access control aspects

Definitions

  • the present invention relates to optical communication technologies, and in particular, to a method and a core node for implementing burst packet forward delay. Background technique
  • FIG. 1 shows the structure of an OBS (Optical Burst Switching) network.
  • the OBS network consists of an edge router and a core router.
  • the edge node is used to assemble the incoming IP packets into bursts and schedule the generated bursts to the output wavelength.
  • the core node is mainly used to switch the corresponding burst packet from the input port to the appropriate output port according to the information carried in the BHP (Burst header packet).
  • the core node is also used to process the burst packet. Conflicts to achieve higher exchange throughput.
  • the core node will receive the BHP arriving in advance before forwarding the burst packet.
  • the information carried in the BHP determines the characteristics of the burst packet from the port, such as arrival time, duration (burst length), port and wavelength information, Priority, etc., the core node processes the BHP from all ports, determines the configuration state of the optical switch array at each moment, and sends all burst packets to the intended output port as much as possible.
  • the characteristics of the optical burst switching network itself determine the inevitability of the existence of burst packet competition. When multiple burst packets compete for the same wavelength of the same port at the same time, a conflict arises. A burst of packet contention will cause network congestion, causing a large amount of data loss. How to avoid or reduce the data loss caused by sudden competition in the network becomes the key to whether the optical burst switching technology can finally become practical.
  • the resolution of conflicts depends on caching, but in the optical domain, the true random storage mechanism does not exist.
  • the optical domain buffer can only be implemented by using FDL (Fiber Delay Line).
  • FDL Field Delay Line
  • the burst packet conflict can be effectively reduced. Due to the limitation of signal quality and physical space, the size of FDL buffer has certain limitations.
  • FDL will introduce power loss. If optical signal amplifier is used to compensate power, it will increase noise, but with optical signal regeneration, the cost is too high. high. In the case that the core node does not have FDL or FDL is unavailable, if the number of burst packets transmitted at the same time exceeds the number of available wavelength channels, packet loss will occur.
  • FIG. 2 is a schematic diagram of delaying burst packets by using BORA in the prior art, wherein (a) is a schematic diagram of burst packet transmission when the BORA algorithm is not used, and (b) is a burst after using the BORA algorithm.
  • the core node shown in the figure has two ingress paths X and Y and one outbound path Z, each path having one control channel and two data channels.
  • the BORA algorithm When the BORA algorithm is not used, as shown in (a), 4 bursts of 4 data channels of the time (tl, t2) into the path overlap, and the overlap is 4; After the algorithm, as shown in (b), the overlap is reduced by making a certain delay to the burst.
  • the BORA algorithm mainly applies the scheduling technique to the edge nodes, and does not better play the role of the core nodes. Summary of the invention
  • the embodiment of the invention provides a method and a core node for implementing burst packet delay, which reduces the probability of burst packet conflict by making full use of the FDL configured in the network.
  • An embodiment of the present invention provides a method for implementing burst packet delay, including the following steps:
  • the core node determines the burst packet in which the delay needs to be delayed. , specifying the corresponding delay duration for it;
  • the core node reserves a corresponding resource according to the received BHP and the burst packet whose delay duration is required to be delayed, and generates a corresponding BHP, and sends the generated BHP to the downstream core node; when the core node receives the required When a delayed burst packet is dispatched, it is dispatched to the corresponding reserved resource and sent to the downstream core node.
  • the embodiment of the invention provides a core node, including:
  • a BHP receiving module configured to receive a BHP
  • the delay control module when the BHP received by the BHP receiving module indicates that a burst packet overlap occurs on the link to be protected, and is used to determine a burst packet that needs to be delayed according to the received BHP, and specify a corresponding delay duration for the burst packet. And reserve corresponding resources for the burst packets that need to be delayed and generate corresponding BHP;
  • the BHP sending module is configured to send the BHP generated by the delay control module to the downstream core node.
  • An embodiment of the present invention further provides a method for implementing burst packet delay, including the following steps:
  • the core node determines the burst packet that needs to be delayed and the corresponding delay duration
  • the core node is capable of sending a delay request packet to an upstream core node, sending a delay request packet to the upstream core node according to the delay duration;
  • the core node that receives the delay request packet if the burst packet can be delayed according to the request of the delay request packet, release the previously reserved resource of the burst packet, re-reserve the resource for it, and regenerate the corresponding BHP Send to the downstream core node.
  • the embodiment of the invention further provides a core node, including:
  • BHP receiving module for receiving BHP
  • a burst packet receiving module configured to receive a burst packet
  • a delay request sending module configured to send a delayed request packet to an upstream core node
  • the judging module when the BHP received by the BHP receiving module indicates that the corresponding burst packet will collide at the egress port, is used to determine whether it is necessary to send a delay request packet to the upstream core node, and if so, trigger the delay request sending module to The tour core node sends a delay request packet, otherwise, the control burst packet receiving module discards the burst packet when it receives the burst packet.
  • the embodiment of the invention further provides a core node, including:
  • BHP sending module used to send BHP
  • a delay request receiving module configured to receive a delay request packet sent by a downstream core node, and a resource reservation module, configured to reserve a corresponding resource for the burst packet;
  • a judging module configured to determine whether the burst packet can be delayed according to the request of the delay request packet received by the delay request receiving module, and if yes, release the previously reserved resource of the burst packet, and trigger the resource reservation module to re-reserve the reservation Resources, and regenerate the corresponding BHP pass, BHP send module Sent to the downstream core node, otherwise, release the previously reserved resources of the burst packet.
  • the core node configured with the FDL when the core node configured with the FDL predicts that the burst packet overlap occurs on the link to be protected, it can actively delay the burst packet that will overlap, thereby reducing the downstream desire. The possibility of a burst of packets on the protection link.
  • the core node when it finds that its egress port will have a burst packet collision at a certain moment in the future, it can send a burst packet delay request to the upstream core node, requesting a core node configured with FDL and having delay capability upstream. Helping it delay bursts, making full use of the FDL configured in the network, reducing the probability of burst packet collisions.
  • 1 is a schematic structural diagram of an OBS network
  • FIG. 2 is a schematic diagram of delaying burst packets by using BORA in the prior art
  • FIG. 3 is a flowchart of a first method for implementing burst packet delay according to an embodiment of the present invention
  • FIG. 4 is a flowchart of a second method for implementing burst packet delay according to an embodiment of the present invention
  • a block diagram of the first core node in the example
  • FIG. 6 is a flowchart of a third method for implementing burst packet delay according to an embodiment of the present invention
  • FIG. 7 is a structural block diagram of a second core node according to an embodiment of the present invention.
  • FIG. 8 is a structural block diagram of a third core node according to an embodiment of the present invention. detailed description
  • FIG. 3 is a flow chart of a method for implementing burst packet delay according to an embodiment of the present invention.
  • the main implementation process is as follows:
  • Step S10 The BHP reaches the core node where the FDL is configured, and the core node performs optical-electrical conversion on the BHP, and reads information carried in the BHP (such as the arrival and end time of the burst packet), and the information carried in the BHP is displayed.
  • the burst packet destined for the link to be protected will be in the core section at some point in the future. A burst of packets overlaps on the link to protect the point.
  • Step S11 The core node determines a burst packet that needs to be delayed according to a preset scheduling algorithm, specifies a corresponding delay duration for the burst packet that needs to be delayed, and reserves a corresponding resource for the burst packet that needs to be delayed, so that the burst The overlap of the packets is reduced to 1.
  • the core node may be a core node configured with a wavelength converter, or may be a core node without a wavelength converter, and the core node configured with the wavelength converter may be at an output port different from the wavelength of the burst packet port.
  • the wavelength is a burst packet reservation resource, and the core node that is not configured with the wavelength converter can reserve resources for the burst packet only at the wavelength of the same out port as the burst packet entry port.
  • Step S12 The core node generates a corresponding BHP according to the reserved resource, and sends the generated BHP to the downstream core node.
  • Step S13 When the core node receives the burst packet that needs to be delayed, it dispatches it to the corresponding reserved resource and sends it to the downstream core node.
  • the embodiment of the present invention further provides a method for implementing burst packet delay in the case of setting an overlap threshold, by setting a target for each core node configured with FDL.
  • the overlap threshold of the link so that the core node configured with the FDL delays the burst packet only when the overlap of the burst packets passing through the node and going to the link to be protected is greater than the overlap threshold. deal with.
  • FIG. 4 which is a flowchart of a method for implementing burst packet delay in an embodiment of the present invention, the main implementation process is as follows:
  • Step S20 The BHP reaches the core node where the FDL is configured, and the core node performs optical-electrical conversion on the BHP, and reads information carried in the BHP (such as the arrival and end time of the burst packet), and the information carried in the BHP is displayed.
  • the corresponding burst packet will overlap with the burst on the core node's protected link at some point in the future.
  • Step S21 The core node determines whether the overlap degree of the burst packet reaches an overlap threshold set for the protection link, and if yes, step S22 is performed, otherwise, step S23 is performed.
  • an overlap threshold is set for the core node and for the link to be protected.
  • the methods include but are not limited to the following two methods, which are respectively explained below:
  • the first mode is a route-based overlap threshold determination mechanism: the overlap threshold for the protected link is set for the core node according to the following formula:
  • ⁇ denotes the overlap threshold for the protected link set for the core node i
  • M denotes the chain to be protected
  • N The total number of data channels of the road
  • N represents the number of all paths that pass through the core node configured with the FDL and pass through the link to be protected.
  • the second mode is a traffic-based overlap threshold determination mechanism: the overlap threshold for the protected link is set for the core node according to the following formula:
  • ⁇ denotes the overlap threshold for the protected link set for the core node i
  • M denotes the total number of data channels of the link to be protected
  • P1 denotes the core node i passing through the window time and wearing
  • ! k represents the total traffic flow through the core node configured with the FDL and through the link to be protected during the window time.
  • the core node i performs statistics on the service traffic that passes through the core node i and passes through the to-be-protected link in the current window time, and uses the statistic value as the core window i through the next window time.
  • the traffic traffic prediction value of the link to be protected is
  • Step S22 The core node determines a burst packet that needs to be delayed according to a preset scheduling algorithm, specifies a corresponding delay duration for the burst packet that needs to be delayed, and reserves a corresponding resource for the burst packet that needs to be delayed, so that the burst
  • the overlap degree of the packets is less than the overlap degree threshold, and the process proceeds to step S24.
  • Step S23 The core node does not perform any processing.
  • Step S24 The core node generates a corresponding BHP according to the reserved resource, and sends the generated BHP to the downstream core node.
  • Step S25 When the core node receives the burst packet that needs to be delayed, it dispatches it to the corresponding reserved resource and sends it to the downstream core node.
  • the embodiment of the present invention further provides a core node.
  • FIG. 5 the figure is a structural block diagram of a first core node according to an embodiment of the present invention, which mainly includes BHP receiving module, delay control module and BHP sending module, the main functions of each module are as follows:
  • the BHP receiving module is configured to receive the BHP delivered by the upstream node.
  • the delay control module is configured to determine, according to the received BHP, a burst packet that needs to be delayed according to the received BHP, when the BHP display receives the burst packet overlap on the link to be protected, and specifies a corresponding delay duration.
  • the BHP display module receives the BHP display, the burst control overlap occurs on the link to be protected, and the delay control module further determines Whether the overlap degree of the burst packet reaches an overlap degree threshold allocated for the link to be protected, and if yes, determining a burst packet that needs to be delayed according to the received BHP, and assigning a corresponding delay duration thereto, and The corresponding resources are reserved for the burst packets that need to be delayed and the corresponding BHP is generated, so that the overlap degree of the burst packets is smaller than the overlap degree threshold.
  • the BHP sending module is configured to send the BHP generated by the delay control module to the downstream core node.
  • the core node configured with the FDL can actively overlap the burst packet that will overlap when it predicts that a burst packet overlap will occur on the link to be protected. Delay processing is performed, thereby reducing the possibility of bursting of packets on the downstream protection link.
  • the overlap degree of the burst packet is first determined. Whether it is greater than the preset overlap threshold, if yes, the active pair of bursts that will overlap will avoid the excessive use of FDL, which will introduce signal attenuation and increase the end-to-end delay.
  • FIG. 6 is a flowchart of a third method for implementing burst packet delay according to an embodiment of the present invention, where the main implementation process is as follows:
  • Step S30 The BHP reaches the core node, and the core node may be configured with FDL or not. Set the FDL, the core node performs optical-electrical conversion on the BHP, reads the information carried in the BHP (such as the arrival and end time of the burst packet, etc.), and the information carried in the BHP shows that the corresponding burst packet is in the future. A burst packet collision will occur on the egress port of the core node at a time.
  • Step S31 The core node that generates the burst packet collision determines the burst packet that needs to be delayed according to the preset scheduling algorithm, and the corresponding delay duration, and determines whether the neighboring BHP corresponding to the delayed burst packet needs to be adjacent to each other.
  • the upstream core node sends a delay request packet, and if so, step S32 is performed, otherwise, step S33 is performed.
  • the current core node determines that the delay request packet can be sent to the upstream core node;
  • T represents the offset time carried in the BHP or delayed request packet received by the current core node
  • L represents the distance between the current core node and its upstream core node
  • V represents the transmission rate of the deferred request
  • t pro represents the upstream core node receiving Delay the request, re-reserve resources for the bursts that need to be delayed and the time required to generate the corresponding BHP.
  • Step S32 The core node that overlaps the burst packet sends a delay request packet to the adjacent upstream core node, where the packet carries a delay duration and an offset time field specified for the burst packet that needs to be delayed, where the offset The time field is the offset time between the burst packet and the corresponding burst packet when the delay request packet arrives at the previous core node, and the flow proceeds to step S34.
  • Step S33 The core node that will overlap the burst packet discards the burst packet that needs to be delayed when it arrives.
  • Step S34 The core node receiving the delay request packet determines whether the FDL is configured by itself, and if yes, executing step S35; otherwise, executing step S37.
  • Step S35 The core node that receives the delay request packet determines whether it can delay the burst packet according to the requirement of the delay duration field in the delay request packet. If yes, step S36 is performed; otherwise, step S37 is performed.
  • Step S36 The core node that receives the delay request packet releases the previously reserved subscription of the burst packet. Source, re-reserve resources for it, and regenerate the corresponding BHP to send to the downstream core node.
  • Step S37 The core node that receives the delay request packet releases the previously reserved resource of the burst packet, and determines, according to the offset time field carried in the delay request packet, whether the delayed request packet is sent to the upper core node, and if yes, the step is performed. S38, otherwise, step S39 is performed.
  • the core node that receives the delay request packet determines that the delay request packet can be sent to the upper core node;
  • T represents the offset time carried in the delay request packet received by the core node
  • L represents the distance between the current core node and the previous core node
  • V represents the transmission rate of the deferred request
  • Step S38 The core node that receives the delay request packet changes the offset time field in the delay request packet, and sends the changed delay request packet to the previous core node, where the offset time field is the delayed request packet arrives at the previous core.
  • the offset time between the node and its corresponding burst packet is returned to step S34.
  • Step S39 The core node that receives the delay request packet discards the burst packet that needs to be delayed when it arrives.
  • the embodiment of the present invention further proposes two core nodes.
  • FIG. 7 is a structural block diagram of a second core node according to an embodiment of the present invention, which mainly includes a BHP receiving module, a burst packet receiving module, a delay request packet sending module, and a determining module, wherein the main functions of each module are as follows:
  • BHP receiving module for receiving BHP
  • a burst packet receiving module configured to receive a burst packet delivered by an upstream node
  • a delay request packet sending module configured to send a delay request packet to an upstream core node;
  • the judging module when the BHP received by the BHP receiving module displays that its corresponding burst packet will collide at the egress port, is used to determine whether it is necessary to send a delay request packet to the upstream core node, and if so, trigger the delay request sending module to The tour core node sends a delay request packet, otherwise, the control burst packet receiving module discards the burst packet when it receives the burst packet.
  • FIG. 8 is a structural block diagram of a third core node according to an embodiment of the present invention, which mainly includes a BHP sending module, a delay request receiving module, a resource reservation module, and a determining module, wherein the main functions of each module are as follows:
  • BHP sending module used to send BHP
  • a delay request receiving module configured to receive a delay request packet sent by a downstream core node, and a resource reservation module, configured to reserve a corresponding resource for the burst packet;
  • a determining module configured to determine whether the burst packet is delayed according to a request of the delay request packet received by the delay request receiving module, and if yes, triggering the resource reservation module to release the resource previously reserved for the burst packet, and The resource is reserved, and the corresponding BHP is regenerated and sent to the downstream core node through the BHP sending module. Otherwise, the previously reserved resource of the burst packet is released.
  • the core node finds that its egress port will send a burst packet delay request to the upstream core node when the burst port conflict occurs at a certain time in the future, requesting the upstream configuration.
  • a core node with FDL and delay capability delays burst packets, thereby fully utilizing the FDL configured in the network and reducing the probability of burst packet collision.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Description

实现突发包延迟的方法及核心节点 技术领域
本发明涉及光通信技术， 尤其涉及一种实现突发包前向延迟的方法及核 心节点。 背景技术
图 1所示为 OBS ( Optical burst switching, 光突发交换） 网络的结构示意 图，由图中可见， OBS网络由边缘节点（Edge router )与核心节点（Core router ) 组成。 边缘节点用于将输入的 IP分组组装成突发包， 并将生成的突发包调度 到输出波长上。 核心节点主要用于根据 BHP ( Burst header packet, 突发头分 组） 中携带的信息将对应的突发包从输入端口交换到合适的输出端口， 另夕卜， 核心节点也用于处理突发包冲突， 以达到较高的交换吞吐量。 核心节点在转 发突发包前将收到先期到达的 BHP, BHP中携带的信息决定了来自该端口的 突发包的特性， 如到达时间、 持续时间 （突发长度）、 端口和波长信息、 优先 级等， 核心节点对来自所有端口的 BHP进行处理， 决定每一时刻光交换阵列 的配置状态， 以尽可能将所有突发包发往预期的输出端口。
光突发交换网络本身的特点决定了突发包竟争存在的必然性， 当多个突 发包在同一时刻竟争同一出端口的相同波长时， 冲突就产生了。 突发包竟争 将会导致网络阻塞， 从而引起大量的数据丟失。 如何避免或降低网络中突发 竟争导致的数据丟失， 成为光突发交换技术能否最终走向实用的关键。
在传统的电交换网络中， 冲突的解决依赖于緩存， 但在光域， 真正意义 上的随机存储机制还不存在。 目前光域緩存只能依靠 FDL ( Fiber delay lines, 光纤延迟线）来实现， 现有技术中通过在核心节点上配置 FDL可以有效的降 低突发包的冲突。 由于受到信号质量和物理空间的限制， FDL緩存的大小具 有一定的局限性， 另外釆用 FDL会引入功率损耗， 若用光信号放大器补偿功 率， 会增加噪声， 而用光信号再生， 则成本太高。 在核心节点没有 FDL或 FDL不可用的情况下，如果同时传送的突发包的 个数超过了可用的波长信道数目，就会导致丟包，现有技术中通常釆用 BORA ( Burst Overlap Reduction Algorithm , 交叠度缩减算法） 来降低突发包丟包现 象的产生。 BORA的原理是通过边缘节点的电緩存对进入 OBS网络的突发包 作一定的延迟， 以便尽可能地减小突发包的交叠， 从而减小了在下游核心节 点发生冲突的概率。 图 2所示为现有技术中釆用 BORA对突发包进行延迟的 示意图， 其中 （a )为未釆用 BORA算法时突发包传输的示意图， （b )为釆用 BORA算法后突发包传输的示意图， 图中所示的核心节点有 2个入通路 X和 Y和 1个出通路 Z,每个通路都有 1个控制信道和 2个数据信道。未釆用 BORA 算法时， 如（a ) 中所示， 时间 （tl , t2 )入通路的 4个数据信道中有 4个突 发包交叠在一起， 其交叠度为 4; 釆用 BORA算法后， 如（b ) 中所示， 通过 对突发包作一定的延迟减小了交叠度。 然而， BORA算法主要将调度技术应 用到边缘节点， 没有更好的充分发挥核心节点的作用。 发明内容
本发明实施例提供了实现突发包延迟的方法及核心节点， 通过充分利用 网络中配置的 FDL来降低突发包发生冲突的几率。
本发明实施例提供了一种实现突发包延迟的方法， 包括步骤：
当核心节点收到的突发头分组 BHP指示去往欲保护链路的突发包将在欲 保护链路上发生突发包交叠时， 所述核心节点确定其中需要被延迟的突发包 , 为其指定相应的延迟时长；
所述核心节点根据接收到的 BHP及所述延迟时长为需要延迟的突发包预 约相应的资源及生成相应的 BHP, 并将生成的 BHP发送给下游核心节点； 当所述核心节点收到需要延迟的突发包时， 将其调度到相应的预约资源 中发送给下游核心节点。
本发明实施例提供了一种核心节点， 包括：
BHP接收模块， 用于接收 BHP; 延迟控制模块，当 BHP接收模块接收到的 BHP指示欲保护链路上将发生 突发包交叠时， 用于根据接收到的 BHP确定需要延迟的突发包， 为其指定相 应的延迟时长， 并为需要延迟的突发包预约相应的资源及生成相应的 BHP;
BHP发送模块， 用于将延迟控制模块生成的 BHP发送给下游核心节点。 本发明实施例进一步提供了一种实现突发包延迟的方法， 包括步骤：
A、 当核心节点收到的 BHP指示其对应的突发包将在自身的出端口发生 冲突时， 该核心节点确定出需要延迟的突发包及相应的延迟时长；
B、 如果所述核心节点能够向上游核心节点发送延迟请求分组， 则根据所 述延迟时长向上游核心节点发送延迟请求分组；
C、接收到延迟请求分组的核心节点， 如果能够按照延迟请求分组的要求 延迟所述突发包， 则释放所述突发包先前预约的资源， 重新为其预约资源， 并重新生成相应的 BHP发送给下游核心节点。
本发明实施例进一步提供了一种核心节点， 包括：
BHP接收模块， 用于接收 BHP;
突发包接收模块， 用于接收突发包；
延迟请求发送模块， 用于向上游核心节点发送延迟请求分组；
判断模块，当 BHP接收模块接收到的 BHP指示其对应的突发包将在出端 口发生冲突时， 用于判断是否有必要向上游核心节点发送延迟请求分组， 若 是， 则触发延迟请求发送模块向上游核心节点发送延迟请求分组， 否则， 控 制突发包接收模块接收到所述突发包时将其丟弃。
本发明实施例进一步提供了一种核心节点， 包括：
BHP发送模块， 用于发送 BHP;
延迟请求接收模块， 用于接收下游核心节点发出的延迟请求分组； 资源预约模块， 用于为突发包预约相应的资源；
判断模块， 用于判断能否按照延迟请求接收模块接收到的延迟请求分组 的要求延迟所述突发包， 若是， 则释放所述突发包先前预约的资源， 触发资 源预约模块重新为其预约资源， 并重新生成相应的 BHP通过， BHP发送模块 发送给下游核心节点， 否则， 释放所述突发包先前预约的资源。
本发明实施例中， 配置了 FDL的核心节点在预测到其欲保护链路上将发 生突发包交叠时， 能够主动对将发生交叠的突发包进行延迟处理， 从而降低 了下游欲保护链路上发生突发包交叠的可能性。
本发明实施例中， 核心节点发现自身的出端口在将来某一时刻将发生突 发包冲突时，能够向上游核心节点发送突发包延迟请求，请求上游配置有 FDL 且具有延迟能力的核心节点帮其延迟突发包， 从而充分利用了网络中配置的 FDL, 降低了突发包冲突的几率。 附图说明
图 1为 OBS网络的结构示意图；
图 2为现有技术中釆用 BORA对突发包进行延迟的示意图；
图 3为本发明实施例中第一种实现突发包延迟的方法的流程图； 图 4为本发明实施例中第二种实现突发包延迟的方法的流程图； 图 5为本发明实施例中第一种核心节点的结构框图；
图 6为本发明实施例中第三种实现突发包延迟的方法的流程图； 图 7为本发明实施例中第二种核心节点的结构框图；
图 8为本发明实施例中第三种核心节点的结构框图。 具体实施方式
下面将结合各个附图对本发明实施例的具体实施过程进行进一步详细的 阐述。
请参阅图 3 ,该图为本发明实施例中第一种实现突发包延迟的方法的流程 图， 其主要实现过程为：
步骤 S10、 BHP到达配置了 FDL的核心节点， 所述核心节点对 BHP进行 光-电转换， 读取 BHP中携带的信息（如突发包的到达和结束时刻等）， BHP 中携带的信息显示去往欲保护链路的突发包在将来某一时刻将在所述核心节 点的欲保护链路上发生突发包交叠。
步骤 Sll、 所述核心节点根据预先设置的调度算法确定需要延迟的突发 包， 为需要延迟的突发包指定相应的延迟时长， 并为需要延迟的突发包预约 相应的资源， 使突发包的交叠度降为 1。
所述核心节点可以是配置了波长变换器的核心节点， 也可以是没有配置 波长变换器的核心节点， 配置了波长变换器的核心节点可在与突发包入端口 的波长不同的出端口的波长上为突发包预约资源， 没有配置波长变换器的核 心节点只能在与突发包入端口相同的出端口的波长上为突发包预约资源。
步骤 S12、 所述核心节点根据所述预约资源生成相应的 BHP, 并将生成 的 BHP发送给下游核心节点。
步骤 S13、 当所述核心节点收到需要延迟的突发包时，将其调度到相应的 预约资源中发送给下游核心节点。
上述方法中， 配置了 FDL的核心节点只要发现突发包在将来某一时刻将 发生交叠， 即使用 FDL将其 "错开"， 过多的使用 FDL会增大端到端的延迟， 同时带来信号的衰减， 为避免上述问题的发生， 本发明实施例进而提出一种 在设置交叠度门限的情况下实现突发包延迟的方法， 通过为每个配置了 FDL 的核心节点设置针对欲保护链路的交叠度门限， 使得配置了 FDL的核心节点 只有在发现经过本节点且去往欲保护链路的突发包的交叠度大于交叠度门限 时， 才对突发包进行延迟处理。 请参阅图 4, 该图为本发明实施例中第二种实 现突发包延迟的方法的流程图， 其主要实现过程为：
步骤 S20、 BHP到达配置了 FDL的核心节点， 所述核心节点对 BHP进行 光-电转换， 读取 BHP中携带的信息（如突发包的到达和结束时刻等）， BHP 中携带的信息显示其对应的突发包在将来某一时刻将在所述核心节点的欲保 护链路上发生突发包交叠。
步骤 S21、所述核心节点判断所述突发包的交叠度是否达到针对所述欲保 护链路设置的交叠度门限， 若是， 执行步骤 S22, 否则， 执行步骤 S23。
本实施例中， 针对所述核心节点且针对所述欲保护链路设置交叠度门限 的方式包括但不限于以下两种方式， 下面分别予以说明：
第一种方式为基于路由的交叠度门限确定机制： 根据下述公式为所述核 心节点设置针对所述受保护链路的交叠度门限：
1 Ν
式中， ^表示为核心节点 i设置的针对所述受保护链路的交叠度门限， 表 示穿过核心节点 i且穿过所述欲保护链路的路径数， M表示所述欲保护链路的 数据信道总数， N表示穿过配置了 FDL的核心节点且穿过所述欲保护链路的所 有路径数。
第二种方式为基于流量的交叠度门限确定机制： 根据下述公式为所述核 心节点设置针对所述受保护链路的交叠度门限：
∑Pk
k=l
式中， ^表示为核心节点 i设置的针对所述受保护链路的交叠度门限， M 表示所述欲保护链路的数据信道总数， Pl表示在窗口时间内穿过核心节点 i 且穿过所述欲保护链路的业务流量， ! k表示在窗口时间内穿过配置了 FDL 的核心节点且穿过所述欲保护链路的总业务流量。其中， 所述核心节点 i在当 前窗口时间内对穿过核心节点 i且穿过所述欲保护链路的业务流量进行统计， 将统计值做为下一窗口时间内穿过核心节点 i且穿过所述欲保护链路的业务 流量预测值。
步骤 S22、 所述核心节点根据预先设置的调度算法确定需要延迟的突发 包， 为需要延迟的突发包指定相应的延迟时长， 并为需要延迟的突发包预约 相应的资源， 使突发包的交叠度小于交叠度门限， 转步骤 S24。
步骤 S23、 所述核心节点不进行任何处理。
步骤 S24、 所述核心节点根据所述预约资源生成相应的 BHP, 并将生成 的 BHP发送给下游核心节点。 步骤 S25、 当所述核心节点收到需要延迟的突发包时，将其调度到相应的 预约资源中发送给下游核心节点。
相应于上述两种实现突发包延迟的方法， 本发明实施例进而提出了一种 核心节点， 请参阅图 5, 该图为本发明实施例中第一种核心节点的结构框图， 其主要包括 BHP接收模块、延迟控制模块及 BHP发送模块，其中各个模块的 主要作用如下：
BHP接收模块， 用于接收上游节点下发的 BHP。
延迟控制模块，当 BHP接收模块接收到的 BHP显示欲保护链路上将发生 突发包交叠时， 用于根据接收到的 BHP确定需要延迟的突发包， 为其指定相 应的延迟时长， 并为需要延迟的突发包预约相应的资源及生成相应的 BHP; 较佳的，当 BHP接收模块收到的 BHP显示欲保护链路上将发生突发包交 叠时 , 延迟控制模块进一步判断所述突发包的交叠度是否达到针对所述欲保 护链路分配的交叠度门限， 若是， 则根据接收到的 BHP确定需要延迟的突发 包， 为其指定相应的延迟时长， 并为需要延迟的突发包预约相应的资源及生 成相应的 BHP, 使得突发包的交叠度小于所述交叠度门限。
BHP发送模块， 用于将延迟控制模块生成的 BHP发送给下游核心节点。 釆用上述第一种实现突发包延迟的方法后， 配置了 FDL的核心节点在预 测到其欲保护链路上将发生突发包交叠时， 能够主动对将发生交叠的突发包 进行延迟处理， 从而降低了下游欲保护链路上发生突发包交叠的可能性。
进一步， 釆用上述第二种实现突发包延迟的方法后， 配置了 FDL的核心 节点在预测到其欲保护链路上将发生突发包交叠时， 首先判断突发包的交叠 度是否大于预先设置的交叠度门限， 若是， 则主动对将发生交叠的突发包进 时又避免了过多使用 FDL会引入信号衰减， 增大端到端的延迟的问题。
请参阅图 6,该图为本发明实施例中第三种实现突发包延迟的方法的流程 图， 其主要实现过程为：
步骤 S30、 BHP到达核心节点， 该核心节点可以配置 FDL, 也可以不配 置 FDL, 所述核心节点对 BHP进行光 -电转换，读取 BHP中携带的信息 (如 突发包的到达和结束时刻等）， BHP中携带的信息显示其对应的突发包在将来 某一时刻将在所述核心节点的出端口上发生突发包冲突。
步骤 S31、将发生突发包冲突的核心节点根据预先设置的调度算法确定需 要被延迟的突发包及相应的延迟时长， 并根据需要被延迟的突发包对应的 BHP判断是否来得及向相邻的上游核心节点发送延迟请求分组， 若是， 则执 行步骤 S32 , 否则， 执行步骤 S33。
其中，当前核心节点接收到的 BHP中携带的偏移时间 T满足下述公式时， 当前核心节点确定能来得及向上游核心节点发送延迟请求分组；
Figure imgf000010_0001
式中， T表示当前核心节点接收到的 BHP或延迟请求分组中携带的偏移 时间， L表示当前核心节点与其上游核心节点的距离， V表示延期请求的发送 速率， tpro表示上游核心节点接收延迟请求， 重新为需要延迟的突发包预约资 源及生成相应的 BHP所需要的时间。
步骤 S32、将发生突发包交叠的核心节点向相邻的上游核心节点发送延迟 请求分组， 分组中携带有为需要延迟的突发包指定的延迟时长及偏移时间字 段， 所述偏移时间字段为延迟请求分组到达上一核心节点时与其对应的突发 包之间的偏移时间， 转步骤 S34。
步骤 S33、将发生突发包交叠的核心节点待所述需要延迟的突发包到达时 将其丟弃。
步骤 S34、 收到延迟请求分组的核心节点判断自身是否配置了 FDL, 若 是， 执行步骤 S35 , 否则， 执行步骤 S37。
步骤 S35、收到延迟请求分组的核心节点判断自身能否按照延迟请求分组 中延迟时长字段的要求延迟所述突发包， 若是， 执行步骤 S36 , 否则， 执行步 骤 S37。
步骤 S36、 收到延迟请求分组的核心节点释放所述突发包先前预约的资 源， 重新为其预约资源， 并重新生成相应的 BHP发送给下游核心节点。 步骤 S37、 收到延迟请求分组的核心节点释放所述突发包先前预约的资 源， 根据延迟请求分组中携带的偏移时间字段判断是否来得及向上一核心节 点发送延迟请求分组， 若是， 则执行步骤 S38, 否则， 执行步骤 S39。
其中， 核心节点接收到的延迟请求分组中携带的偏移时间 T满足下述公 式时， 收到延迟请求分组的核心节点判定能来得及向上一核心节点发送延迟 请求分组；
Figure imgf000011_0001
式中， T表示核心节点接收到的延迟请求分组中携带的偏移时间， L表示 当前核心节点与上一核心节点的距离， V表示延期请求的发送速率， t。表示 上一核心节点接收延迟请求， 重新为需要延迟的突发包预约资源及生成相应 的 BHP所需要的时间。
步骤 S38、收到延迟请求分组的核心节点更改延迟请求分组中的偏移时间 字段， 将更改后的延迟请求分组发送给上一核心节点， 所述偏移时间字段为 延迟请求分组到达上一核心节点时与其对应的突发包之间的偏移时间， 返回 步骤 S34。
步骤 S39、收到延迟请求分组的核心节点待所述需要延迟的突发包到达时 将其丟弃。
相应于上述第三种实现突发包延迟的方法， 本发明实施例进而提出了两 种核心节点。
请参阅图 7, 该图为本发明实施例中第二种核心节点的结构框图， 其主要 包括 BHP接收模块、 突发包接收模块、 延迟请求分组发送模块和判断模块， 其中各个模块的主要作用如下：
BHP接收模块， 用于接收 BHP;
突发包接收模块， 用于接收上游节点下发的突发包；
延迟请求分组发送模块， 用于向上游核心节点发送延迟请求分组； 判断模块，当 BHP接收模块接收到的 BHP显示其对应的突发包将在出端 口发生冲突时， 用于判断是否有必要向上游核心节点发送延迟请求分组， 若 是， 则触发延迟请求发送模块向上游核心节点发送延迟请求分组， 否则， 控 制突发包接收模块接收到所述突发包时将其丟弃。
请参阅图 8, 该图为本发明实施例中第三种核心节点的结构框图， 其主要 包括 BHP发送模块、 延迟请求接收模块、 资源预约模块和判断模块， 其中各 个模块的主要作用如下：
BHP发送模块， 用于发送 BHP;
延迟请求接收模块， 用于接收下游核心节点发出的延迟请求分组； 资源预约模块， 用于为突发包预约相应的资源；
判断模块， 用于判断能否按照延迟请求接收模块接收到的延迟请求分组 的要求延迟所述突发包， 若是， 则触发资源预约模块释放为所述突发包先前 预约的资源，重新为其预约资源，并重新生成相应的 BHP通过 BHP发送模块 发送给下游核心节点， 否则， 释放所述突发包先前预约的资源。
釆用上述第三种实现突发包延迟的方法后， 核心节点发现自身的出端口 在将来某一时刻将发生突发包冲突时， 能够向上游核心节点发送突发包延迟 请求， 请求上游配置有 FDL且具有延迟能力的核心节点帮其延迟突发包， 从 而充分利用了网络中配置的 FDL, 降低了突发包冲突的几率。 发明的精神和范围。 这样， 倘若本发明的这些修改和变型属于本发明权利要 求及其等同技术的范围之内， 则本发明也意图包含这些改动和变型在内。

Claims

权 利 要 求
1、 一种实现突发包延迟的方法， 其特征在于， 包括步骤：
当核心节点收到的突发头分组 BHP指示去往欲保护链路的突发包将在欲 保护链路上发生突发包交叠时， 所述核心节点确定需要被延迟的突发包， 为 其指定相应的延迟时长， 并为其预约相应的资源；
所述核心节点根据所述预约的资源生成相应的 BHP,并将生成的 BHP发 送给下游核心节点；
当所述核心节点收到需要延迟的突发包时， 通过调度相应的预约资源将 其发送给下游核心节点。
2、 如权利要求 1所述的方法， 其特征在于， 当所述核心节点收到的 BHP 指示欲保护链路上将发生突发包交叠时， 该核心节点判断所述突发包的交叠 度是否达到针对所述欲保护链路设置的交叠度门限， 若是， 则确定其中需要 延迟的突发包， 为其指定相应的延迟时长， 并为其预约相应的资源， 否则， 不对所述突发包进行延迟处理。
3、 如权利要求 2所述的方法， 其特征在于， 所述核心节点根据下述公式 为所述受保护链路设置所述交叠度门限；
1 Ν
式中， ^表示为核心节点 i设置的针对所述受保护链路的交叠度门限， 表 示穿过核心节点 i且穿过所述欲保护链路的路径数， M表示所述欲保护链路的 数据信道总数， N表示穿过所述核心节点且穿过所述欲保护链路的所有路径 数。
4、 如权利要求 2所述的方法， 其特征在于， 所述核心节点根据下述公式 为所述受保护链路设置所述交叠度门限；
∑Pk
k=l 式中， ^表示为核心节点 i设置的针对所述受保护链路的交叠度门限， M 表示所述欲保护链路的数据信道总数， Pl表示在窗口时间内穿过核心节点 i 且穿过所述欲保护链路的业务流量预测值， ! k表示在窗口时间内穿过所述 核心节点且穿过所述欲保护链路的总业务流量预测值。
5、 如权利要求 4所述的方法， 其特征在于， 所述核心节点 i在当前窗口 时间内对穿过核心节点 i且穿过所述欲保护链路的业务流量进行统计，将统计 值做为下一窗口时间内穿过核心节点 i 且穿过所述欲保护链路的业务流量预 测值。
6、 如权利要求 1至 5中任意一项所述的方法， 其特征在于， 所述核心节 点为配置了光纤延迟线 FDL的核心节点。
7、 一种核心节点， 其特征在于， 包括：
BHP接收模块， 用于接收 BHP;
延迟控制模块，当 BHP接收模块接收到的 BHP指示欲保护链路上将发生 突发包交叠时， 用于根据接收到的 BHP确定需要延迟的突发包， 为其指定相 应的延迟时长， 并为需要延迟的突发包预约相应的资源及生成相应的 BHP;
BHP发送模块， 用于将延迟控制模块生成的 BHP发送给下游核心节点。
8、 如权利要求 7所述的核心节点， 其特征在于， 当 BHP接收模块收到 的 BHP指示欲保护链路上将发生突发包交叠时， 所述延迟控制模块进一步判 断所述突发包的交叠度是否达到针对所述欲保护链路分配的交叠度门限， 若 是， 则根据接收到的 BHP确定需要延迟的突发包。
9、 一种实现突发包延迟的方法， 其特征在于， 包括步骤：
A、 当核心节点收到的 BHP指示其对应的突发包将在自身的出端口发生 冲突时， 该核心节点确定出需要延迟的突发包及相应的延迟时长；
B、 如果所述核心节点能够向上游核心节点发送延迟请求分组， 则根据所 述延迟时长向上游核心节点发送延迟请求分组；
C、接收到延迟请求分组的核心节点， 如果能够按照延迟请求分组的要求 延迟所述突发包， 则释放所述突发包先前预约的资源， 重新为其预约资源， 并重新生成相应的 BHP发送给下游核心节点。
10、 如权利要求 9所述的方法， 其特征在于， 所述方法进一步包括： 接收到延迟请求分组的核心节点， 如果无法按照延迟请求分组的要求延 迟所述突发包， 则释放所述突发包先前预约的资源， 并在能够向上游的核心 节点发送延迟请求分组时， 根据所述延迟时长向上游核心节点发送延迟请求 分组， 继续进行步骤 C。
11、 如权利要求 10所述的方法， 其特征在于， 所述延迟请求分组中携带 有偏移时间字段， 所述偏移时间字段为所述延迟请求分组到达相邻的上游核 心节点时与其对应的突发包之间的偏移时间。
12、如权利要求 11所述的方法，其特征在于，当前核心节点接收到的 BHP 或延迟请求分组中携带的偏移时间 T满足下述公式时， 当前核心节点能够向 上游核心节点发送延迟请求分组；
Figure imgf000015_0001
式中， T表示当前核心节点接收到的 BHP或延迟请求分组中携带的偏移 时间， L表示当前核心节点与其上游核心节点的距离， V表示延迟请求的发送 速率， tpro表示上游核心节点接收延迟请求， 重新为需要延迟的突发包预约资 源及生成相应的 BHP所需要的时间。
13、如权利要求 10所述的方法，其特征在于，所述步骤 C具体包括步骤： Cl、 接收到延迟请求分组的核心节点判断自身是否配置了 FDL, 若是， 执行步骤 C2, 否则， 执行步骤 C3;
C2、 所述核心节点判断自身能否按照延迟请求分组中延迟时长字段的要 求延迟所述突发包， 若是， 则释放所述突发包先前预约的资源， 重新为其预 约资源， 并重新生成相应的 BHP发送给下游核心节点， 否则， 执行步骤 C3 ;
C3、 所述核心节点释放所述突发包先前预约的资源， 并在确定能够向上 游的核心节点发送延迟请求分组时， 根据所述延迟时长向上游的核心节点发 送延迟请求分组， 继续进行步骤 Cl。
14、 一种核心节点， 其特征在于， 包括：
BHP接收模块， 用于接收 BHP;
突发包接收模块， 用于接收突发包；
延迟请求发送模块， 用于向上游核心节点发送延迟请求分组；
判断模块，当 BHP接收模块接收到的 BHP指示其对应的突发包将在出端 口发生冲突时， 用于判断是否有必要向上游核心节点发送延迟请求分组， 若 是， 则触发延迟请求发送模块向上游核心节点发送延迟请求分组， 否则， 控 制突发包接收模块接收到所述突发包时将其丟弃。
15、 一种核心节点， 其特征在于， 包括：
BHP发送模块， 用于发送 BHP;
延迟请求接收模块， 用于接收下游核心节点发出的延迟请求分组； 资源预约模块， 用于为突发包预约相应的资源；
判断模块， 用于判断能否按照延迟请求接收模块接收到的延迟请求分组 的要求延迟所述突发包， 若是， 则触发资源预约模块释放为所述突发包先前 预约的资源， 重新为其预约资源， 并重新生成相应的 BHP, 通过 BHP发送模 块发送给下游核心节点， 否则， 释放所述突发包先前预约的资源。
PCT/CN2007/003094 2007-01-26 2007-10-30 Procédé et nœud central pour réaliser un retard de paquet en rafale WO2008092325A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP07816707.9A EP2073456B1 (en) 2007-01-26 2007-10-30 Method and core node for realizing burst packet delay
ES07816707.9T ES2458143T3 (es) 2007-01-26 2007-10-30 Método y nodo central para realizar un retardo de paquete en ráfaga
US12/469,286 US8059535B2 (en) 2007-01-26 2009-05-20 Method and core router for delaying burst

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200710007501A CN101232438B (zh) 2007-01-26 2007-01-26 实现突发包延迟的方法及核心节点
CN200710007501.2 2007-01-26

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/469,286 Continuation US8059535B2 (en) 2007-01-26 2009-05-20 Method and core router for delaying burst

Publications (1)

Publication Number Publication Date
WO2008092325A1 true WO2008092325A1 (fr) 2008-08-07

Family

ID=39673640

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2007/003094 WO2008092325A1 (fr) 2007-01-26 2007-10-30 Procédé et nœud central pour réaliser un retard de paquet en rafale

Country Status (5)

Country Link
US (1) US8059535B2 (zh)
EP (1) EP2073456B1 (zh)
CN (1) CN101232438B (zh)
ES (1) ES2458143T3 (zh)
WO (1) WO2008092325A1 (zh)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102036255A (zh) * 2010-12-02 2011-04-27 电子科技大学 通信信道中基于预测的分组发送方法
TWI474740B (zh) * 2012-12-04 2015-02-21 Univ Nat Taiwan Science Tech 資料叢發排程方法
EP2978180A1 (en) * 2014-07-22 2016-01-27 Alcatel Lucent Signaling for transmission of coherent data flow within packet-switched network
CN111245725B (zh) * 2020-03-18 2021-09-03 常熟理工学院 一种基于分布式的未来网络实现方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040063461A1 (en) 2002-09-26 2004-04-01 Jikai Li Proactive burst contention avoidance scheduling algorithms for labelled optical burst switching networks
EP1439730A1 (en) 2002-12-23 2004-07-21 Alcatel Congestion control in an optical burst switched network
CN1601995A (zh) * 2003-09-25 2005-03-30 电子科技大学 一种多控制分组汇聚交换调度方法
CN1625150A (zh) * 2003-12-03 2005-06-08 电子科技大学 一种在光突发交换中支持实时业务的方法
CN1852617A (zh) * 2006-04-11 2006-10-25 蔡然 一种利用无线光通信加速光突发交换资源预约的网络技术

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020054732A1 (en) * 1999-11-02 2002-05-09 Zheng Si Q. Optical burst scheduling using partitioned channel groups
US6804255B1 (en) * 2000-10-12 2004-10-12 Alcatel Hardware implementation of channel scheduling algorithms for optical routers with FDL buffers
US20020118420A1 (en) * 2000-12-22 2002-08-29 Liu Heyun H. Method and apparatus for transmitting over a slotted OBS network in in-band mode
US20020118421A1 (en) * 2000-12-22 2002-08-29 Yijun Xiong Channel scheduling in optical routers
US7215666B1 (en) * 2001-11-13 2007-05-08 Nortel Networks Limited Data burst scheduling
US7257127B1 (en) * 2002-06-21 2007-08-14 Alcatel Lucent Method and apparatus for burst scheduling
US7254113B2 (en) * 2002-09-18 2007-08-07 Alcatel Lucent Partially preemptive burst scheduling model for an optical burst switching network
CN100428660C (zh) * 2004-01-14 2008-10-22 电子科技大学 一种具有内部加速的光突发交换节点

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040063461A1 (en) 2002-09-26 2004-04-01 Jikai Li Proactive burst contention avoidance scheduling algorithms for labelled optical burst switching networks
EP1439730A1 (en) 2002-12-23 2004-07-21 Alcatel Congestion control in an optical burst switched network
CN1516412A (zh) * 2002-12-23 2004-07-28 ���Ͽع����޹�˾ 光突发交换网络中的拥塞控制
CN1601995A (zh) * 2003-09-25 2005-03-30 电子科技大学 一种多控制分组汇聚交换调度方法
CN1625150A (zh) * 2003-12-03 2005-06-08 电子科技大学 一种在光突发交换中支持实时业务的方法
CN1852617A (zh) * 2006-04-11 2006-10-25 蔡然 一种利用无线光通信加速光突发交换资源预约的网络技术

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2073456A4

Also Published As

Publication number Publication date
CN101232438B (zh) 2012-10-03
ES2458143T3 (es) 2014-04-30
US20090245269A1 (en) 2009-10-01
EP2073456A1 (en) 2009-06-24
EP2073456A4 (en) 2009-11-18
CN101232438A (zh) 2008-07-30
US8059535B2 (en) 2011-11-15
EP2073456B1 (en) 2014-02-12

Similar Documents

Publication Publication Date Title
Alparslan et al. Next generation intra-vehicle backbone network architectures
Wang Using TCP congestion control to improve the performances of optical burst switched networks
US20140178066A1 (en) QoS-aware united control protocol for optical burst switching in software defined optical netoworks
Loi et al. Service differentiation in optical burst switched networks
Wang et al. Dynamic wavelength and bandwidth allocation algorithms for mitigating frame reordering in NG-EPON
WO2008092325A1 (fr) Procédé et nœud central pour réaliser un retard de paquet en rafale
Monowar et al. Multipath congestion control for heterogeneous traffic in wireless sensor network
CN101193056B (zh) 光突发交换设备中解决突发冲突的方法
JP2008294851A (ja) Ｐｏｎシステム
Turuk et al. A novel scheme to reduce burst-loss and provide QoS in optical burst switching networks
Garg Congestion prevention for reliable OBS
Chen et al. An architecture and a MAC protocol for throughput improvement in light trail networks
Zhou et al. Using constrained preemption to improve dropping fairness in optical burst switching networks
Nleya et al. QoS considerations in OBS switched backbone networks
Ueda et al. Intermediate-hop preemption to improve fairness in optical burst switching networks
Vinokurov et al. Resource sharing for QoS in agile all photonic networks
Lin et al. CORNet: an OBS metro ring network with QoS support and fairness control
Bengi An analytical model for a slotted WDM metro ring with a-posteriori access
Alparslan et al. A Zone-based Optical Architecture for Intra-Vehicle Backbone Networks
Hwang et al. Impact of burst control packet congestion on burst loss rate in optical burst switched networks
Pevac et al. Modelling and performance evaluation of optical burst switched node with deflection routing and dynamic wavelength allocation
JP5594688B2 (ja) Ｐｔｍｐ型ネットワークにおける通信システム
Park et al. Simultaneous burst and burst control packet transmission protocol for optical burst switching ring networks
Careglio et al. Preemption Window mechanism for efficient QoS support in E-OBS network architecture
Hsu et al. Providing end-to-end fairness in wireless mesh networks with chain topologies

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07816707

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2007816707

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: DE