Routing and capacity allocation in networks with trunk reservation
Mathematics of Operations Research
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
Advance Reservation of Network Resources for Multimedia Applications
IWACA '94 Proceedings of the Second International Workshop on Multimedia: Advanced Teleservices and High-Speed Communication Architectures
Resource Reservation in Advance in Heterogeneous Networks with Partial ATM Infrastructures
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
The Basics of Reliable Distributed Storage Networks
IT Professional
Lambda scheduling algorithm for file transfers on high-speed optical circuits
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
A dynamically adaptive hybrid algorithm for scheduling lightpaths in lambda-grids
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid - Volume 01
Ultrascience net: network testbed for large-scale science applications
IEEE Communications Magazine
A routing architecture for scheduled dynamic circuit services
Proceedings of the Re-Architecting the Internet Workshop
Throughput-competitive advance reservation with bounded path dispersion
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
As a result of perceived limitations of TCP/IP in supporting high-throughput applications, significant efforts have recently been devoted to develop alternative architectures based on the concept of advance channel reservation. In this paper, we develop a polynomial-time algorithmic framework, called graded channel reservation (GCR), to support the implementation of such architectures. This framework enables users to specify minimum bandwidth and duration requirements for their connections. Upon receiving a request, GCR returns the highest graded path, selected according to a general, multicriteria optimization objective. In particular, if the optimization criterion is delay, we prove that GCR returns the earliest time available to establish the connection. Thereafter, we present a generalization of GCR, called GCRswitch, that is capable of supporting path switching throughout a connection. We present practical methods for minimizing or limiting the number of path switches. Through extensive simulations, we evaluate the performance of GCR and its variants under various topological settings and applications workload. Our results show that, for certain traffic parameters, optimized path selection combined with path switching can reduce the average delay of requests by an order of magnitude and increase the maximum sustainable load by as much as 50%.