Cart (Loading....) | Create Account
Close category search window
 

A Scheduling-Aware Burst Assembly Algorithm for Bandwidth-Guaranteed and Delay-Bounded Services in IP-over-WDM Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Anpeng Huang ; Peking Univ., Beijing ; Sarkar, S.

We propose a scheduling-aware burst assembly algorithm to provide bandwidth-guaranteed and delay-bounded services for IP packets in IP-over-WDM networks. To transport IP packets efficiently over a network, they are assembled into bursts, and delivered within a given deadline. All IP packets in a burst should satisfy the deadline requirement, and, in turn, all assembled bursts are guaranteed to be served. To achieve this goal, the assembly and the scheduling processes of each burst need to be performed concurrently within the same active time-window (called joint window). The joint window size is set considering the deadlines of packets in a burst so that each of them (and, in turn, the burst itself) can satisfy its deadline. To guarantee service-availability for each assembled burst, the scheduling information (e.g., when and how long a slot is free for a burst) is fed back to the burst assembly process in each joint window. This scheduling information is used to determine when and how long an assembly process will be conducted. Those packets, which can not make the deadline, are not considered for the burst assembly process. Although, in our algorithm, the packets are transmitted in a burst (as described above), we investigate the packet-level performance for a IP-over-WDM network. The simulation experiments demonstrate that our algorithm can achieve low packet loss probabilities, and guarantee the delay-bound for delivered packets (loss probability and delay-bound are key factors for emerging IP services).

Published in:

Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE

Date of Conference:

26-30 Nov. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.