Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleAugust 2003
A delay-tolerant network architecture for challenged internets
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 27–34https://doi.org/10.1145/863955.863960The highly successful architecture and protocols of today's Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory ...
- ArticleAugust 2003
Greening of the internet
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 19–26https://doi.org/10.1145/863955.863959In this paper we examine the somewhat controversial subject of energy consumption of networking devices in the Internet, motivated by data collected by the U.S. Department of Commerce. We discuss the impact on network protocols of saving energy by ...
- ArticleAugust 2003
Packet classification using multidimensional cutting
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 213–224https://doi.org/10.1145/863955.863980This paper introduces a classification algorithm called phHyperCuts. Like the previously best known algorithm, HiCuts, HyperCuts is based on a decision tree structure. Unlike HiCuts, however, in which each node in the decision tree represents a ...
- ArticleAugust 2003
A knowledge plane for the internet
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 3–10https://doi.org/10.1145/863955.863957We propose a new objective for network research: to build a fundamentally different sort of network that can assemble itself given high level instructions, reassemble itself as requirements change, automatically discover when something goes wrong, and ...
- ArticleAugust 2003
The impact of DHT routing geometry on resilience and proximity
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 381–394https://doi.org/10.1145/863955.863998The various proposed DHT routing algorithms embody several different underlying routing geometries. These geometries include hypercubes, rings, tree-like structures, and butterfly networks. In this paper we focus on how these basic geometric approaches ...
-
- ArticleAugust 2003
Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 313–324https://doi.org/10.1145/863955.863991Intra-domain traffic engineering can significantly enhance the performance of large IP backbone networks. Two important components of traffic engineering are understanding the traffic demandsand configuring the routing protocols. These two components ...
- ArticleAugust 2003
Towards an accurate AS-level traceroute tool
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 365–378https://doi.org/10.1145/863955.863996Traceroute is widely used to detect routing problems, characterize end-to-end paths, and discover the Internet topology. Providing an accurate list of the Autonomous Systems (ASes) along the forwarding path would make traceroute even more valuable to ...
- ArticleAugust 2003
Automatically inferring patterns of resource consumption in network traffic
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 137–148https://doi.org/10.1145/863955.863972The Internet service model emphasizes flexibility -- any node can send any type of traffic at any time. While this design has allowed new applications and usage models to flourish, it also makes the job of network management significantly more ...
- ArticleAugust 2003
An information-theoretic approach to traffic matrix estimation
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 301–312https://doi.org/10.1145/863955.863990Traffic matrices are required inputs for many IP network management tasks: for instance, capacity planning, traffic engineering and network reliability analysis. However, it is difficult to measure these matrices directly, and so there has been recent ...
- ArticleAugust 2003
Scaling internet routers using optics
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 189–200https://doi.org/10.1145/863955.863978Routers built around a single-stage crossbar and a centralized scheduler do not scale, and (in practice) do not provide the throughput guarantees that network operators need to make efficient use of their expensive long-haul links. In this paper we ...
- ArticleAugust 2003
Low-rate TCP-targeted denial of service attacks: the shrew vs. the mice and elephants
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 75–86https://doi.org/10.1145/863955.863966Denial of Service attacks are presenting an increasing threat to the global inter-networking infrastructure. While TCP's congestion control algorithm is highly robust to diverse network conditions, its implicit assumption of end-system cooperation ...
- ArticleAugust 2003
On selfish routing in internet-like environments
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 151–162https://doi.org/10.1145/863955.863974A recent trend in routing research is to avoid inefficiencies in network-level routing by allowing hosts to either choose routes themselves (e.g., source routing) or use overlay routing networks (e.g., Detour or RON). Such approaches result in selfish ...
- ArticleAugust 2003
Estimating flow distributions from sampled flow statistics
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 325–336https://doi.org/10.1145/863955.863992Passive traffic measurement increasingly employs sampling at the packet level. Many high-end routers form flow statistics from a sampled substream of packets. Sampling is necessary in order to control the consumption of resources by the measurement ...
- ArticleAugust 2003
A measurement-based analysis of multihoming
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 353–364https://doi.org/10.1145/863955.863995Multihoming has traditionally been employed by stub networks to enhance the reliability of their network connectivity. With the advent of commercial "intelligent route control" products, stubs now leverage multihoming to improve performance. Although ...
- ArticleAugust 2003
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 395–406https://doi.org/10.1145/863955.863999This paper examines graph-theoretic properties of existing peer-to-peer architectures and proposes a new infrastructure based on optimal diameter de Bruijn graphs. Since generalized de Bruijn graphs possess very short average routing distances and high ...
- ArticleAugust 2003
Forwarding in a content-based network
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 163–174https://doi.org/10.1145/863955.863975This paper presents an algorithm for content-based forwarding, an essential function in content-based networking. Unlike in traditional address-based unicast or multicast networks, where messages are given explicit destination addresses, the movement of ...
- ArticleAugust 2003
The causes of path inflation
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 113–124https://doi.org/10.1145/863955.863970Researchers 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 ...
- ArticleAugust 2003
Routing using potentials: a dynamic traffic-aware routing algorithm
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 37–48https://doi.org/10.1145/863955.863962We present a routing paradigm called PBR that utilizes steepest gradient search methods to route data packets. More specifically, the PBR paradigm assigns scalar potentials to network elements and forwards packets in the direction of maximum positive ...
- ArticleAugust 2003
A high-level programming environment for packet trace anonymization and transformation
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 339–351https://doi.org/10.1145/863955.863994Packet traces of operational Internet traffic are invaluable to network research, but public sharing of such traces is severely limited by the need to first remove all sensitive information. Current trace anonymization technology leaves only the packet ...
- ArticleAugust 2003
Longest prefix matching using bloom filters
SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communicationsAugust 2003, pp 201–212https://doi.org/10.1145/863955.863979We introduce the first algorithm that we are aware of to employ Bloom filters for Longest Prefix Matching (LPM). The algorithm performs parallel queries on Bloom filters, an efficient data structure for membership queries, in order to determine address ...