Loading...
Please wait, while we are loading the content...
Similar Documents
Reducing Network Congestion and Blocking Probability Through Balanced Allocation (1999)
| Content Provider | CiteSeerX |
|---|---|
| Author | Luczak, Malwina J. Upfal, Eli |
| Description | In IEEE Symposium on Foundations of Computer Science We compare the performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks to a path selection algorithm that is based on the balanced allocations principle [4, 18] - the Balanced Dynamic Alternative Routing (BDAR) algorithm. While the standard technique checks alternative routes sequentially until available bandwidth is found, the BDAR algorithm compares and chooses the best among a small number of alternatives. We show that, at the expense of a minor increase in routing overhead, the BDAR gives a substantial improvement in network performance in terms of both network congestion and blocking probabilities. 1 Introduction Fast, high bandwidth, circuit switching telecommunications systems such as ATM and telephone networks employ a limited path selection algorithm in order to fully utilize the network resources while minimizing routing overhead. Typically there is a dedicated bandwidth for communication between eac... |
| File Format | |
| Language | English |
| Publisher Date | 1999-01-01 |
| Access Restriction | Open |
| Subject Keyword | Telephone Network Dedicated Bandwidth High Bandwidth Substantial Improvement Limited Path Selection Algorithm Standard Technique Check Balanced Dynamic Alternative Routing Available Bandwidth Network Congestion Standard Dynamic Alternative Routing Small Number Network Resource Minor Increase Atm Network Path Selection Algorithm Network Performance Balanced Allocation Blocking Probability Balanced Allocation Telecommunication System Introduction Fast Bdar Algorithm Compare |
| Content Type | Text |
| Resource Type | Article |
