On characterizing affinity and its impact on network performance

Proceedings of the ACM SIGCOMM Workshop on Models, Methods and Tools for Reproducible Network Research, MoMeTools '03

Volumn , Issue , 2003, Pages 65-75

  Lucas, Gabriel ^a   Ghose, Abhishek ^b   Chuang, John ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTENT DELIVERY NETWORK; INPUT PARAMETER; MEMBER SELECTION; MULTICAST EFFICIENCY; MULTICAST GROUPS; MULTICASTS; PHILIPS; REPLICA PLACEMENT; REPRODUCIBLE RESEARCH; SIMULATION-BASED; WEB CLIENTS;

ALGORITHMS; MULTICASTING; NETWORK PERFORMANCE; RESEARCH;

COMPUTER SIMULATION;

EID: 77953191656     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/944773.944785     Document Type: Conference Paper

References (31)

1. NLANR global as interconnectivity graphs. http://moat.nlanr.net/AS/, 2003.
2. W. Aiello, F. Chung, and L. Lu. A random graph model for massive graphs. In Proceedings of the ACM Symposium on Theory of Computing, pages 171-180, 2000.
3. A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, Oct. 1999.
4. P. Barford, J.-Y. Cai, and J. Gast. Cache placement methods based on client demand clustering. In Proceedings of IEEE INFOCOM, pages 41-50, Apr. 22-26 2001.
5. T. Bu and D. Towsley. On distinguishing between internet power law topology generators. In Proceedings of IEEE INFOCOM, pages 1587-1596, June 23-27 2002.
6. R. Chalmers and K. Almeroth. Modeling the branching characteristics and efficiency gains of global multicast trees. In Proceedings of IEEE INFOCOM, pages 449-458, Apr. 22-26 2001.
7. H. Chang, R. Govindan, S. Jamin, S. J. Shenker, and W. Willinger. Towards capturing representative AS-Level internet topologies. In Proceedings of ACM SIGMETRICS, pages 280-281, June 15-19 2002.
8. J. C.-I. Chuang and M. A. Sirbu. Pricing multicast communication: A cost-based approach. Telecommunication Systems, 17(3):281-297, 2001.
9. M. Doar. A better model for generating test networks. In Proceedings of IEEE GLOBECOM, Nov. 10-12 1996.
10. R. Govindan and H. Tangmunarunkit. Heuristics for internet map discovery. In Proceedings of IEEE INFOCOM, pages 1371-1380, Mar. 26-30 2000.
11. X. He and C. Papadopoulos. A framework for incremental deployment strategies for router-assisted services. In Proceedings of IEEE INFOCOM, pages 1301-1310, Apr. 1-3 2003.
12. C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of ACM MOBICOM, pages 56-67, Aug. 6-11 2000.
13. S. Jamin, C. Jin, A. Kurc, Y. Shavitt, and D. Raz. Constrained mirror placement on the internet. In Proceedings of IEEE INFOCOM, pages 31-40, Apr. 22-26 2001.
14. C. Jin, Q. Chen, and S. Jamin. Inet: Internet topology generator. Technical Report Report CSE-TR443-00, Department of EECS, University of Michigan, 2000.
15. B. Krishnamurthy and J. Wang. On network-aware clustering of web clients. In Proceedings of ACM SIGCOMM, pages 97-110, 2000.
16. B. Krishnamurthy and J. Wang. Topology modeling via cluster graphs. In Proceedings of the First ACM SIGCOMM Internet Measurement Workshop (IMW-01), pages 19-24, Nov. 1-2 2001.
17. A. Medina, I. Matta, and J. Byers. BRITE: A flexible generator of internet topologies. Technical Report 2000-005, CS Department, Boston University, Jan. 21 2000.
18. M. Mihail, C. Gkantsidis, A. Saberi, and E. Zegura. On the semantics of internet topologies. Technical Report GIT-CC-02-07, Georgia Institute of Technology, 2002.
19. G. Phillips, S. Shenker, and H. Tangmunarunkit. Scaling of multicast trees: Comments on the chuang-sirbu scaling law. In Proceedings of ACM SIGCOMM, pages 41-52, 1999.
20. L. Qiu, V. Padmanabhan, and G. Voelker. On the placement of web server replicas. In Proceedings of IEEE INFOCOM, pages 1587-1596, Apr. 22-26 2001.
21. P. Radoslavov. The Relationship Between Topology and Protocol Performance: Case Studies. PhD thesis, University of Southern California, 2001.
22. P. Radoslavov, R. Govindan, and D. Estrin. Topology-Informed internet replica placement. In Proceedings of the Sixth International Workshop on Web Caching and Content Distribution, pages 229-238, June 20-22 2001.
23. P. Radoslavov, H. Tangmunarunkit, H. Yu, R. Govindan, S. Shenker, and D. Estrin. On characterizing network topologies and analyzing their impact on protocol design. Technical Report USC-CS-TR-00-731, University of Southern California, 2000.
24. L. Subramanian, S. Agarwal, J. Rexford, and R. H. Katz. Characterizing the internet hierarchy from multiple vantage points. In Proceedings of IEEE INFOCOM, June 23-27 2002.
25. H. Tangmunarunkit, R. Govindan, S. Shenker, S. Jamin, and W. Willinger. Network topology generators: Degree-based vs. structural. In Proceedings of ACM SIGCOMM, pages 147-160, Aug. 19-23 2002.
26. S. Tilak, N. Abu-Ghazaleh, and W. Heinzelman. Infrastructure tradeoffs for sensor networks. In Proceedings of the ACM 1st International Workshop on Sensor Networks and Applications (WSNA '02), pages 65-77, Sept. 16-17 2002.
27. B. Warneke, M. Last, B. Liebowitz, and K. Pister. Smart dust: Communicating with a cubic-millimeter computer. IEEE Computer, pages 44-51, Jan. 2001.
28. D. J. Watts and S. H. Strogatz. Collective dynamics of small world networks. Nature, 393(6684):397-498, June 1998.
29. B. M. Waxman. Routing of multipoint connections. IEEE Jour. Selected Areas in Communications (Special Issue: Broadband Packet Communications), 6(9):1617-1622, Dec. 1988.
30. T. Wong, R. H. Katz, and S. McCanne. An evaluation on using preference clustering in large-scale multicast applications. In Proceedings of IEEE INFOCOM, pages 451-460, Mar. 26-30 2000.
31. E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. How to model an internetwork. In Proceedings of IEEE INFOCOM, volume 2, pages 594-602, March 1996.