The hopcount to an anycast group

International Journal of Communication Systems

Volumn 17, Issue 3, 2004, Pages 269-285

  Van Mieghem, Piet ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Anycast; Efficiency; Hopcount

Indexed keywords

DIFFERENTIATION (CALCULUS); INTERNET; PROBLEM SOLVING; REAL TIME SYSTEMS; SERVERS; TREES (MATHEMATICS);

ANYCAST; HOPCOUNT;

TELECOMMUNICATION SERVICES;

EID: 1842665054     PISSN: 10745351     EISSN: None     Source Type: Journal    
DOI: 10.1002/dac.642     Document Type: Article

References (19)

1. Van Mieghem P, Hooghiemstra G, van der Hofstad R. On the efficiency of multicast. IEEE/ACM Transactions on Networking 2001; 9(6):719-732.
2. Phillips G, Shenker S, Tangmunarunkit H. Scaling of multicast trees; comments on the Chuang-Sirbu scaling law. Proceedings of the ACM Sigcomm, Cambridge, MA, USA, September 1999.
3. Chalmers RC, Almeroth KC. On the topology of multicast trees. IEEE/ACM Transactions on Networking 2003; 11(1):153-165.
4. Krishnan P, Raz D, Shavitt Y. The Cache location problem. IEEE/ACM Transactions on Networking 2000; 8(5):586-582.
5. Qiu L, Padmanabhan VN, Voelker GM. On the placement of web server replicas. IEEE INFOCOM, Anchorage, Alaska, April 2001.
6. Barford P, Cai J-Y, Gast J. Cache placement methods based on client demand clustering. IEEE INFOCOM, New York, USA, June 2002.
7. Jamin S, Jin C, Kure AR, Raz D, Shavitt Y. Constrained mirror placement on the internet. IEEE INFOCOM, New York, USA, June 2002.
8. Rodriguez P, Spanner C, Biersack EW. Analysis of web caching architectures: hierarchical and distributed caching. IEEE JACM Transactions on Networking 2001; 9(4):404-418.
9. Van Mieghem P. Paths in the simple random graph and the Waxman graph. Probability in the Engineering and Informational Sciences (PEIS) 2001; 15:535-555.
10. Van Mieghem P, Hooghiemstra G, van der Hofstad R. A scaling law for the hopcount in internet. Report 2000125 (http://www.nas.ewi.tudelft.nl/people/piet/ teleconference.html).
11. Faloutsos M, Faloutsos P, Faloutsos C. On power-law relationships of the Internet topology. Proceedings of ACM SIGCOMM'99, Cambridge, MA, 1999; 251-262.
12. Janic M, Kuipers F, Zhou X, Van Mieghem P. Implications for QoS provisioning based on traceroute measurements. In Proceedings of Third International Workshop on Quality of Future Internet Services, QofIS2002, Zurich, Switzerland, 16-18, October 2002; 3-14. Stiller B, et al. (eds). Lecture Notes in Computer Science, vol. 2511. Springer: Berlin.
13. van der Hofstad R, Hooghiemstra G, Van Mieghem P. First passage percolation on the random graph. Probability in the Engineering and Informational Sciences (PEIS) 2001; 15:225-237.
14. van der Hofstad R, Hooghiemstra G, Van Mieghem P. On the covariance of the level sizes in random recursive trees. Random Structures and Algorithms 2002; 20:519-539.
15. Abramowitz M, Stegun IA. Handbook of Mathematical Functions. Dover: New York, 1968.
16. Na HS, Rapoport A. Distribution of nodes of a tree by degree. Mathematical Biosciences 1970; 6:313-329.
17. Feller W. An Introduction to Probability Theory and Its Applications, vol. 1. Wiley: New York, 1970.
18. Van Mieghem P. The probability distribution of the hopcount to an anycast group. Report 2003605 (http://www.nas.ewi.tudelft.nl/people/piet/ teleconference.html).
19. Bollobas B. Random Graphs (2nd edn). Cambridge University Press: Cambridge, 2001.