skip to main content
article
Free Access

On network-aware clustering of Web clients

Published:28 August 2000Publication History
Skip Abstract Section

Abstract

Being able to identify the groups of clients that are responsible for a significant portion of a Web site's requests can be helpful to both the Web site and the clients. In a Web application, it is beneficial to move content closer to groups of clients that are responsible for large subsets of requests to an origin server. We introduce clusters---a grouping of clients that are close together topologically and likely to be under common administrative control. We identify clusters using a ``network-aware" method, based on information available from BGP routing table snapshots.

References

  1. 1 Akamai, http://www.akamai.com.Google ScholarGoogle Scholar
  2. 2 V. Almeida, A. Bestavros, M. Crovella, and A. de Oliveira. Characterizing reference locality inthe www. Technical Report TR-96-11, Boston University Computer Science Department, November 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 American Registry for Internet Numbers IP network dump, October 1999. ftp://rs.arin.net/netinfo.Google ScholarGoogle Scholar
  4. 4 AT&T Routing and Forwarding Table Snapshots, April 1999. Obtained from AT&T.Google ScholarGoogle Scholar
  5. 5 Balachander Krishnamurthy and Jia Wang. On network-aware clustering of web clients. Technical Report Technical Report # 000101-01-TM, AT&T Labs|Research, January 2000. www.research.att.com/~bala/papers/cluster-tm.ps.gz.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 A. Bestavros and C. Cunha. Server-initiated Document Dissemination for the WWW. In IEEE Data Engineering Bulletin, September 1996.Google ScholarGoogle Scholar
  7. 7 L. Breslau, P. Cao,L. Fan, G. Phillips, and S. Shenker. Web Caching and Zipf-like distributions: Evidence and Implications. In Proceedings of IEEE Infocom'99, March 1999. http://www.research.att.com/~breslau/pubs/zipf.ps.gz.Google ScholarGoogle ScholarCross RefCross Ref
  8. 8 Canada Internet Transit Service, December 1999. http://enfm.utcc.utoronto.ca/cgi-bin/ c2/c2routes.pl?pop=toronto.Google ScholarGoogle Scholar
  9. 9 AT&T Cerfnet BGP Route Viewer, September 1999. Host: route-server.cerf.net.Google ScholarGoogle Scholar
  10. 10 Digital island, http://www.digitialisland.com.Google ScholarGoogle Scholar
  11. 11 B. Halabi. Internet Routing Architectures. Cisco Press, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12 B. Krishnamurthy and C. E. Wills. Study of piggyback cache validation for proxy caches in the World Wide Web. In Proc. USENIX Symp. on Internet Technologies and Systems, pages 1-12, December 1997, http://www.usenix.org/events/usits97. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 P. Krishnan, D. Raz, and Y. Shavitt. The cache location problem. Under submission, http://www.cs.bell-labs.com/who/shavitt/pub/stat.ps.gz.Google ScholarGoogle Scholar
  14. 14 C. Labovitz, G. R. Malan, and F. Jahanian. Internet routing instability. InProceedings of ACM SIGCOMM, September 1997. http://www.acm.org/sigcomm/sigcomm97/program.html. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 K. Lougheed and Y. Rekhter. A Border Gateway Protocol. RFC 1163, IETF, June 1990. http://www.ietf.org/rfc/rfc1163.txt.Google ScholarGoogle Scholar
  16. 16 Merit Internet Performance Measurement and Analysis Project, 1999, http://www.merit.edu/~ipma/routing_table.Google ScholarGoogle Scholar
  17. 17 J. T. Moy. OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18 NLANR network analysis infrastructure, November 1997. http://moat.nlanr.net/IPaddrocc.Google ScholarGoogle Scholar
  19. 19 Oregon Exchange BGP Route Viewer, December 1997. Host: route-views.oregon-ix.net.Google ScholarGoogle Scholar
  20. 20 SingAREN BGP routing table, December 1999, http://noc.singaren.net.sg/netstats/routes.Google ScholarGoogle Scholar
  21. 21 Vbns route information, December 1999, http://www.vbns.net/route/index.html.Google ScholarGoogle Scholar

Index Terms

  1. On network-aware clustering of Web clients

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Published in

              cover image ACM SIGCOMM Computer Communication Review
              ACM SIGCOMM Computer Communication Review  Volume 30, Issue 4
              October 2000
              319 pages
              ISSN:0146-4833
              DOI:10.1145/347057
              Issue’s Table of Contents
              • cover image ACM Conferences
                SIGCOMM '00: Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
                August 2000
                348 pages
                ISBN:1581132239
                DOI:10.1145/347059

              Copyright © 2000 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 28 August 2000

              Check for updates

              Qualifiers

              • article

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader