A routing architecture for scheduled dynamic circuit services

  • Authors:
  • Malathi Veeraraghavan;David Starobinski

  • Affiliations:
  • University of Virginia;Boston University

  • Venue:
  • Proceedings of the Re-Architecting the Internet Workshop
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

A wide range of applications in the nascent field of cloud computing and in other fields require stable, low-delay wide-area connectivity together with capabilities of co-scheduling network and server resources. As a result, both research and commercial providers have recently started to deploy scheduled dynamic circuit services (SDCS) as a complement to their IP-routed and leased-line service offerings. Under such services, corporations, universities, or end-users dynamically place requests for a fixed-rate circuit lasting for a fixed duration, for either earliest possible usage or scheduled usage at some point in the future. The lack of adequate support for inter-domain routing and provisioning represents, however, a major hurdle to the full-scale deployment of SDCS. Indeed, existing protocols, such as BGP, do not cater to future dynamic allocation and scheduling of network resources. In this paper, we introduce a strawman protocol, called scheduled circuit routing protocol (SCRP), geared towards inter-domain routing in SDCS-based architectures. The purpose of this protocol is to report available bandwidth information as a function of time across domains without revealing internal network topologies. We describe tradeoffs associated with the design of such a protocol, more particularly the challenge of ensuring high performance while maintaining low implementation complexity, and present avenues for future research.