Name
Title | ||
|---|---|---|
A hop-constraint timing assembly algorithm for facilitating iBUS in IP-over-WDM networks |
Abstract | ||
|---|---|---|
The iBUS (inbuilt Burstification Urgency-driven Scheduling) algorithm delivers packets in IP-over-WDM networks in an "accurate" and "timely" manner. It employs a flexible assembly process which can interact effectively with the urgency-driven process of the iBUS algorithm. In this letter, a hop-constraint timing assembly approach is proposed, where input packets are classified by their routing hops. Then, input packets whose routing hops are more than a threshold are assembled into multi-hop bursts. Multi-hop bursts have higher priority to be scheduled by their urgency degrees, and limited-hop packets (without assembly) can be filled in voids between multi-hop bursts. This approach gives freedom to the urgency-driven process to facilitate iBUS in IP-over-WDM networks. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/LCOMM.2009.081768 | IEEE Communications Letters |
Keywords | Field | DocType |
input packet,hop-constraint timing assembly algorithm,higher priority,urgency-driven process,ibus algorithm,multi-hop burst,ip-over-wdm network,flexible assembly process,limited-hop packet,inbuilt burstification urgency-driven scheduling,hop-constraint timing assembly approach,assembly,scheduling,wavelength division multiplexing,routing,scheduling algorithm,spread spectrum communication,interaction effect | Wavelength-division multiplexing,Telecommunications network,Optical communication,Scheduling (computing),Computer science,Network packet,Computer network,Algorithm,Hop (networking),Packet switching,Spread spectrum,Distributed computing | Journal |
Volume | Issue | ISSN |
13 | 9 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei Li | 1 | 422 | 56.67 |
| Anpeng Huang | 2 | 151 | 21.31 |
| Linzhen Xie | 3 | 61 | 10.32 |
| Biswanath Mukherjee | 4 | 6034 | 537.54 |