A hop-constraint timing assembly algorithm for facilitating iBUS in IP-over-WDM networks

  • Authors:
  • Wei Li;Anpeng Huang;Linzhen Xie;Biswanath Mukherjee

  • Affiliations:
  • State Key Lab of Advanced Optical Communication Systems and Networks, Peking University, Beijing, China;State Key Lab of Advanced Optical Communication Systems and Networks, Peking University, Beijing, China;State Key Lab of Advanced Optical Communication Systems and Networks, Peking University, Beijing, China;Department of Computer Science, University of California, Davis, CA

  • Venue:
  • IEEE Communications Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.