CN102123330A - Method for avoiding active optical burst contention on basis of multi-node cooperation - Google Patents
Method for avoiding active optical burst contention on basis of multi-node cooperation Download PDFInfo
- Publication number
- CN102123330A CN102123330A CN2010102861986A CN201010286198A CN102123330A CN 102123330 A CN102123330 A CN 102123330A CN 2010102861986 A CN2010102861986 A CN 2010102861986A CN 201010286198 A CN201010286198 A CN 201010286198A CN 102123330 A CN102123330 A CN 102123330A
- Authority
- CN
- China
- Prior art keywords
- node
- burst
- contention
- competition
- explore frame
- 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.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for avoiding active optical burst contention on the basis of multi-node cooperation, which comprises the steps of: generating a detection frame from an edge node, receiving and processing the detection frame by a core node, and transmitting the information to an upstream node through a feedback frame so as to ensure that the upstream node actively regulates transmission paths of burst data packets with busy nodes as downstream nodes as early as possible to ensure that the burst data packets keep away from the busy nodes and avoid generating contention as far as possible. If the contention exists at some node, the contention is solved through methods of optical fiber delay line cache, wavelength transformation, deflection routing and the like, therefore, the purpose of avoiding and solving the multi-node cooperation contention is achieved. The method specially comprises the concrete links of: generating the detection frame at the edge node, receiving and processing the detection frame by the core node, changing the transmission paths and the like. The invention can effectively avoid the contention among DBs (Data Bases), reduce the burst loss rate, and can be used together with the traditional contention solving method based on single-node cooperation.
Description
Technical field
The present invention relates to communication technical field, the competition that is specifically related to happen suddenly in the light burst exchange network is avoided and solution.
Background technology
Light burst exchange network OBS (Optical Burst Switching) is a granularity with the light burst between wavelength and light grouping, not only combine the two advantage of light packet switching OPS (Optical Packet Switching) and light path exchange OCS (Optical Circuit Switching), and overcome the two deficiency, therefore become comparatively feasible light switching technology at present, be the focus of light switching technology research field in recent years, be expected to become the core switching technology that optical-fiber network of future generation is realized IP-over-WDM.
The basic principle of OBS technology is: a light burst is by data burst DB (Data Burst) and burst control bag BCP (Burst Control Packet), and data burst (DB data burst) transmits in different channels with burst control bag (BCP burst control packet).BCP transmits prior to DB, is the DB reserved resource on the way.Owing to adopt unidirectional resource reservation mechanism among the OBS, fringe node just sends DB to core node under the situation that does not obtain reservation confirmation, therefore at the core node place, when a plurality of DB arrive same output port simultaneously, perhaps arrive and another DB when also not finishing transmission as DB, light burst competition will occur, and cause DB Loss Rate and network blocking probability to rise, cause network performance to descend.
In the OBS network, how to reduce the data loss rate that causes because of light burst competition, become a major issue of needing solution badly.At present, light burst competition solution or avoiding method are mainly taked following several thinking in the OBS network:
(1) obviate manages to reduce the competition generation: with offset time technology is set, promptly makes the offset time randomization between BCP and the DB at the network edge node place;
(2) after competition takes place, manage to avoid or reduce to abandon competition failure DB: adopt fiber delay line cache (time domain solution), wavelength conversion (wavelength domain solution) or penetrate route (spatial domain solution) etc. partially, or adopt composite type burst packets (OCBS:Composite Burst Switching Segment), burst packets segmentation (BS:Burst Segment) etc.
Yet the shortcoming of said method thinking is: they are only carried out on individual node, only attempt to utilize the local resource of individual node to solve the burst competition.And in the OBS network, the available resources skewness at each node place, therefore may occur: certain node place can't solve the burst competition that this node place takes place because of available resources are not enough, and there are a large amount of slack resources at other node places, but powerless to the solution of this burst competition.On the contrary, if a plurality of node cooperations compile unified the utilization with their available resources, then can obtain to solve preferably effect.
Summary of the invention
Problem to be solved by this invention is: how to utilize multi-node collaboration to avoid light burst competition on one's own initiative.The inventive method has overcome the defective that has single node in the prior art, from the multi-node collaboration angle, has proposed a kind of active light burst competition avoiding method, to reduce the competition between the DB as much as possible, reduces loss burst rate.
Technical problem proposed by the invention is to solve like this: a kind of active light burst competition avoiding method based on multi-node collaboration is provided, it is characterized in that, may further comprise the steps:
1. fringe node produces explore frame
The explore frame of fringe node (PF:Probe Frame) maker, generate explore frame according to corresponding burst packet (DB:Data Burst) information and burst control bag (BCP:Burst Control Packet) information, and prior to burst control bag and burst packet transmission, by special-purpose sounding channel (PC:Probe Channel) transmission, being responsible for surveying and collecting burst packet will be through utilization of resources situations such as node and links;
2. core node receives and handles explore frame
The probe unit of core node (PU:Probe Unit) is responsible for receiving and handling explore frame according to present node utilization of resources situation: if the present node load is lower, then it is changed to " free time " state, explore frame continues to mail to downstream node; If the present node load is higher, then it is changed to " busy " state, and gives birth to feedback frame (FF:Feedback Frame), (FC:Feedback Channel) is sent to upstream node by feedback channel;
3. change the bursty data packet transmission path
After upstream node was received the feedback frame information, adjusting those on one's own initiative was the transmission path of the burst packet of downstream node with " busy " node, makes it to avoid these " busy " nodes, to reach the purpose that competition is avoided;
4. solve and compete
If bursty data wraps in a certain node and competes, then adopt fiber delay line cache, wavelength conversion, penetrate method such as route partially and solve, reduce the loss of data that causes because of competition as far as possible.
The present invention proposes the light burst competition of multi-node collaboration in the OBS network and avoids and solution, and this method has solved defective of the prior art: they are only carried out on individual node, only attempts to utilize the local resource of individual node to solve the burst competition.And in the OBS network, the available resources skewness at each node place, therefore may occur: certain node place can't solve the burst competition that this node place takes place because of available resources are not enough, and there are a large amount of slack resources at other node places, but powerless to the solution of this burst competition.Basic ideas of the present invention are to know that by explore frame and feedback frame information DB will pass through utilization of resources situations such as routing node and link, avoid DB is sent to the high node of load as far as possible and compete and cause loss of data; If compete at certain node, then by fiber delay line cache, wavelength conversion, penetrate method such as route partially and solve, thereby reach the purpose that the multi-node collaboration competition is avoided and solved.
Description of drawings
Fig. 1 has the OBS networking fringe node structure chart of explore frame systematic function;
Fig. 2 has the OBS network core node structure figure of probe unit;
Fig. 3 is based on the active light burst competition avoiding method schematic diagram of multi-node collaboration.
Embodiment
Below in conjunction with accompanying drawing the present invention is further described:
For the course of work of the present invention can be described better, its specific implementation process is elaborated below in conjunction with accompanying drawing.
Fig. 1 is a kind of OBS network edge node structure chart with priority sequence queuing and explore frame systematic function.At first, according to user's QoS (Quality of Service) requirement,, and be buffered in the buffer queue of different priorities electricity territory its business datum classification.Then, converge burst packet DB according to binding time thresholding, the modes such as converging length threshold that happens suddenly into different priorities.Simultaneously, burst control bag BCP maker generates BCP according to the information such as priority, destination address and COS of DB; Explore frame PF maker also generates PF according to these information.PF passes through independently sounding channel PC transmission prior to BCP and DB, will be through the utilization of resources situation of downstream node and link to survey and to collect DB as soon as possible.
Fig. 2 is a kind of core node structure chart with probe unit and corresponding function channel.Wherein probe unit is responsible for receiving the explore frame of arrival, and make following processing: if this moment, this node load was lighter according to situations such as the available resources of this node and load sizes, and have available outlet channel to transmit the DB of this PF correspondence, then PF is continued to mail to downstream node; If this node load was heavier when PF arrived, then produce feedback information and pass to upstream node by feedback channel FC, make upstream node know this node and be in " busy " state.
Concrete handling process such as Fig. 3 can be divided into following link:
(1) fringe node generates explore frame
Suppose certain one DB of fringe node EN1 (Edge Node) generation constantly, need to transmit arrival purpose fringe node EN2 via core node CN1 (Core Node), CN2, CN3 and CN4.The explore frame maker of EN1 generates explore frame PF according to relevant informations such as DB destination address and COS.PF transmits by sounding channel prior to BCP and DB, passes through node CN1, CN2, CN3 and CN4 on the DB transmission path successively.
(2) core node receives and handles explore frame
Each core node receives and handles PF according to situations such as the available resources of this node and load sizes: when PF arrives CN1 and CN2, two node loads are all lighter, and there is available outlet channel to transmit the DB that is about to arrival, then allow PF pellucidly by these two nodes, and not to the upstream node feedback information; On the contrary, when this PF arrives CN3, the CN3 load is heavier, be in " busy " state, and do not have available outlet channel and transmit the DB that is about to arrival, then the probe unit by CN3 generates feedback frame FF, and passes to upstream node CN2 and CN1 (being passed to the node before BCP arrives) by feedback channel FC, thereby make upstream node know the resource situation and the busy idle condition of downstream node as soon as possible, and carry out next link;
(3) change the DB transmission path
After upstream node CN1 receives the feedback frame, for the DB of PF correspondence recomputates transmission path from present node to the DB destination node on one's own initiative, make this DB can penetrate route in advance partially and handle, avoid this DB competition to take place and produce packet loss, initiatively avoid competing interests thereby reach because of entering CN3.
(4) solution is competed
If bursty data wraps in a certain node and competes, then adopt fiber delay line cache, wavelength conversion, penetrate method such as route partially and solve, reduce the loss of data that causes because of competition as far as possible.
By above-mentioned multi-node collaboration method, can initiatively avoid DB to cause high packet loss effectively because of competition.Simultaneously, realize the node link resource coordination utilization in the network-wide basis to a certain extent, reach the purpose of the whole network load balance.
In order further to improve guarantees such as user QoS and real-time service, said method also can use in conjunction with burst service priority, be that low priority DB meets " do " transmission of then detouring: preferentially transmit high priority DB, guarantee that as far as possible high priority DB passes through the predetermined optimum path and transmits.When traffic carrying capacity is big, know according to the explore frame feedback message to allow the information of relevant downstream node " busy " low priority DB penetrate route in advance partially and to handle at the upstream node of the heavier node of load.So can guarantee requirements such as the QoS of high priority DB and time delay, and can reduce the packet loss of low priority DB effectively.
The present invention knows that by the explore frame feedback information DB will avoid DB to cause losing because of entering the higher node generation competition of load through the utilization of resources situation of routing node and link, reaches with this and initiatively avoids competing interests.In the OBS network, can increase a small amount of configuration (as: explore frame maker, controlled processing unit, feedback dedicated channel, detection dedicated channel etc.) to node, just can realize this method the set goal, so this method have better operability and extensibility.
Claims (1)
1. the active light burst competition avoiding method based on multi-node collaboration is characterized in that, may further comprise the steps:
1. fringe node produces explore frame
The explore frame maker of fringe node generates explore frame according to corresponding bursty data package informatin and burst control package informatin, and prior to burst control bag and burst packet transmission, by special-purpose sounding channel transmission, be responsible for surveying burst packet and will utilize situation through node and link circuit resource;
2. core node receives and handles explore frame
The probe unit of core node is responsible for receiving and handling explore frame according to present node utilization of resources situation: if the present node load is lower, then it is changed to " free time " state, explore frame continues to mail to downstream node; If the present node load is higher, then it is changed to " busy " state, and produces the feedback frame, be sent to upstream node by feedback channel;
3. change the bursty data packet transmission path
After upstream node was received the feedback frame information, adjusting those on one's own initiative was the transmission path of the burst packet of downstream node with " busy " node, makes it to avoid these " busy " nodes, avoids as much as possible competing;
4. solve and compete
If bursty data wraps in a certain node and competes, then adopt fiber delay line cache, wavelength conversion, penetrate the method for routing solution partially, reduce the loss of data that causes because of competition as far as possible.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102861986A CN102123330A (en) | 2010-09-19 | 2010-09-19 | Method for avoiding active optical burst contention on basis of multi-node cooperation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102861986A CN102123330A (en) | 2010-09-19 | 2010-09-19 | Method for avoiding active optical burst contention on basis of multi-node cooperation |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102123330A true CN102123330A (en) | 2011-07-13 |
Family
ID=44251748
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102861986A Pending CN102123330A (en) | 2010-09-19 | 2010-09-19 | Method for avoiding active optical burst contention on basis of multi-node cooperation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102123330A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104219591A (en) * | 2013-05-30 | 2014-12-17 | 华为技术有限公司 | Data packet switching method and device |
| CN104468414A (en) * | 2014-12-11 | 2015-03-25 | 天津大学 | Method for improving effective availability of links in optical burst switch network |
| CN105207947A (en) * | 2015-08-28 | 2015-12-30 | 网宿科技股份有限公司 | rogressive flow scheduling method and system capable of filtering vibration |
| WO2022227568A1 (en) * | 2021-04-26 | 2022-11-03 | 华为技术有限公司 | Data transmission method, network node, optical system, and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101052000A (en) * | 2007-05-16 | 2007-10-10 | 中国电子科技集团公司第五十四研究所 | Method for realizing separate service in light burst exchange network |
| US20080285975A1 (en) * | 2007-05-14 | 2008-11-20 | Research And Industrial Cooperation Group | Burst scheduling methods in Optical Burst Switching system |
| CN101370314A (en) * | 2008-10-10 | 2009-02-18 | 江苏大学 | Resource reservation method based on intra-domain network state perception in optical burst exchange |
-
2010
- 2010-09-19 CN CN2010102861986A patent/CN102123330A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080285975A1 (en) * | 2007-05-14 | 2008-11-20 | Research And Industrial Cooperation Group | Burst scheduling methods in Optical Burst Switching system |
| CN101052000A (en) * | 2007-05-16 | 2007-10-10 | 中国电子科技集团公司第五十四研究所 | Method for realizing separate service in light burst exchange network |
| CN101370314A (en) * | 2008-10-10 | 2009-02-18 | 江苏大学 | Resource reservation method based on intra-domain network state perception in optical burst exchange |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104219591A (en) * | 2013-05-30 | 2014-12-17 | 华为技术有限公司 | Data packet switching method and device |
| CN104219591B (en) * | 2013-05-30 | 2017-12-01 | 华为技术有限公司 | A kind of packet-switching method and device |
| CN104468414A (en) * | 2014-12-11 | 2015-03-25 | 天津大学 | Method for improving effective availability of links in optical burst switch network |
| CN105207947A (en) * | 2015-08-28 | 2015-12-30 | 网宿科技股份有限公司 | rogressive flow scheduling method and system capable of filtering vibration |
| CN105207947B (en) * | 2015-08-28 | 2018-12-04 | 网宿科技股份有限公司 | A kind of gradual traffic scheduling method and system of filtering shake |
| WO2022227568A1 (en) * | 2021-04-26 | 2022-11-03 | 华为技术有限公司 | Data transmission method, network node, optical system, and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100574280C (en) | The implementation method of differentiated service in the light burst exchange network | |
| CN101958847A (en) | Selection method of distributed QOS (Quality of Service) routes | |
| Zhang et al. | Slotted optical burst switching (SOBS) networks | |
| CN102123330A (en) | Method for avoiding active optical burst contention on basis of multi-node cooperation | |
| Lamba et al. | Survey on contention resolution techniques for optical burst switching networks | |
| CN110247859B (en) | Data sending method and device based on AIRT-ROS node | |
| Ahmed et al. | A new bandwidth allocation algorithm for EPON-WiMAX hybrid access networks | |
| CN101426152B (en) | Data transmission method for integrated mixed optical network based on burst exchange | |
| Dashti et al. | Evaluation of dynamic bandwidth allocation with clustered routing in FiWi networks | |
| Klymash et al. | Performance Analysis of Smart Optical Burst Switching Networks for Different Signaling Protocols | |
| JP5475852B1 (en) | Optical packet transfer method and transfer device in optical packet switch network | |
| Bouabdallah | Sub-Wavelength Solutions for Next-Generation Optical Networks [Topics in Optical Communications] | |
| Imran et al. | Performance evaluation of hybrid optical switching with quality of service | |
| Angelopoulos et al. | Slotted optical switching with pipelined two-way reservations | |
| Garcia et al. | A new architecture for optical burst switched networks based on a common control channel | |
| CN103428587A (en) | Optical burst add drop multiplexer | |
| Li et al. | Novel resource reservation schemes for optical burst switching | |
| Christodoulopoulos et al. | Relaxing delayed reservations: An approach for quality of service differentiation in optical burst switching networks | |
| Tasneem et al. | Improving QoS of Peer to Peer Multimedia Services by Employing Multiple Upstream Wavelengths in EPON | |
| Cuda et al. | Getting routers out of the core: Building an optical wide area network with" multipaths" | |
| Wankhade et al. | An evolutionary approach for LAUC scheduler in optical burst switching networks | |
| Alahmadi et al. | Optimization of Processing Allocation in Vehicular Edge Cloud based Architecture | |
| Wong et al. | An optical hybrid switch with circuit queueing for burst clearing | |
| Kirci et al. | Comparison of OBS protocols | |
| Diaz | Energy saving solutions for integrated optical-wireless access networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20110713 |