Close category search window
 

A QoS supporting scheduling algorithm for optical burst switching DWDM 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

3 Author(s)
Yang, Mei ; Dept. of Comput. Sci., Texas Univ., Richardson, TX, USA ; Zheng, S.Q. ; Verchere, D.

The ubiquity of IP has led to IP-over-WDM as the core architecture for the next-generation optical Internet. Optical burst switching (OBS) has been proposed to be a competitive switching technology for DWDM networks. The data channel scheduling algorithm is one of the major challenges in OBS. The same-service-to-all model of the current Internet is inadequate for the diverse quality of service expectations of Internet applications and users. Differentiated service (DiffServ) was proposed to provide a scalable and manageable architecture for service differentiation in IP networks. This paper proposes a scheduling algorithm based on an existing LAUC-VF algorithm to support DiffServ and takes advantage of MPLS. Simulation results demonstrate that this algorithm has better QoS performance than the existing LAUC-VF algorithm

Published in:
Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE  (Volume:1 )

Date of Conference: 2001

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.