Rate-distortion based link state update

Computer Networks

Volumn 50, Issue 17, 2006, Pages 3300-3314

  Cheng, Gang ^a   Ansari, Nirwan ^b  

^a VPISystems Inc   (United States)

^b NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Information theory; Link state update; QoS routing; Rate distortion function

Indexed keywords

COMPUTER SIMULATION; CONSTRAINT THEORY; DISTRIBUTED COMPUTER SYSTEMS; PROBABILITY; PROBLEM SOLVING; QUALITY OF SERVICE;

LINK STATE UPDATE; QOS ROUTING; RATE-DISTORTION FUNCTION;

INFORMATION THEORY;

EID: 33748562462     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2005.12.008     Document Type: Article

References (22)

1. Chen S., and Nahsted K. An overview of quality of service routing for next-generation high-speed network: problems and solutions. IEEE Network 12 6 (1998) 64-79
2. Cheng G., and Ansari N. On multiple additively constrained path selection. IEE Proceedings on Communications 149 5 (2002) 237-241
3. R. Guerin, A. Orda, QoS based routing in networks with inaccurate information: theory and algorithms, in: Proceedings of the IEEE INFOCOM'97, 1997, pp. 75-83.
4. T. Korkmaz., M. Krunz, S. Tragoudas, An efficient algorithm for finding a path subject to two additive constraints, in: Proceedings of the ACM SIGMETRICS'2000, 2000, pp. 318-327.
5. L. Gang, K.G. Ramakrishnan, A prune: an algorithm for finding k shortest paths subject to multiple constraints, in: Proceedings of IEEE INFOCOM'2001, vol. 2, 2001, pp. 743-749.
6. S. Chen, K. Nahrstedt, Distributed QoS routing with imprecise state information, in: Proceedings of 7th International Conference on Computer Communications and Networks, 1998, pp. 614-621.
7. Wang Z., and Crowcroft J. Quality of Service routing for supporting multimedia applications. IEEE Journal on Selected Areas on Communications 14 7 (1996) 1228-1234
8. Humblet P.A., and Soloway S.R. Topology broadcast algorithms. Computer Networks and ISDN Systems 16 (1988-1989) 179-186
9. B. Bellur, R.G. Ogier, A reliable, efficient topology broadcast protocol for dynamic networks, in: Proceedings of IEEE INFOCOM'99, vol. 1, 1999, pp. 178-186.
10. A. Zinin, M. Shand, Flooding optimizations in link-state routing protocols, IETF, draft-ietf-ospf-isis-flood-opt-01.txt, 2001.
11. J. Moy, Flooding over a subset topology, IETF, draft-ietf-ospf-subset-flood-00.txt, 2001.
12. J. Moy, OSPF version 2, RFC2328, IETF, 1998.
13. G. Apostolopoulos, R. Guerin, S. Kamat, S. Tripathi, Quality-of-service based routing: a performance perspective, in: Proceedings of ACM SIGCOMM 1998, vol. 28, 1998, pp. 17-28.
14. Shaikh A., Rexford J., and Shin K.G. Evaluating the impact of stale link state on quality-of-service routing. IEEE/ACM Transactions on Networking 9 2 (2001) 162-176
15. Q. Ma, P. Steenkiste, Quality-of-service routing for traffic with performance guarantees, in: Proceedings of IFIP International Workshop on Quality of Service 1997, 1997, pp. 115-126.
16. L. Breslau, D. Estrin, L. Zhang, A simulation study of adaptive source routing in integrated services networks, Computer Science Department, University of Southern California, Technical Report 93-551, 1993.
17. Peyravian M., and Onvural R. Algorithm for efficient generation of link-state updates in ATM networks. Computer Networks and ISDN System 29 (1997) 237-247
18. X. Li, L.K. Shan, W. Jun, N. Klara, QoS extension to BGP, in: Proceedings of IEEE ICNP'02, 2002, pp. 100-109.
19. Floyd S., and Paxson V. Difficulties in simulating the internet. IEEE/ACM Transactions on Networking 9 (2001) 392-403
20. Leland W.E., Willinger W., Taqqu M.S., and Willson D.V. On the self-similar nature of Ethernet traffic. IEEE/ACM Transactions on Networking 2 (1994) 1-15
21. B.A. Mah, An empirical model of HTTP network traffic, in: Proceedings of the IEEE INFOCOM'97, vol. 2, 1997, pp. 592-600.
22. M.E. Crovella, A. Bestavros, Self-similarity in World Wide Web traffic: evidence and possible causes, in: Proceedings of ACM SIGMETRICS'96, 1996, pp. 160-169.