ATM networks support multimedia traffic where diverse services have to be provided and various QoS requirements have to be met. Routing plays an important role in guaranteeing the QoS. However conventional routing will cause a significant overhead when the network size gets very large or rerouting occurs frequently due to the varying link state. The objective of our dynamic routing scheme is to perform more efficient routing over a more effective and simpler topology which is abstracted from the original full topology based on the dynamic link state. Only those links with high probability to satisfy the QoS of the call are included in the effective topology. It is an efficient way to prevent rerouting from occurring too often because the blocking probability over this effective topology is significantly low. A hierarchical routing model is also proposed to further reduce the amount of information that has to be stored and exchanged for routing. We present the simulation results of our dynamic routing scheme along with the hierarchical routing model and its implementation over QUARTS, a simulation testbed for ATM networks.
[1]
Tatsuya Suda,et al.
Survey of traffic control schemes and protocols in ATM networks
,
1991,
Proc. IEEE.
[2]
Hamid Ahmadi,et al.
Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks
,
1991,
IEEE J. Sel. Areas Commun..
[3]
S. Bahk,et al.
Preventive congestion control based routing in ATM networks
,
1994,
Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.
[4]
John Moy,et al.
OSPF Version 2
,
1998,
RFC.
[5]
T. Murase,et al.
An alternate path routing scheme supporting QOS and fast connection setup in ATM networks
,
1994,
1994 IEEE GLOBECOM. Communications: The Global Bridge.
[6]
Hussein T. Mouftah,et al.
Virtual call admission control-a strategy for dynamic routing over ATM networks
,
1995,
Proceedings IEEE International Conference on Communications ICC '95.
[7]
Dimitri P. Bertsekas,et al.
Data Networks
,
1986
.