CN1588827A - Self adaptive channel reservation and searching method in light burst exchange - Google Patents
Self adaptive channel reservation and searching method in light burst exchange Download PDFInfo
- Publication number
- CN1588827A CN1588827A CNA2004100536617A CN200410053661A CN1588827A CN 1588827 A CN1588827 A CN 1588827A CN A2004100536617 A CNA2004100536617 A CN A2004100536617A CN 200410053661 A CN200410053661 A CN 200410053661A CN 1588827 A CN1588827 A CN 1588827A
- Authority
- CN
- China
- Prior art keywords
- channel
- maximum
- grade
- burst
- search
- 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.)
- Granted
Links
Abstract
An adaptive channel preservation and search method in light burst exchange applies a separated process principle to preserve and search channels adaptively based on different service classes, input flow properties, network performances and channel allocation of the output port. Different class services have different maximum preserved channel numbers, only when the preserved channel number at a class is less than the maximum number possible to be preserved, they are the burst data packet preserved channels of that class services of difference classes have different maximum channel search numbers in a time slot, the number of a grade should not supass its maximum channel search number.
Description
Technical field
The present invention relates to the channel scheduling method in a kind of smooth burst-switched (OBS) network, the adaptive channel that is specifically related in a kind of smooth burst-switched is reserved and searching method, belongs to technical field of optical fiber communication.
Background technology
Under the double stimuli of data service and wavelength division multiplexing optical communication techniques such as (WDM) development, conventional optical network just towards towards the high flexible of IP operation, highly reliably and optical-fiber network direction of new generation cheaply develop.In the switching technology scheme of the realization IP over WDM that proposes, the light burst-switched is a kind of comparatively desirable light exchanged form at present.Its characteristics are separated on transmission channel and time for control grouping and packet.The control grouping transmits in special dense wave division multipurpose channel prior to packet, and reserves full light path at the intermediate node of process for corresponding packet.Packet through one section delay after, direct transparent transmission in the full optical channel that sets in advance.The delay stand-by period that the unidirectional reservation schemes that does not need to confirm has reduced to set up passage, improved bandwidth availability ratio; Medium-grained packet has reduced the expense of control grouping, has improved utilance.The separating of packet and control grouping, suitable particle and non-time gas exchange mode can reduce the requirement of photonic device and the complexity of middle switching node, and can give full play to the speciality of existing photon technology and electronic technology.
Channel reservation and search are one of key problems in the light burst exchange network.But what proposed recently scheduling channel (LAUC) and band filling at present can use two kinds of methods of channel (LAUC-VF) recently.The paper of Yi jun Xiong etc. " control structure of light burst-switched wavelength division multiplexed network (IEEE Journal on SelectedAreas in Communication; Vol.18; No.10, pp.1838-1851,2000) " is than having set forth LAUC and LAUC-VF algorithm in more detail.LAUC is a kind of better simply dispatching algorithm that does not have filling, be easy to realize, but bandwidth availability ratio is low.The LAUC-VF algorithm minimizes the gap between packet by the channel of selecting nearest " not using ", has improved bandwidth availability ratio, but more complicated.When adopting LAUC or LAUC-VF algorithm, large-scope change between the different brackets long data packet will cause the unjustness of channel allocation, increase the time delay of the business of high delay requirement, thereby cause the packet loss of business of high delay requirement and the deterioration of delivery channel utilance.
Summary of the invention
The objective of the invention is at the deficiencies in the prior art, provide the adaptive channel in a kind of smooth burst-switched to reserve and searching method, improve the channel allocation that the large-scope change between the different brackets long data packet causes unjustness, improve the performance of network.
For realizing such purpose, adaptive channel reservation and searching method that the present invention proposes, adopt the differentiating and processing principle, carry out channel reservation and search adaptively according to the channel configuration of grade, input flow rate characteristic, network performance and the output port of different business.But the business of different brackets has the channel reservation number of different maximums.When having only the number of channel reserved when the business of certain grade less than its maximum channel number that can reserve, channel reservation and search procedure could be the bursty data packet reservation channel of this grade.The business of different brackets has the number of times of different maximum channel search in a time slot.The channel search number of times of the business of certain grade in a time slot can not surpass the maximum channel searching times of this grade.But the maximum channel reservation number of different brackets and maximum channel searching times are according to the change dynamics adjustment of the channel configuration of the grade of service, input flow rate characteristic, network performance and output port.
The concrete steps of the inventive method are as follows:
1, but the maximum channel reservation number of the business of all grades is set to the maximum data number of channel of output port, but the maximum searching times of the business of all grades is made as 1.Initialization input flow rate and performance monitoring parameter, but and start the channel reservation number and searching times is adjusted timer, enter an adjustment cycle.
2, in an adjustment cycle, monitor and add up in this adjustment cycle the characteristic of the input flow rate of the business of different brackets in the network running in real time in the input port place, comprise load and flow distribution etc.Simultaneously, but but be that burst packets to be sent is reserved and search channel by grade order from high to low according to the maximum channel reservation number of current different brackets business and maximum searching times.
If the stand-by period of burst packets has surpassed its maximum wait time delay, then abandon this burst packets, add up the number of dropped packets of this grade, otherwise, but whether the number of channel that the grade of differentiating this packet correspondence has again been reserved has surpassed its current maximum channel reservation number, if then postpone this burst packets, handle next grade, and the burst packets that is delayed after discharging a channel, is handled in the bursty data grouping of an ad eundem again; , then enter channel search procedure if but the number of channel of having reserved does not surpass its current maximum channel reservation number.
3, in channel search procedure, searching times is initialized as zero earlier.Determine the transmission zero hour of burst control bag and burst packet.Then, by change burst packets send the zero hour and/or shift time (offset time) repeatedly search channel (change once, again search is once), reach the zero hour of current maximum channel searching times of this grade or burst packets transmission greater than maximum delay until searching available channel or channel search number of times.Wherein, if search available channel, then select an available channel to keep for this packet with the LAUC-VF algorithm, the number of channel that this grade has been reserved adds 1, adds up this grade delay character; If then abandon this grouping greater than maximum delay the zero hour that burst packets sends, increase the number of dropped packets of this grade; If the channel search number of times has reached this grade at the maximum channel searching times of this dispatching cycle, then this grouping is left to burst packets and waits until next time and handle.
But 4, when channel reservation number and the arrival of searching times adjustment timer:
Earlier according to monitoring result to input flow rate and network performance parameter, long and the average arrival interval of the average packet of the load of the input flow rate of different brackets business, burst packets in this cycle of calculating, and packet loss and time delay, adopt exponential smoothing to add the variance estimation technique, predict the different brackets input rate of following one-period.
But but press the maximum channel reservation number and the maximum searching times of the business of grade sequential update different brackets from high to low again.
If the packet loss of certain grade is lower than its maximum and allows packet loss, but but the ratio (round) of variation that then new maximum channel reservation number is original maximum channel reservation number adds its input rate (increase or reduce) and single delivery channel speed.But its maximum searching times is constant.
Otherwise, but whether the maximum searching times of differentiating this grade does not again cause this grade data package to surpass maximum delay, but be the maximum searching times that then increases this grade.Otherwise but the maximum channel reservation number of the business of this grade adds 1, simultaneously, actual packet loss that calculates each grade and maximum ratio of allowing packet loss multiply each other each ratio and number of degrees and round, find out the wherein pairing grade of minimum value, but the maximum channel reservation number of this grade is subtracted 1.If the input rate of the prediction of this grade increases, but then further its maximum channel reservation number is added the value of rounding up of the ratio of the recruitment of its input rate and single delivery channel speed, otherwise do not adjust.
Finish after the adjustment, but restart channel reservation number and searching times adjustment timer, enter a new adjustment cycle.
The present invention adopts the principle of differentiating and processing, and, can significantly improve the unjustness of the channel allocation that the large-scope change between the different brackets long data packet causes in the light burst-switched, the performance that improves network and the utilance of bandwidth resources according to the actual input of network, the adjustment reservation of operational effect self adaptation and search parameter.
Description of drawings
Channel reservation and search procedure in the single cycle of Fig. 1.
Fig. 2 is the channel search procedure schematic diagram repeatedly.
Embodiment
The scheduler module that adaptive channel reservation that the present invention proposes and searching method can be used for light burst-switched fringe node and core node.Illustrate that below in conjunction with accompanying drawing adaptive channel that the present invention proposes is reserved and the concrete implementation step of searching method:
1, initialization, but the maximum channel reservation number of all grade business is set to the maximum data number of channel of output port, but the maximum searching times of all grade business is made as 1.While initialization input flow rate and performance monitoring parameter; But start channel reservation number and searching times and adjust timer.
2, in an adjustment cycle, monitor in this adjustment cycle the load of the input flow rate of the business of different brackets and flux distribution characteristics in the network running in real time in the input port place.Simultaneously, but but be that burst packets to be sent is reserved and search channel by grade order from high to low according to the maximum channel reservation number and the maximum searching times of different brackets business in this cycle.
Channel reservation and search procedure are as shown in Figure 1 in the single cycle.At first, by grade of service selective sequential from high to low grade to be processed,, then handle next grade if there is not burst packets to be processed in certain grade.In institute's grade to be processed, surpassed its maximum wait time delay if handle the stand-by period of burst packets, then abandon this burst packets, add up the number of dropped packets of this grade; Otherwise, but whether the number of channel that the grade of differentiating this packet correspondence has again been reserved has surpassed its current maximum channel reservation number, if then postpone this burst packets, handle next grade, and the burst packets that is delayed after discharging a channel, is handled in the bursty data grouping of an ad eundem again., then enter channel search procedure if but the number of channel of having reserved does not surpass its current maximum channel reservation number.
3, in channel search procedure, searching times is initialized as zero earlier.Determine transmitting control channel of burst control bag and send the zero hour with the LAUC algorithm.Burst packet sends the transmission be set to the burst control bag zero hour and adds shift time the zero hour.Then, the available data channel of search.If search for successfully, find available data channel, then select an available channel to keep for this packet with the LAUC-VF algorithm, the number of channel that this grade has been reserved adds 1, adds up this grade delay character, finishes search.If available data channel is not found in search, then the channel search number of times adds 1.If the searching times of burst packets greater than the maximum search number of times of this grade business, finishes search, burst packets is waited until next time and is handled.Otherwise, select next new available burst control bag transmitting channel (promptly change burst packets and send the zero hour) backward or keep the constant increase shift time of burst control bag delivery time, and determine that thus new burst packet sends the zero hour.If greater than maximum delay, finish search the zero hour that burst packet sends, abandon this burst packets, add up the number of dropped packets of this grade; Otherwise, search for the zero hour with new burst packets transmission next time.
Accompanying drawing 2 sends the process schematic diagram that carries out repeatedly channel search the zero hour for keeping shift time constant by changing burst packets.The corresponding search for the first time of two dotted lines on the right among the figure.This moment, all data channels did not all have available channel.Therefore move after the transmitting time with burst control grouping and packet, and carry out the search second time, the corresponding search for the second time of solid line.As seen for the second time on channel 1, available channel is arranged.Leftmost dotted line contains the maximum delay of being permitted for this among the figure.
But 4, when channel reservation number and the arrival of searching times adjustment timer, according to monitoring result to input flow rate and network performance parameter, calculate the load of the input flow rate of different brackets business, the long and average arrival interval of average packet of burst packets, and packet loss and time delay; Adopt exponential smoothing to add the variance estimation technique, add up the input load of the different brackets that obtains by the front and predict the different brackets input rate of following one-period.Then, but but by the maximum channel reservation number and the maximum searching times of the business of grade sequential update different brackets from high to low.
If the packet loss of certain grade is lower than its maximum and allows packet loss, then:
This grade following one-period but maximum channel reservation number=maximum of one-period can be pre-on it
Stay the number of channel+[speed+a of the variable quantity of its input rate/single delivery channel].
Wherein, [
] represent to round, 0≤a≤0.5 can be selected according to actual optimization.But its maximum searching times is constant.
If the packet loss of certain grade is allowed packet loss more than or equal to its maximum, but whether the maximum searching times of then differentiating this grade does not again cause this grade data package to surpass maximum delay, if, but then increase the maximum searching times of this grade.Otherwise, but the maximum channel reservation number of the business of this grade adds 1, simultaneously, calculate the actual packet loss and maximum ratio of allowing packet loss of each grade, each ratio and number of degrees are multiplied each other and round, find out the wherein pairing grade of minimum value, but the maximum channel reservation number of this grade is subtracted 1.
If the packet loss of certain grade is allowed packet loss more than or equal to its maximum, the input rate of the prediction of this grade increases simultaneously, then:
But but this grade is at maximum channel reservation number=adjusted maximum channel reservation of following one-period
Number+[speed+a of the variable quantity of its input rate/single delivery channel].
Wherein, 0.5≤a≤1.If the input rate of the prediction of this grade does not increase or reduces, then do not adjust.
Finish after the adjustment, but restart channel reservation number and searching times adjustment timer, enter a new adjustment cycle.
Claims (1)
1, the adaptive channel in a kind of smooth burst-switched is reserved and searching method, it is characterized in that specifically comprising the steps:
1) but the maximum channel reservation number of the business of all grades is set to the maximum data number of channel of output port, but the maximum searching times of the business of all grades is made as 1, initialization input flow rate and performance monitoring parameter, and start the channel reservation number and but searching times is adjusted timer, enter an adjustment cycle;
2) in an adjustment cycle, monitor and add up in this adjustment cycle the characteristic of the input flow rate of the business of different brackets in the network running in real time in the input port place; Simultaneously, but but be that burst packets to be sent is reserved and search channel by grade order from high to low according to the maximum channel reservation number of current different brackets business and maximum searching times, if the stand-by period of burst packets has surpassed its maximum wait time delay, then abandon this burst packets, increase the number of dropped packets of this grade; Otherwise, but whether the number of channel that the grade of differentiating this packet correspondence has again been reserved has surpassed its current maximum channel reservation number, if, then postpone this burst packets, handle next grade, and the burst packets that is delayed is handled after the bursty data grouping of an ad eundem discharges a channel again, otherwise enters channel search procedure;
3) in channel search procedure, searching times is initialized as zero earlier, determine the transmission zero hour of burst control bag and burst packet, then by changing repeatedly search channel of the burst packets transmission zero hour and/or shift time, reach the zero hour of current maximum channel searching times of this grade or burst packets transmission greater than maximum delay until searching available channel or channel search number of times, wherein, if search available channel, then select an available channel to keep for this packet, the number of channel that this grade has been reserved adds 1, adds up this grade delay character; If then abandon this grouping greater than maximum delay the zero hour that burst packets sends, increase the number of dropped packets of this grade; If the channel search number of times has reached this grade at the maximum channel searching times of this dispatching cycle, then this grouping is left to burst packets and waits until next time and handle;
4) but when channel reservation number and searching times are adjusted timer and are arrived, according to monitoring result to input flow rate and network performance parameter, long and the average arrival interval of the average packet of the load of the input flow rate of different brackets business, burst packets in this cycle of calculating, and packet loss and time delay, adopt exponential smoothing to add the variance estimation technique, predict the different brackets input rate of following one-period; But but press the maximum channel reservation number and the maximum searching times of the business of grade sequential update different brackets from high to low, if the packet loss of certain grade is lower than its maximum and allows packet loss, add the round value of the ratio of the variation of its input rate and single delivery channel speed but but then new maximum channel reservation number is original maximum channel reservation number, but its maximum searching times is constant; Otherwise, but whether the maximum searching times of differentiating this grade does not again cause this grade data package to surpass maximum delay, but be the maximum searching times that then increases this grade, otherwise but the maximum channel reservation number of the business of this grade adds 1, simultaneously, calculate the actual packet loss and maximum ratio of allowing packet loss of each grade, each ratio and number of degrees are multiplied each other and round, find out the wherein pairing grade of minimum value, but the maximum channel reservation number of this grade is subtracted 1, if the input rate of the prediction of this grade increases, then further but its maximum channel reservation number is added the value of rounding up of the ratio of the recruitment of its input rate and single delivery channel speed, otherwise do not adjust; After finishing adjustment, but restart channel reservation number and searching times adjustment timer, enter a new adjustment cycle.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100536617A CN1271803C (en) | 2004-08-12 | 2004-08-12 | Self adaptive channel reservation and searching method in light burst exchange |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100536617A CN1271803C (en) | 2004-08-12 | 2004-08-12 | Self adaptive channel reservation and searching method in light burst exchange |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1588827A true CN1588827A (en) | 2005-03-02 |
| CN1271803C CN1271803C (en) | 2006-08-23 |
Family
ID=34602952
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100536617A Expired - Fee Related CN1271803C (en) | 2004-08-12 | 2004-08-12 | Self adaptive channel reservation and searching method in light burst exchange |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1271803C (en) |
Cited By (28)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100536427C (en) * | 2005-10-25 | 2009-09-02 | 北京大学 | Method for self similar cluster packet of large file service light transmission |
| CN1794880B (en) * | 2005-12-21 | 2010-05-05 | 中国科学院计算技术研究所 | Parallel dispatching processing method in optical burst switched network |
| CN101155085B (en) * | 2006-09-29 | 2011-05-11 | 中兴通讯股份有限公司 | Method and device for real-time flux prediction and real-time flux monitoring and early warning |
| CN101355491B (en) * | 2007-07-24 | 2012-03-21 | 华为技术有限公司 | Method for transmitting data and network element equipment |
| CN101292475B (en) * | 2005-10-21 | 2012-05-02 | 国际商业机器公司 | Adaptive bandwidth control method and device |
| US8213309B2 (en) | 2008-12-22 | 2012-07-03 | Broadcom Corporation | Systems and methods for reducing latency and reservation request overhead in a communications network |
| CN102761484A (en) * | 2012-06-29 | 2012-10-31 | 重庆邮电大学 | Data channel arrangement method in optical burst switching |
| CN101754054B (en) * | 2008-12-01 | 2012-12-19 | 华为技术有限公司 | Method, device and system for treating business transmission |
| US8345553B2 (en) | 2007-05-31 | 2013-01-01 | Broadcom Corporation | Apparatus and methods for reduction of transmission delay in a communication network |
| US8358663B2 (en) | 2006-11-20 | 2013-01-22 | Broadcom Corporation | System and method for retransmitting packets over a network of communication channels |
| US8514860B2 (en) | 2010-02-23 | 2013-08-20 | Broadcom Corporation | Systems and methods for implementing a high throughput mode for a MoCA device |
| US8526429B2 (en) | 2006-11-20 | 2013-09-03 | Broadcom Corporation | MAC to PHY interface apparatus and methods for transmission of packets through a communications network |
| US8537925B2 (en) | 2006-11-20 | 2013-09-17 | Broadcom Corporation | Apparatus and methods for compensating for signal imbalance in a receiver |
| US8553547B2 (en) | 2009-03-30 | 2013-10-08 | Broadcom Corporation | Systems and methods for retransmitting packets over a network of communication channels |
| US8611327B2 (en) | 2010-02-22 | 2013-12-17 | Broadcom Corporation | Method and apparatus for policing a QoS flow in a MoCA 2.0 network |
| US8724485B2 (en) | 2000-08-30 | 2014-05-13 | Broadcom Corporation | Home network system and method |
| US8730798B2 (en) | 2009-05-05 | 2014-05-20 | Broadcom Corporation | Transmitter channel throughput in an information network |
| US8755289B2 (en) | 2000-08-30 | 2014-06-17 | Broadcom Corporation | Home network system and method |
| US8761200B2 (en) | 2000-08-30 | 2014-06-24 | Broadcom Corporation | Home network system and method |
| US8867355B2 (en) | 2009-07-14 | 2014-10-21 | Broadcom Corporation | MoCA multicast handling |
| WO2014183724A1 (en) * | 2013-07-26 | 2014-11-20 | 中兴通讯股份有限公司 | Optical burst ring network bandwidth allocation method and device |
| US8942250B2 (en) | 2009-10-07 | 2015-01-27 | Broadcom Corporation | Systems and methods for providing service (“SRV”) node selection |
| US9112717B2 (en) | 2008-07-31 | 2015-08-18 | Broadcom Corporation | Systems and methods for providing a MoCA power management strategy |
| US9531619B2 (en) | 2009-04-07 | 2016-12-27 | Broadcom Corporation | Channel assessment in an information network |
| CN107733815A (en) * | 2017-11-06 | 2018-02-23 | 郑州轻工业学院 | Time slot light burst exchange network method for obligating resource based on quasi- power matrix |
| CN109451560A (en) * | 2019-01-08 | 2019-03-08 | 苏州简约纳电子有限公司 | A kind of optimization method at the cell searching interval based on moving velocity of terminal |
| CN114844937A (en) * | 2022-04-29 | 2022-08-02 | 北京智享嘉网络信息技术有限公司 | Network management system and management method of intelligent server |
| CN114915595A (en) * | 2022-03-11 | 2022-08-16 | 北京邮电大学 | Burst packet matching method and electronic equipment |
-
2004
- 2004-08-12 CN CNB2004100536617A patent/CN1271803C/en not_active Expired - Fee Related
Cited By (44)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8755289B2 (en) | 2000-08-30 | 2014-06-17 | Broadcom Corporation | Home network system and method |
| US9094226B2 (en) | 2000-08-30 | 2015-07-28 | Broadcom Corporation | Home network system and method |
| US8724485B2 (en) | 2000-08-30 | 2014-05-13 | Broadcom Corporation | Home network system and method |
| US9160555B2 (en) | 2000-08-30 | 2015-10-13 | Broadcom Corporation | Home network system and method |
| US8761200B2 (en) | 2000-08-30 | 2014-06-24 | Broadcom Corporation | Home network system and method |
| US9184984B2 (en) | 2000-08-30 | 2015-11-10 | Broadcom Corporation | Network module |
| CN101292475B (en) * | 2005-10-21 | 2012-05-02 | 国际商业机器公司 | Adaptive bandwidth control method and device |
| CN100536427C (en) * | 2005-10-25 | 2009-09-02 | 北京大学 | Method for self similar cluster packet of large file service light transmission |
| CN1794880B (en) * | 2005-12-21 | 2010-05-05 | 中国科学院计算技术研究所 | Parallel dispatching processing method in optical burst switched network |
| CN101155085B (en) * | 2006-09-29 | 2011-05-11 | 中兴通讯股份有限公司 | Method and device for real-time flux prediction and real-time flux monitoring and early warning |
| US8537925B2 (en) | 2006-11-20 | 2013-09-17 | Broadcom Corporation | Apparatus and methods for compensating for signal imbalance in a receiver |
| US8526429B2 (en) | 2006-11-20 | 2013-09-03 | Broadcom Corporation | MAC to PHY interface apparatus and methods for transmission of packets through a communications network |
| US8358663B2 (en) | 2006-11-20 | 2013-01-22 | Broadcom Corporation | System and method for retransmitting packets over a network of communication channels |
| US8831028B2 (en) | 2006-11-20 | 2014-09-09 | Broadcom Corporation | System and method for retransmitting packets over a network of communication channels |
| US9008086B2 (en) | 2006-11-20 | 2015-04-14 | Broadcom Corporation | MAC to PHY interface apparatus and methods for transmission of packets through a communications network |
| US9641456B2 (en) | 2007-05-31 | 2017-05-02 | Avago Technologies General Ip (Singapore) Pte. Ltd. | Apparatus and methods for reduction of transmission delay in a communication network |
| US8345553B2 (en) | 2007-05-31 | 2013-01-01 | Broadcom Corporation | Apparatus and methods for reduction of transmission delay in a communication network |
| CN101355491B (en) * | 2007-07-24 | 2012-03-21 | 华为技术有限公司 | Method for transmitting data and network element equipment |
| US9807692B2 (en) | 2008-07-31 | 2017-10-31 | Avago Technologies General Ip (Singapore) Pte. Ltd. | Systems and methods for providing power management |
| US9112717B2 (en) | 2008-07-31 | 2015-08-18 | Broadcom Corporation | Systems and methods for providing a MoCA power management strategy |
| CN101754054B (en) * | 2008-12-01 | 2012-12-19 | 华为技术有限公司 | Method, device and system for treating business transmission |
| US8737254B2 (en) | 2008-12-22 | 2014-05-27 | Broadcom Corporation | Systems and methods for reducing reservation request overhead in a communications network |
| CN101800693B (en) * | 2008-12-22 | 2013-11-13 | 美国博通公司 | Method for managing data transmission in moca network and coaxial cable network |
| US8213309B2 (en) | 2008-12-22 | 2012-07-03 | Broadcom Corporation | Systems and methods for reducing latency and reservation request overhead in a communications network |
| US9554177B2 (en) | 2009-03-30 | 2017-01-24 | Broadcom Corporation | Systems and methods for retransmitting packets over a network of communication channels |
| US8553547B2 (en) | 2009-03-30 | 2013-10-08 | Broadcom Corporation | Systems and methods for retransmitting packets over a network of communication channels |
| US9531619B2 (en) | 2009-04-07 | 2016-12-27 | Broadcom Corporation | Channel assessment in an information network |
| US8730798B2 (en) | 2009-05-05 | 2014-05-20 | Broadcom Corporation | Transmitter channel throughput in an information network |
| US8867355B2 (en) | 2009-07-14 | 2014-10-21 | Broadcom Corporation | MoCA multicast handling |
| US8942250B2 (en) | 2009-10-07 | 2015-01-27 | Broadcom Corporation | Systems and methods for providing service (“SRV”) node selection |
| US8942220B2 (en) | 2010-02-22 | 2015-01-27 | Broadcom Corporation | Method and apparatus for policing a flow in a network |
| US8611327B2 (en) | 2010-02-22 | 2013-12-17 | Broadcom Corporation | Method and apparatus for policing a QoS flow in a MoCA 2.0 network |
| US8514860B2 (en) | 2010-02-23 | 2013-08-20 | Broadcom Corporation | Systems and methods for implementing a high throughput mode for a MoCA device |
| US8953594B2 (en) | 2010-02-23 | 2015-02-10 | Broadcom Corporation | Systems and methods for increasing preambles |
| CN102761484B (en) * | 2012-06-29 | 2016-05-11 | 重庆邮电大学 | Data channel method for sorting in a kind of light burst-switched |
| CN102761484A (en) * | 2012-06-29 | 2012-10-31 | 重庆邮电大学 | Data channel arrangement method in optical burst switching |
| WO2014183724A1 (en) * | 2013-07-26 | 2014-11-20 | 中兴通讯股份有限公司 | Optical burst ring network bandwidth allocation method and device |
| US9888302B2 (en) | 2013-07-26 | 2018-02-06 | Xi'an Zongxing New Software Co. Ltd. | Method and device for bandwidth assignment of optical burst ring |
| CN107733815A (en) * | 2017-11-06 | 2018-02-23 | 郑州轻工业学院 | Time slot light burst exchange network method for obligating resource based on quasi- power matrix |
| CN109451560A (en) * | 2019-01-08 | 2019-03-08 | 苏州简约纳电子有限公司 | A kind of optimization method at the cell searching interval based on moving velocity of terminal |
| CN109451560B (en) * | 2019-01-08 | 2020-12-15 | 苏州简约纳电子有限公司 | Method for optimizing cell search interval based on terminal moving speed |
| CN114915595A (en) * | 2022-03-11 | 2022-08-16 | 北京邮电大学 | Burst packet matching method and electronic equipment |
| CN114915595B (en) * | 2022-03-11 | 2023-08-01 | 北京邮电大学 | Burst packaging method and electronic equipment |
| CN114844937A (en) * | 2022-04-29 | 2022-08-02 | 北京智享嘉网络信息技术有限公司 | Network management system and management method of intelligent server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1271803C (en) | 2006-08-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1271803C (en) | Self adaptive channel reservation and searching method in light burst exchange | |
| Zheng et al. | A survey of dynamic bandwidth allocation algorithms for Ethernet Passive Optical Networks | |
| JP3961000B2 (en) | Packet transfer apparatus and network system | |
| EP1475985A2 (en) | Traffic scheduling apparatus and method for a base station in a mobile communication system | |
| Choi et al. | Double-phase polling algorithm based on partitioned ONU subgroups for high utilization in EPONs | |
| CN102057593A (en) | Method and apparatus for reducing channel change response times for internet protocol television | |
| US20070133596A1 (en) | EPON system and method for traffic scheduling in EPON system | |
| Chen et al. | Adaptive dynamic bandwidth allocation algorithm with sorting report messages for Ethernet passive optical network | |
| Farahmand et al. | Practical priority contention resolution for slotted optical burst switching networks | |
| EP2371100A1 (en) | Radio link aggregation | |
| Miyoshi et al. | QoS-aware dynamic bandwidth allocation scheme in Gigabit-Ethernet passive optical networks | |
| Dixit et al. | Adaptive multi-gate polling with void filling for long-reach passive optical networks | |
| Chua et al. | Quality of service in optical burst switched networks | |
| Qi-yu et al. | A dynamic bandwidth allocation scheme for GPON based on traffic prediction | |
| Ahn et al. | Hierarchical dynamic bandwidth allocation algorithm for multimedia services over Ethernet PONs | |
| CN1581843A (en) | Flow control device and method based on packet mode | |
| Ferguson et al. | Online excess bandwidth distribution for Ethernet passive optical networks | |
| Skubic et al. | Dynamic bandwidth allocation in EPON and GPON | |
| CN1317838C (en) | Light burst exchange network edge node structure and realizing method | |
| CN1728640A (en) | Quick responsive method and system for assigning dynamic bandwidch | |
| Vlachos et al. | A virtual one-way signaling protocol with aggressive resource reservation for improving burst transmission delay | |
| Dolama et al. | Multi group dynamic bandwidth allocation scheme in long reach PONs | |
| Chen et al. | Predictive credit based dynamic bandwidth allocation mechanisms in Ethernet passive optical network | |
| Kim et al. | Performance enhancement of differentiated services in E PON: smaller buffer and efficient traffic service isolation | |
| Wei et al. | Delay-aware Rate Adjusting Scheme in Higher Speed Passive Optical 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 | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20060823 |