Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Routing high-bandwidth traffic in max-min fair share networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Mpls and Label Switching Networks
Mpls and Label Switching Networks
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Networks with Advance Reservations: Applications, Architecture, and Performance
Journal of Network and Systems Management
Data Structures, Algorithms, And Applications In C++
Data Structures, Algorithms, And Applications In C++
Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks
ICN '07 Proceedings of the Sixth International Conference on Networking
Multipath routing algorithms for congestion minimization
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Parallel and Distributed Systems
Dynamic scheduling of network resources with advance reservations in optical grids
International Journal of Network Management
An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks
ISPAN '08 Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks
CHEETAH: circuit-switched high-speed end-to-end transport architecture testbed
IEEE Communications Magazine
Ultrascience net: network testbed for large-scale science applications
IEEE Communications Magazine
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We develop several multipath reservation algorithms for in-advance scheduling of single and multiple file transfers in connection-oriented optical networks. These algorithms consider the jobs one at a time or in a batch. The latter can be potentially useful to minimize the resource conflict between multiple consecutive requests. Extensive simulations using both real world networks and random topologies show that the greedy strategy, which process requests one at a time, can perform comparable to batch scheduling and is significantly better in terms of computational time requirement. Further, this strategy can be extended to reduce the path switching overheads.