By Topic

Routing and Scheduling in Distributed Advance Reservation 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
$33 $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)
Chongyang Xie ; Univ. of New Mexico, Albuquerque, NM, USA ; Hamad Alazemi ; Nasir Ghani

Advance reservation of connection requests is a growing focus area and a range of solutions have been proposed. However, most efforts here have focused on scheduling algorithm design and have not addressed related implementation concerns in distributed settings. As a result, most schemes imply the use of a centralized controller, posing many scalability and reliability challenges. In order to address these concerns, this paper proposes a distributed routing solution for advance reservation. Namely, new link-state data structures are defined to summarize timeline-bandwidth state without the "time-slot" constraint along with novel routing update triggering policies for timely state dissemination. A refined distributed path- computation scheme is then developed to use this propagated state. The proposed solution is analyzed using discrete event simulation.

Published in:

Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE

Date of Conference:

6-10 Dec. 2010