A Distributed Cache Architecture with Snooping for QoS Routing in Large Networks
To meet the diverse quality-of-service (QoS) requirements of emerging multimedia applications, communication networks should provide end-to-end QoS guarantees. QoS routing is the first step towards this goal. The route computing overhead caused by on-demand calculation of QoS routes, especially in large networks with heavy traffic, is a concern and can cause scalability problems. This paper addresses this problem by introducing a novel distributed cache architecture. The distributed nature of the proposed cachearchitecture facilitates its deployment in large networks. To maximize the performance of the distributed cache architecture, cache snooping has been proposed to alleviate the side effects of network states fluctuations on the cached route so that the overall routing performance is significantly improved. Assuming a bandwidth-based QoS model, in performance evaluation of the proposed distributed cache architecture, we use a broad range of realistic network topologies, network traffic conditions, routing protocols, and aggregation techniques to evaluate different aspects of the proposed cache architecture under different conditions. The results confirm that the route caching is quite effective in reduction of route computing overhead. In addition, our results suggest that the cache snooping can significantly increase the overall routing performance, especially in the presence of highly inaccurate network state information.
G. Apostolopoulos and S. Tripathi. On reducing the cost of on-demand QoS path computation. In Proceedings of International Conference on Network protocols, October 1998.
G. Apostolopoulos, R. Guerin, S. Kamat, and S. Tripathi. Quality of service based routing: a performance perspective. In Proceedings of ACM SIGCOMM’98, September 1998.
ATM Forum. Private Network-Network Interface specification version 1.0. Technical report af-pnni-0055.000, ATM forum, March 1996.
B. Awerbuck, Y. Du, B. Khan, and Y. Shavitt. Routing Through Networks with Hierarchical Topology Aggregation. Journal of High Speed Networks, 7(17):57-73, 1998,
V.A. Bolotin. Modeling call holding time distributions for CCS network design and performance analysis. IEEE Journal of Selected Areas in Communications, 12(3): 433-438, April 1994.
E. Crawley, R. Nair, B. Opalan, and H. Sandick. A framework for QoS-based routing in the Internet. IETF Internet Draft, July 1997.
I. Cidon, T. Hsiao, A. Khamisy, A. Parekh, R. Rom, and M. Sidi.OPENET: An Open and Efficient Control Platform for ATM Networks. In Proceedings of INFOCOM'98, San Francisco, California, pp. 824,March 1998.
G. C. Ewing, K. Pawlikowski, and D. Mcnickle. Akaroa2: Exploiting network computing by distributed stochastic simulation. In Proceedings of the European Simulation Multi Conference, ESM’99, Poland,Warsaw, pp. 175-181.
R. Guerin and A. Orda. QoS-based routing in networks with inaccurate information; theory and algorithms. In Proceedings of INFOCOM’97,1997.
F. Hao, and E. W. Zegura. On scalable QoS routing: performance evaluation of topology aggregation. In Proceedings of INFOCOMM’2000, 2000.
W.C. Lee. Topology aggregation for hierarchical routing in ATM networks. ACM Computer Communication Review, 25(2):82-92, April 1995.
H. Lorenz and A. Orda. QoS routing in networks with uncertain parameters. In Proceedings of NFOCOMM’98, 1998.
Q. Ma and P. Steenkiste. On path selection for traffic with bandwidth guarantees. In proceedings of International Conference on Network Protocols, Atlanta, Georgia, October 1997.
Orda, and A. Sprintson. QoS routing: the precomputing perspective, In proceedings of INFOCOM’2000, 2000.
M. Peyravian and A.D. Kshemkalyani. Network path caching: issues, algorithms and a simulation study, Computer Communications, vol. 20,pp. 605-614, 1997.
A. Shaikh, J. Rexford,, and K.G. Shin. Evaluating the Impact of Stale Link State on Quality-of-Service Routing. IEEE/ACM Transactions on Networking, 2(9):162-176, April 2001.
L. Zhang, M. Andrews, S. Bhatt, and K. Krishnan. A performance comparison of competitive on-line routing and state-dependent routing. In Proceedings of GLOBECOM’97, pp. 1813-1819, 1997.
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.