QoS information approximation for aggregated networks

IEEE International Conference on Communications

Volumn 4, Issue , 2004, Pages 2107-2111

  Tang, Yong ^a   Chen, Shigang ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATED NETWORKS; DELAY-BANDWIDTH; INFORMATION APPROXIMATION;

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; INFORMATION RETRIEVAL; INTERNET; LEAST SQUARES APPROXIMATIONS; POLYNOMIALS; QUALITY OF SERVICE; SET THEORY; TOPOLOGY;

COMPUTER NETWORKS;

EID: 4143050261     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. W. C. Lee, "Spanning Tree Method for Link State Aggregation in Large Communication Networks." in IEEE INFOCOM'95, vol. 1, Boston, MA, USA, Apr. 1995, pp. 297-302.
2. A. Iwata, H. Suzuki, R. Izmailov, and B. Sengupta, "QoS aggregation algorithms in hierarchical ATM networks," in ICC"1998, vol. 1, Atlanta, GA, USA, June 1998, pp. 243-248.
3. T. Korkmaz and M. Kranz, "Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks," ACM Transactions on Modeling and Computer Simulation, vol. 10, no. 4, pp. 295-325, 2000.
4. K.-S. Lui, K. Nahrstedt, and S. Chen, "Routing with Topology Aggregation in Delay-Bandwidth Sensitive Networks," in to appear in IEEE Transactions on Networking.
5. P. Dierckx, Curve and Surface Fitting with Splines. Oxford. England: Oxford University Press, Inc., 1993.
6. B. M. Waxman, "Routing of Multipoint Connections," IEEE Journal of Selected Areas in Communications, pp. 1617-1622, Dec. 1988.