Bandwidth scheduling and path computation algorithms for connection-oriented networks

Sartaj Sahni, Nageshwara Rao, Sanjay Ranka, Yan Li, Eun Sung Jung, Nara Kamath

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

46 Scopus citations

Abstract

There has been an increasing number of network deployments that provide dedicated connections through on-demand and in-advance scheduling in support of high-performance applications. We describe algorithms for scheduling and path computations needed for dedicated bandwidth connections for fixed-slot, highest available bandwidth in a given slot, first available slot, and all-available slots computations. These algorithms for bandwidth scheduling are based on extending the classical breadth-first search, Dijkstra, and Bellman-Ford algorithms. We describe a bandwidth management system for UltraScience Net that incorporates implementations of these algorithms.

Original languageEnglish
Title of host publicationProceedings of the Sixth International Conference on Networking, ICN'07
DOIs
StatePublished - 2007
Event6th International Conference on Networking, ICN'07 - Sainte-Luce, Martinique, France
Duration: Apr 22 2007Apr 28 2007

Publication series

NameProceedings of the Sixth International Conference on Networking, ICN'07

Conference

Conference6th International Conference on Networking, ICN'07
Country/TerritoryFrance
CitySainte-Luce, Martinique
Period04/22/0704/28/07

Keywords

  • Backend signaling
  • MPLS/GMPLS distributed implementation
  • Multi-domain scheduling
  • Resource scheduling

Fingerprint

Dive into the research topics of 'Bandwidth scheduling and path computation algorithms for connection-oriented networks'. Together they form a unique fingerprint.

Cite this