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.
- Amazon Elastic Compute Cloud (Amazon EC2). http://aws.amazon.com/ec2/.Google Scholar
- AT&T Optical Mesh Service. http://www.business.att.com/.Google Scholar
- DICE InterDomain Controller Protocol (IDCP). http://hpn.east.isi.edu/dice-idcp/.Google Scholar
- Verizon Bandwidth on Demand (BOD). http://www22.verizon.com/.Google Scholar
- M. Andrews, A. Fernandez, A. Goel, and L. Zhang. Source routing and scheduling in packet networks. Journal of the ACM (JACM), 52(4):582--601, July 2005. Google ScholarDigital Library
- L.-O. Burchard. On the performance of computer networks with advance reservation mechanisms. In Proc. of the 11th International Conference on Networks, Sydney, Australia, Sep. 2003.Google ScholarCross Ref
- S. Chen and K. Nahrstedt. An overview of quality-of-service routing for the next generation high-speed networks: Problems and solutions. IEEE Network, 12(6):64--79, 1998. Google ScholarDigital Library
- R. Cohen, N. Fazlollahi, and D. Starobinski. Graded Channel Reservation with Path Switching in Ultra High Capacity Networks. In Proc. IEEE Gridnets'06, October 2006. San-Jose, CA.Google ScholarCross Ref
- R. Cohen, N. Fazlollahi, and D. Starobinski. Competitive Advance Reservation with Bounded Path Dispersion. In Proc. of the IEEE High-Speed Networks Workshop, April 2008.Google ScholarCross Ref
- R. Cohen, N. Fazlollahi, and D. Starobinski. Path Switching and Grading Algorithms for Advanced Channel Reservation Architectures. IEEE/ACM Transactions on Networking, 17(5):1684--1695, October 2009. Google ScholarDigital Library
- N. Fazlollahi, R. Cohen, and D. Starobinski. On the Capacity Limits of Advanced Channel Reservation Architectures. In Proc. of the IEEE High-Speed Networks Workshop, May 2007.Google Scholar
- D. Ferrari, A. Gupta, and G. Ventre. Distributed advance reservation of real-time connections. IMultimedia Systems'97, 5(3):187--198, May 1997. Google ScholarDigital Library
- A. G. Greenberg, R. Srikant, and W. Whitt. Resource sharing for book-ahead and instantaneous-request calls. IEEE/ACM Trans. Netw., 7(1):10--22, 1999. Google ScholarDigital Library
- R. Guérin and A. Orda. Networks with advance reservations: The routing perspective. In Proc. of IEEE INFOCOM, Tel Aviv, Israel, 2000.Google ScholarCross Ref
- H. Lee, M. Veeraraghavan, H. Li, and E. P. Chong. Lambda Scheduling Algorithm for File Transfers on High-speed Optical Circuit. In IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2004), April 2004. Chicago, USA. Google ScholarDigital Library
- B. Metcalfe. Metcalfe's law: A network becomes more valuable as it reaches more users. Infoworld, Oct. 1995.Google Scholar
- O. Schelén and S. Pink. Resource sharing in advance reservation agents. Journal of High Speed Networks, 7(3--4):213--228, 1998. Google ScholarDigital Library
- A. Schill, S. Kuhn, and F. Breiter. Resource Reservation in Advance in Heterogeneous Networks with Partial ATM Infrastructures. In Proceedings of INFOCOM'97, April 1997. Kobe, Japan. Google ScholarDigital Library
- M. Veeraraghavan, M. Karol, and G. Clapp. Optical dynamic circuit services. accepted for publication in IEEE Communications Magazine, 2010. Google ScholarDigital Library
- J. T. Virtamo. A model of reservation systems. IEEE Transactions on Communications, 40:109--118, 1992.Google ScholarCross Ref
- L. C. Wolf and R. Steinmetz. Concepts for resource reservation in advance. Multimedia Tools Appl., 4(3):255--278, 1997. Google ScholarDigital Library
- L. Xiao, K.-S. Lui, J. Wang, and K. Nahrstedt. QoS Extension to BGP. In IEEE International Conference on Network Protocols, pages 100--109, Los Alamitos, CA, USA, 2002. Google ScholarDigital Library
- X. Zhu and M. Veeraraghavan. Analysis and design of book-ahead bandwidth-sharing mechanisms. IEEE Transactions on Communications, 56(12):2156--2165, Dec. 2008.Google ScholarCross Ref
- X. Zhu, X. Zheng, and M. Veeraraghavan. Experiences in implementing an experimental wide-area GMPLS networks. IEEE Journal on Selected Areas in Communication, 25(3):82--92, April 2007. Google ScholarDigital Library
Index Terms
- A routing architecture for scheduled dynamic circuit services
Recommendations
Scheduled hot-potato routing
INFOCOM '95: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2This paper is concerned with fast, hot-potato routing, performed according to a predetermined schedule. At each time period each node selects an outgoing link, through which an incoming packet is sent. No buffers are used. We investigate first the ...
A routing architecture for mobile integrated services networks
Special issue: mobile networking in the InternetA drawback of the conventional Internet routing architecture is that its route computation and packet forwarding mechanisms are poorly integrated with congestion control mechanisms. Any datagram offered to the network is accepted; routers forward ...
Towards Architecture Model based Deployment for Dynamic Grid Services
CEC-EAST '04: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International ConferenceThe deployment of grid services should make the services, including those to be deployed and those already deployed, operate with desired functionalities and qualities. The critical challenge in the deployment is that many technical and non-technical ...
Comments