Sun, 27 Jul 2008 09:15:21 BST CiteULike: sora's library [32 articles] http://www.citeulike.org/user/sora CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/sora/article/2697820 <i>(2002)</i><br /><br />We present Scriptroute, a system that allows ordinary Internet users to conduct network measurements from remote vantage points. We seek to combine the flexibility found in dedicated measurement testbeds such as NIMI with the general accessibility and popularity of Web-based public traceroute servers. To use Scriptroute, clients use DNS to discover measurement servers and then submit a measurement script for execution in a sandboxed, resource-limited environment. The servers ensure that the... Scriptroute: A Public Internet Measurement Facility N Spring D Wetherall T Anderson (2002) 2008-04-21T18:42:47-00:00 2002 no-tag http://www.citeulike.org/user/sora/article/1042040 <i>Networking, IEEE/ACM Transactions on, Vol. 12, No. 1. (2004), pp. 2-16.</i><br /><br />To date, realistic ISP topologies have not been accessible to the research community, leaving work that depends on topology on an uncertain footing. In this paper, we present new Internet mapping techniques that have enabled us to measure router-level ISP topologies. Our techniques reduce the number of required traces compared to a brute-force, all-to-all approach by three orders of magnitude without a significant loss in accuracy. They include the use of BGP routing tables to focus the measurements, the elimination of redundant measurements by exploiting properties of IP routing, better alias resolution, and the use of DNS to divide each map into POPs and backbone. We collect maps from ten diverse ISPs using our techniques, and find that our maps are substantially more complete than those of earlier Internet mapping efforts. We also report on properties of these maps, including the size of POPs, distribution of router outdegree, and the interdomain peering structure. As part of this work, we release our maps to the community. Measuring ISP topologies with Rocketfuel N Spring R Mahajan D Wetherall T Anderson Networking, IEEE/ACM Transactions on, Vol. 12, No. 1. (2004), pp. 2-16. 2007-01-15T08:23:22-00:00 2004 Networking, IEEE/ACM Transactions on 12 1 2 16 measurement topology http://www.citeulike.org/user/sora/article/781332 <i>Signal Processing Magazine, IEEE, Vol. 19, No. 3. (2002), pp. 47-65.</i><br /><br />Today's Internet is a massive, distributed network which continues to explode in size as e-commerce and related activities grow. The heterogeneous and largely unregulated structure of the Internet renders tasks such as dynamic routing, optimized service provision, service-level verification, and detection of anomalous/malicious behavior increasingly challenging tasks. The problem is compounded by the fact that one cannot rely on the cooperation of individual servers and routers to aid in the collection of network traffic measurements vital for these tasks. In many ways, network monitoring and inference problems bear a strong resemblance to other "inverse problems" in which key aspects of a system are not directly observable. Familiar signal processing problems such as tomographic image reconstruction, system identification, and array processing all have interesting interpretations in the networking context. This article introduces the new field of network tomography, a field which we believe will benefit greatly from the wealth of signal processing theory and algorithms Internet tomography A Coates Hero R Nowak Bin Yu Signal Processing Magazine, IEEE, Vol. 19, No. 3. (2002), pp. 47-65. 2006-08-01T02:15:08-00:00 2002 Signal Processing Magazine, IEEE 19 3 47 65 measurement topology http://www.citeulike.org/user/sora/article/1041818 <i>SIGCOMM Comput. Commun. Rev., Vol. 36, No. 1. (January 2006), pp. 17-26.</i> The internet AS-level topology: three data sources and one definitive metric Priya Mahadevan Dmitri Krioukov Marina Fomenkov Xenofontas Dimitropoulos Claffy Amin Vahdat doi:10.1145/1111322.1111328 SIGCOMM Comput. Commun. Rev., Vol. 36, No. 1. (January 2006), pp. 17-26. 2007-01-15T04:33:06-00:00 2006 SIGCOMM Comput. Commun. Rev. 0146-4833 36 1 17 26 ACM Press measurement topology http://www.citeulike.org/user/sora/article/1041814 <i>Computer, Vol. 32, No. 4. (April 1999)</i> Mapping the Internet Hal Burch Bill Cheswick doi:10.1109/2.755008 Computer, Vol. 32, No. 4. (April 1999) 2007-01-15T04:27:53-00:00 1999 Computer 0018-9162 32 4 IEEE Computer Society Press measurement topology http://www.citeulike.org/user/sora/article/1040445 <i>(2006), pp. 71-84.</i> Towards IP geolocation using delay and topology measurements Ethan Katz-Bassett John John Arvind Krishnamurthy David Wetherall Thomas Anderson Yatin Chawathe doi:10.1145/1177080.1177090 (2006), pp. 71-84. 2007-01-14T01:23:46-00:00 2006 71 84 ACM Press geolocation measurement topology http://www.citeulike.org/user/sora/article/991694 <i>IEEE Network Interactive, Vol. 16 (July 2002)</i> 'OMNeT++' by András Varga (2306) IEEE Network Interactive, Vol. 16 (July 2002) 2006-12-13T02:23:40-00:00 2002 IEEE Network Interactive 16 koh39 http://www.citeulike.org/user/sora/article/991693 <i></i><br /><br />This paper presents a new framework for Peer-to-Peer Adaptive Layered Streaming, called PALS. PALS is a receiver-driven approach for quality adaptive playback of layer encoded streaming media from a group of congestion controlled sender peers to a single receiver peer. Since the effective throughput from each sender is variable and not known a priori, it is challenging to coordinate delivery among active senders. In PALS, the receiver orchestrates coordinated delivery among active senders by... PALS: Peer-to-Peer Adaptive Layered Streaming R Rejaie A Ortega 2006-12-13T02:16:46-00:00 koh39 http://www.citeulike.org/user/sora/article/991692 <i>(2005), pp. 59-68.</i> A new approach for the construction of ALM trees using layered video coding Yohei Okada Masato Oguro Jiro Katto Sakae Okubo doi:10.1145/1099384.1099393 (2005), pp. 59-68. 2006-12-13T02:15:29-00:00 2005 59 68 ACM Press koh39 http://www.citeulike.org/user/sora/article/991691 <i>Multimedia, IEEE Transactions on, Vol. 8, No. 5. (2006), pp. 1021-1032.</i><br /><br />Recent advances in information theory show that the throughput of a multicast session can be improved using network coding. In overlay networks, the available bandwidth between sender and different receivers are different. In this paper, we propose a solution to improve the throughput of an overlay multicast session with heterogeneous receivers by organizing the receivers into layered data distribution meshes and sending substreams to each mesh using layered coding. Our solutions utilize alternative paths and network coding in each mesh. We first formulate the problem into a mathematical programming, whose optimal solution requires global information. We therefore present a distributed heuristic algorithm. The heuristic progressively organizes the receivers into layered meshes. Each receiver can subscribe to a proper number of meshes to maximize its throughput by fully utilizing its available bandwidth. The benefits of organizing the topology into layered mesh and using network coding are demonstrated through extensive simulations. Numerical results indicate that the average throughput of a multicast session is significantly improved (up to 50% to 60%) with only slightly higher delay and network resource consumption. LION: Layered Overlay Multicast With Network Coding J Zhao F Yang Q Zhang Z Zhang F Zhang Multimedia, IEEE Transactions on, Vol. 8, No. 5. (2006), pp. 1021-1032. 2006-12-13T02:13:42-00:00 2006 Multimedia, IEEE Transactions on 8 5 1021 1032 koh39 http://www.citeulike.org/user/sora/article/989387 <i></i><br /><br />In large and constantly evolving networks, it is difficult to determine how the network is actually laid out. Yet this information is invaluable for network management, simulation, and server siting. Traditional topology discovery algorithms are based on SNMP, which is not universally deployed. We describe several heuristics and algorithms to discover both intra-domain and Internet backbone topology while making as few assumptions about the network as possible. We quantitatively evaluate their... Discovering internet topology R Siamwalla R Sharma S Keshav 2006-12-12T07:46:02-00:00 bgp measurement topology http://www.citeulike.org/user/sora/article/364678 <i>(2003)</i><br /><br />Researchers have shown that the Internet exhibits path inflation -- end-to-end paths can be significantly longer than necessary. We present a trace-driven study of 65 ISPs that characterizes the root causes of path inflation, namely topology and routing policy choices within an ISP, between pairs of ISPs, and across the global Internet. To do so, we develop and validate novel techniques to infer intra-domain and peering policies from end-to-end measurements. We provide the first measured... Quantifying the causes of path inflation N Spring R Mahajan T Anderson (2003) 2005-10-25T15:06:39-00:00 2003 no-tag http://www.citeulike.org/user/sora/article/694560 <i>(2002), pp. 231-236.</i> Inferring link weights using end-to-end measurements Ratul Mahajan Neil Spring David Wetherall Tom Anderson doi:10.1145/637201.637237 (2002), pp. 231-236. 2006-06-13T10:07:32-00:00 2002 231 236 ACM Press measurement topology http://www.citeulike.org/user/sora/article/671195 <i>INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, Vol. 1 (2003), pp. 156-165 vol.1.</i><br /><br />The problem of computing the types of the relationships between Internet autonomous systems is investigated. We refer to the model introduced in (ref.1), (ref.2) that bases the discovery of such relationships on the analysis of the AS paths extracted from the BGP routing tables. We characterize the time complexity of the above problem, showing both NP-completeness results and efficient algorithms for solving specific cases. Motivated by the hardness of the general problem, we propose heuristics based on a novel paradigm and show their effectiveness against publicly available data sets. The experiments put in evidence that our heuristics performs significantly better than state of the art heuristics. Computing the types of the relationships between autonomous systems G Di Battista M Patrignani M Pizzonia INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, Vol. 1 (2003), pp. 156-165 vol.1. 2006-05-26T10:45:46-00:00 2003 INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE 1 156 165 vol.1 bgp measurement topology http://www.citeulike.org/user/sora/article/623919 <i>Vol. 3503 (January 2005), pp. 113-125.</i> Inferring AS Relationships: Dead End or Lively Beginning? Xenofontas Dimitropoulos Dmitri Krioukov Bradley Huffaker Kc Claffy George Riley doi:10.1007/11427186_12 Vol. 3503 (January 2005), pp. 113-125. 2006-05-11T21:29:08-00:00 2005 3503 113 125 bgp geo measurement topology http://www.citeulike.org/user/sora/article/658764 <i></i><br /><br />Information about the geographic locality of IP prefixes can be useful for understanding the issues related to IP address allocation, aggregation, and BGP routing table growth. In this paper, we use traceroute data and geographic mappings of IP addresses to study the geographic properties of IP prefixes and their implications on Internet routing. We find that (1) IP prefixes may be too coarsegrained for expressing routing policies, (2) address allocation policies and the granularity of routing... Geographic Locality of IP Prefixes Michael Mythili 2006-05-20T08:28:47-00:00 bgp geo measurement topology http://www.citeulike.org/user/sora/article/208332 <i>SIGCOMM Comput. Commun. Rev., Vol. 34, No. 4. (October 2004), pp. 15-26.</i> Vivaldi: a decentralized network coordinate system Frank Dabek Russ Cox Frans Kaashoek Robert Morris doi:10.1145/1030194.1015471 SIGCOMM Comput. Commun. Rev., Vol. 34, No. 4. (October 2004), pp. 15-26. 2005-05-23T04:17:00-00:00 2004 SIGCOMM Comput. Commun. Rev. 0146-4833 34 4 15 26 ACM Press measurement topology http://www.citeulike.org/user/sora/article/658762 <i>SIGCOMM Comput. Commun. Rev., Vol. 34, No. 1. (January 2004), pp. 3-8.</i> Reverse engineering the Internet Neil Spring David Wetherall Thomas Anderson doi:10.1145/972374.972376 SIGCOMM Comput. Commun. Rev., Vol. 34, No. 1. (January 2004), pp. 3-8. 2006-05-20T08:22:39-00:00 2004 SIGCOMM Comput. Commun. Rev. 0146-4833 34 1 3 8 ACM Press measurement topology http://www.citeulike.org/user/sora/article/658753 <i>SIGCOMM Comput. Commun. Rev., Vol. 35, No. 1. (January 2005), pp. 93-97.</i> An empirical evaluation of internet latency expansion Hui Zhang Ashish Goel Ramesh Govindan doi:10.1145/1052812.1052814 SIGCOMM Comput. Commun. Rev., Vol. 35, No. 1. (January 2005), pp. 93-97. 2006-05-20T07:50:46-00:00 2005 SIGCOMM Comput. Commun. Rev. 0146-4833 35 1 93 97 ACM Press delay measurement topology http://www.citeulike.org/user/sora/article/658752 <i>Selected Areas in Communications, IEEE Journal on, Vol. 21, No. 6. (2003), pp. 934-948.</i><br /><br />One relatively unexplored question about the Internet's physical structure concerns the geographical location of its components: routers, links, and autonomous systems (ASes). We study this question using two large inventories of Internet routers and links, collected by different methods and about two years apart. We first map each router to its geographical location using two different state-of-the-art tools. We then study the relationship between router location and population density; between geographic distance and link density; and between the size and geographic extent of ASes. Our findings are consistent across the two datasets and both mapping methods. First, as expected, router density per person varies widely over different economic regions; however, in economically homogeneous regions, router density shows a strong superlinear relationship to population density. Second, the probability that two routers are directly connected is strongly dependent on distance; our data is consistent with a model in which a majority (up to 75%-95%) of link formation is based on geographical distance (as in the Waxman (1988) topology generation method). Finally, we find that ASes show high variability in geographic size, which is correlated with other measures of AS size (degree and number of interfaces). Among small to medium ASes, ASes show wide variability in their geographic dispersal; however, all ASes exceeding a certain threshold in size are maximally dispersed geographically. These findings have many implications for the next generation of topology generators, which we envisage as producing router-level graphs annotated with attributes such as link latencies, AS identifiers, and geographical locations. On the geographic location of Internet resources A Lakhina JW Byers M Crovella I Matta Selected Areas in Communications, IEEE Journal on, Vol. 21, No. 6. (2003), pp. 934-948. 2006-05-20T07:47:28-00:00 2003 Selected Areas in Communications, IEEE Journal on 21 6 934 948 geo measurement topology http://www.citeulike.org/user/sora/article/658751 <i>pp. 1-12.</i><br /><br />We have been collecting and recording routing paths from a test host to each of over 90,000 registered networks on the Internet since August 1998. The resulting database contains interesting routing and reachability information, and is available to the public for research purposes. The daily scans cover approximately a tenth of the networks on the Internet, with a full scan run roughly once a month. We have also been collecting Lucent's intranet data, and applied these tools to... Mapping and Visualizing the Internet Bill Cheswick Hal Burch Steve Branigan pp. 1-12. 2006-05-20T07:22:26-00:00 1 12 measurement topology http://www.citeulike.org/user/sora/article/658750 <i></i><br /><br />In this paper, we study the geographic properties of Internet routing. Our work is distinguished from previous studies of Internet routing in that we consider the geographic path traversed by packets, not just the network path. We examine several geographic properties including how circuitous Internet routes tend to be, how multiple ISPs along an end-to-end path share the burden of routing packets, and how much sharing there is between paths at the geographic level. We evaluate these properties ... Geographic Properties of Internet Routing: Analysis and Implications Lakshminarayanan Venkata 2006-05-20T06:57:39-00:00 bgp geo measurement topology http://www.citeulike.org/user/sora/article/658749 <i>(March 2000), pp. 1371-1380.</i><br /><br />Mercator is a program that uses hop-limited probes---the same primitive used in traceroute---to infer an Internet map. It uses informed random address probing to carefully exploring the IP address space when determining router adjacencies, uses source-route capable routers wherever possible to enhance the fidelity of the resulting map, and employs novel mechanisms for resolving aliases (interfaces belonging to the same router). This paper describes the design of these heuristics and our... Heuristics for Internet Map Discovery Ramesh Govindan Hongsuda Tangmunarunkit (March 2000), pp. 1371-1380. 2006-05-20T06:56:18-00:00 2000 1371 1380 geo measurement topology http://www.citeulike.org/user/sora/article/658748 <i>(2002)</i><br /><br />To date, realistic ISP topologies have not been accessible to the research community, leaving work that depends on topology on an uncertain footing. In this paper, we present new Internet mapping techniques that have enabled us to measure router-level ISP topologies. Our techniques reduce the number of required traces compared to a brute-force, all-to-all approach by three orders of magnitude without a significant loss in accuracy. They include the use of BGP routing tables to focus the... Measuring ISP Topologies with Rocketfuel N Spring R Mahajan D Wetherall (2002) 2006-05-20T06:41:41-00:00 2002 geo measurement topology http://www.citeulike.org/user/sora/article/626064 <i>Vol. 31, No. 4. (October 2001), pp. 173-185.</i> An investigation of geographic mapping techniques for internet hosts Venkata Padmanabhan Lakshminarayanan Subramanian doi:10.1145/383059.383073 Vol. 31, No. 4. (October 2001), pp. 173-185. 2006-05-13T15:43:50-00:00 2001 31 4 173 185 ACM Press geo measurement topology http://www.citeulike.org/user/sora/article/620115 <i>INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, Vol. 3 (2004), pp. 1797-1807 vol.3.</i><br /><br />We perform a detailed analysis of point-to-point packet delay in an operational tier-1 network. The point-to-point delay is the time between a packet entering a router in one PoP (an ingress point) and its leaving a router in another PoP (an egress point). It measures the one-way delay experienced by packets from an ingress point to an egress point across an ISP's network and provides the most basic information regarding the delay performance of the ISP's network. Using packet traces captured in the operational network, we obtain precise point-to-point packet delay measurements and analyze the various factors affecting them. Through a simple, step-by-step, systematic methodology and careful data analysis, we identify the major network factors that contribute to point-to-point packet delay and characterize their effect on the network delay performance. Our findings are: 1) delay distributions vary greatly in shape, depending on the path and link utilization; 2) after constant factors dependent only on the path and packet size are removed, the 99th percentile variable delay remains under 1 ms over several hops and under link utilization below 90% on a bottleneck; 3) a very small number of packets experience very large delay in short bursts. Analysis of point-to-point packet delay in an operational network BK Choi S Moon Zhi-Li Zhang K Papagiannaki C Diot INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, Vol. 3 (2004), pp. 1797-1807 vol.3. 2006-05-09T06:12:50-00:00 2004 INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies 3 1797 1807 vol.3 delay measurement topology http://www.citeulike.org/user/sora/article/616159 <i>(1997)</i> An Analysis of Internet Inter-Domain Topology and Route Stability R Govindan A Reddy (1997) 2006-05-07T10:20:14-00:00 1997 IEEE Computer Society bgp measurement topology http://www.citeulike.org/user/sora/article/606490 <i>(2001), pp. 736-742.</i><br /><br />The impact of routing policy on Internet paths is poorly understood. In theory, policy can inflate shortest-router-hop paths. To our knowledge, the extent of this inflation has not been previously examined. Using a simplified model of routing policy in the Internet, we obtain approximate indications of the impact of policy routing on Internet paths. Our findings suggest that routing policy does impact the length of Internet paths significantly. For instance, in our model of routing policy, some ... The Impact of Routing Policy on Internet Paths Hongsuda Tangmunarunkit Ramesh Govindan Scott Shenker Deborah Estrin (2001), pp. 736-742. 2006-04-29T18:45:56-00:00 2001 736 742 bgp measurement topology http://www.citeulike.org/user/sora/article/606489 <i>Applications and the Internet (SAINT) Workshops, 2002. Proceedings. 2002 Symposium on (2002), pp. 90-96.</i><br /><br />As the Internet has grown, so has the challenge of accurate measurement and modeling of its topology. Commonly used but coarse methods of measuring topology, e.g., BGP tables, suffer from several limitations. To pursue more accurate empirically-based topology modeling, in 1998 CAIDA began its Macroscopic Topology Project, which focuses on actively measuring topology and round trip time (RTT) information across a large cross-section of the commodity Internet. We describe CAIDA's topology measurement architecture and our analysis and visualization tools. We describe differences between IP and AS (BGP-based) granularities of topology modeling, including advantages and limitations of both, as well as how correlation between both types of data can yield more relevant insights. We introduce four new visualization metaphors for handling macroscopic topology data, as well as a tool for aggregating multiple IP addresses into the same physical router. We highlight results of our analyses, in particular relationships between RTT and topology data, and how source and destination selection and geopolitical boundaries affect those relationships Topology discovery by active probing B Huffaker D Plummer D Moore K Claffy Applications and the Internet (SAINT) Workshops, 2002. Proceedings. 2002 Symposium on (2002), pp. 90-96. 2006-04-29T18:43:26-00:00 2002 Applications and the Internet (SAINT) Workshops, 2002. Proceedings. 2002 Symposium on 90 96 bgp geo measurement topology http://www.citeulike.org/user/sora/article/80546 <i></i> How DNS Misnaming Distorts Internet Topology Mapping Ming Zhang Yaoping Ruan Vivek 2005-01-20T00:29:54-00:00 dns geo measurement http://www.citeulike.org/user/sora/article/606487 <i>INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Vol. 2 (2002), pp. 618-627 vol.2.</i><br /><br />The delivery of IP traffic through the Internet depends on the complex interactions between thousands of autonomous systems (AS) that exchange routing information using the border gateway protocol (BGP). This paper investigates the topological structure of the Internet in terms of customer-provider and peer-peer relationships between autonomous systems, as manifested in BGP routing policies. We describe a technique for inferring AS relationships by exploiting partial views of the AS graph available from different vantage points. Next we apply the technique to a collection of ten BGP routing tables to infer the relationships between neighboring autonomous systems. Based on these results, we analyze the hierarchical structure of the Internet and propose a five-level classification of AS. Our characterization differs from previous studies by focusing on the commercial relationships between autonomous systems rather than simply the connectivity between the nodes. Characterizing the Internet hierarchy from multiple vantage points L Subramanian S Agarwal J Rexford RH Katz INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Vol. 2 (2002), pp. 618-627 vol.2. 2006-04-29T18:17:12-00:00 2002 INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE 2 618 627 vol.2 bgp measurement http://www.citeulike.org/user/sora/article/606485 <i>IEEE/ACM Trans. Netw., Vol. 9, No. 6. (December 2001), pp. 733-745.</i> On inferring autonomous system relationships in the internet Lixin Gao doi:10.1109/90.974527 IEEE/ACM Trans. Netw., Vol. 9, No. 6. (December 2001), pp. 733-745. 2006-04-29T18:14:32-00:00 2001 IEEE/ACM Trans. Netw. 1063-6692 9 6 733 745 IEEE Press bgp measurement