QoS routing: Average complexity and hopcount in m dimensions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2156, Issue , 2001, Pages 110-126

  Kuipers, F A ^a   Van Mieghem, P ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; NETWORK ARCHITECTURE; WEB SERVICES;

AVERAGE COMPLEXITY; BUILDING BLOCKES; EXACT ALGORITHMS; QOS ROUTING; QOS ROUTING ALGORITHMS; QOS-AWARE; SINGLE PARAMETER; SPECIAL CLASS;

NETWORK ROUTING;

EID: 35148872764     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45412-8_9     Document Type: Conference Paper

References (20)

1. Abramowitz, M. and I.A. Stegun (eds.), Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables, Dover Pubns, June 1974, ISBN: 0486612724.
2. Barndorff-Nielsen, O. and M. Sobel, On the distribution of the number of admissible points in a vector random sample, Theory of Probability and its Applications, vol. 11, no. 2, 1966.
3. Bentley, J.L., H.T. Kung, M. Schkolnick and C.D. Thompson., On the Average Number of Maxima in a Set of Vectors and Applications, Journal of ACM, vol. 25, no. 4, pp. 536-543, 1978.
4. Bollobas, B., Random Graphs, Academic Press, London, 1985.
5. Chong, E.I., S. Maddila, S. Morley, On Finding Single-Source Single-Destination k Shortest Paths, J. Computing and Information, 1995, special issue ICCI’95, pp. 40-47.
6. Cormen, T.H., C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, 2000.
7. De Neve, H. and P. Van Mieghem, A multiple quality of service routing algorithm for PNNI, IEEE ATM workshop, Fairfax, May 26-29, 1998, pp. 324-328.
8. De Neve, H. and P. Van Mieghem, TAMCRA: A Tunable Accuracy Multiple Constraints Routing Algorithm, Computer Communications, 2000, vol. 23, pp. 667-679.
9. Edwards, H. M., Riemann’s Zeta Function, Academic Press, New York, 1974.
10. Garey, M.R. and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
11. Guo, L. and I. Matta, Search space reduction in QoS routing, Proc. of the 19th III Int. Conference on Distributed Computing Systems, III, May 1999, pp. 142-149.
12. Henig, M.I., The shortest path problem with two objective functions, European J. of Operational Research, 1985, vol. 25, pp. 281-291.
13. Korkmaz, K. and M. Krunz, Multi-Constrained Optimal Path Selection, IEEE INFOCOM 2001.
14. Levin, L.A., Average Case Complete Problems, SIAM J. Comput., 1986, 15(1):285-286.
15. Titchmarsh, E. C., The Theory of Functions, Oxford University Press, 1964.
16. Van Mieghem, P., G. Hooghiemstra and R. van der Hofstad, A Scaling Law for the Hopcount in Internet, Delft University of Technology, report 2000125, 2000, http://wwwtvs.et.tudelft.nl/people/piet/telconference.html.
17. Van Mieghem, P., H. De Neve and F.A. Kuipers, Hop-by-Hop Quality of Service Routing, to appear in Computer Networks, 2001.
18. Van Mieghem, P., Paths in the simple Random Graph and the Waxman Graph, to appear in Probability in the Engineering and Informational Sciences (PEIS), 2001.
19. Van Mieghem, P., The Asymptotic Behaviour of Queueing Systems: Large Deviations Theory and Dominant Pole Approximation, Queueing Systems 23, 27-55, 1996.
20. Wang, Z. and J. Crowcroft, 1996, QoSR outing for supporting Multimedia Applications, IEEE JSAC, 14(7): 1188-1234, September 1996.