Abstract
Classic circuit-switched telephone networks as well as modern Broadband Integrated Services Digital Networks (B-ISDN) need good admission control and routing strategies to guarantee an efficient use of the network resource. We compare the performance of two nongreedy strategies, competitive on-line routing (COL) and state-dependent routing (SDR), by using an extensive set of simulations. In most of our experiments, SDR has a noticeable performance advantage over COL and SDR-ADAPT (the adaptive version of SDR) by knowing the traffic in advance. Algorithm SDR-ADAPT outperforms COL for the majority of our networks, which indicates the usefulness of adapting to the traffic information. Algorithm COL, however, has performance guarantees even without any statistical assumptions on the traffic.
Original language | English |
---|---|
Pages | 1813-1819 |
Number of pages | 7 |
State | Published - 1997 |
Event | Proceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3) - Phoenix, AZ, USA Duration: 3 Nov 1997 → 8 Nov 1997 |
Conference
Conference | Proceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3) |
---|---|
City | Phoenix, AZ, USA |
Period | 3/11/97 → 8/11/97 |