Distributed packet switching in arbitrary networks
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Routing and admission control in general topology networks with Poisson arrivals
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Impact of "Trunk Reservation" on Elastic Flow Routing
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Information Sciences—Informatics and Computer Science: An International Journal
Distributed cost-based update policies for QoS routing on hierarchical networks
Information Sciences—Informatics and Computer Science: An International Journal
Minimizing roaming overheads for vertical handoff in heterogeneous wireless mobile networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Reducing traffic fluctuations of link state QoS routing algorithms in virtual circuit networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Opportunity cost analysis for dynamic wavelength routed mesh networks
IEEE/ACM Transactions on Networking (TON)
Wireless Personal Communications: An International Journal
Real-Time coordination and routing in wireless sensor and actor networks
NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
Research: A new distributed routing algorithm for supporting delay-sensitive applications
Computer Communications
Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows
Computer Communications
Efficient hierarchical QoS routing in ATM networks
Computer Communications
Media Independent Handover-based Competitive On-Line CAC for Seamless Mobile Wireless Networks
Wireless Personal Communications: An International Journal
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Emerging high speed Broadband Integrated Services Digital Networks (B-ISDN) will carry traffic for services such as video-on-demand and video teleconferencing -- that require resource reservation along the path on which the traffic is sent. As a result, such networks will need effective {\em admission control} algorithms. The simplest approach is to use greedy admission control; in other words, accept every resource request that can be physically accommodated. However, in the context of symmetric loss networks (networks with a complete graph topology), non-greedy admission control has been shown to be more effective than greedy admission control. This paper suggests a new {\em non-greedy} routing and admission control algorithm for {\em general topology} networks. In contrast to previous algorithms, our algorithm does not require advance knowledge of the traffic patterns. Our algorithm combines key ideas from a recently developed theoretical algorithm with a stochastic analysis developed in the context of reservation-based algorithms. We evaluate the performance of our algorithm using extensive simulations on an existing commercial network topology and on variants of that topology. The simulations show that our algorithm outperforms greedy admission control over a broad range of network environments. The simulations also illuminate some important characteristics of our algorithm. For example, we characterize the importance of the implicit routing effects of the admission control part of our algorithm.