Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)

22-26 April 2001

Go

Filter Results

Displaying Results 1 - 25 of 66
  • IEEE INFOCOM 2001 - The Conference on Computer Communications - Twentieth Annual Joint Conference of the IEEE Computer and communications Societies [front matter]

    Publication Year: 2001, Page(s):i - xxvi
    Request permission for commercial reuse | PDF file iconPDF (164 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2001, Page(s):0_3 - 0_6
    Request permission for commercial reuse | PDF file iconPDF (36 KB)
    Freely Available from IEEE
  • Behavior of TCP-like elastic traffic at a buffered bottleneck router

    Publication Year: 2001, Page(s):1698 - 1705 vol.3
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    A major challenge in traffic modeling and performance analysis for the transmission control protocol (TCP) stems from the fact that the incoming traffic is not independent of the congestion level in the network. This paper investigates a queueing model where the traffic essentially shows ON/OFF characteristics, i.e. the number of active TCP connections of finite (probabilistic) duration varies as ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the performance of a dual round-robin switch

    Publication Year: 2001, Page(s):1688 - 1697 vol.3
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB) | HTML iconHTML

    The dual round-robin matching (DRRM) switch has a scalable, low complexity architecture which allows for an aggregate bandwidth exceeding 1 Tb/s using current CMOS technology. In this paper we prove that the DRRM switch can achieve 100% throughput under i.i.d. and uniform traffic. The DRRM is the first practical matching scheme for which this property has been proved. The performance of the DRRM s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Making parallel packet switches practical

    Publication Year: 2001, Page(s):1680 - 1687 vol.3
    Cited by:  Papers (45)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB) | HTML iconHTML

    A parallel packet switch (PPS) is a switch in which the memories run slower than the line rate. Arriving packets are spread (or load-balanced) packet-by-packet over multiple slower-speed packet switches. It is already known that with a speedup of S⩾2, a PPS can theoretically mimic a FCFS output-queued (OQ) switch. However, the theory relies on a centralized packet scheduling algorithm that is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing Web latency using reference point caching

    Publication Year: 2001, Page(s):1607 - 1616 vol.3
    Cited by:  Papers (2)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB) | HTML iconHTML

    To reduce Web access latencies, we propose a new paradigm for caching at the reference point of a document. If a document X is referred to from a document Y, information is cached at Y to reduce the latency of client accesses to X. We focus on two specific instances of this paradigm: caching IP addresses to avoid DNS lookups at clients, and caching information about documents to avoid setting up n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achieving stability in networks of input-queued switches

    Publication Year: 2001, Page(s):1673 - 1679 vol.3
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB) | HTML iconHTML

    Recent research has generated many interesting results on scheduling input-queued switches. However, most of this work focuses on a single switch in isolation. In this paper we study the problem of scheduling a network of input-queued switches. We consider the longest-queue-first and longest-port-first protocols that are stable for a single switch and show that they can be unstable even for a fixe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A control theoretic analysis of RED

    Publication Year: 2001, Page(s):1510 - 1519 vol.3
    Cited by:  Papers (342)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB) | HTML iconHTML

    We use a previously developed nonlinear dynamic model of TCP to analyze and design active queue management (AQM) control systems using random early detection (RED). First, we linearize the interconnection of TCP and a bottlenecked queue and discuss its feedback properties in terms of network parameters such as link capacity, load and round-trip time. Using this model, we next design an AQM control... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DHTTP: an efficient and cache-friendly transfer protocol for Web traffic

    Publication Year: 2001, Page(s):1597 - 1606 vol.3
    Cited by:  Papers (7)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB) | HTML iconHTML

    Today's Web interactions are frequently short, with an increasing number of responses carrying only control information and no data. While HTTP uses client-initiated TCP for all Web interactions, TCP is not always well-suited for short interactions. Furthermore, client-initiated TCP handicaps the deployment of interception caches in the network because of the possibility of disrupted connections w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measuring service in multi-class networks

    Publication Year: 2001, Page(s):1281 - 1289 vol.3
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB) | HTML iconHTML

    Quality of service mechanisms and differentiated service classes are increasingly available in networks and servers. While network clients can assess their service by measuring basic performance parameters such as packet loss and delay, such measurements do not expose the network's core QoS functionality. We develop a framework and methodology for enabling network clients to assess a system's mult... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the throughput of input-queued cell-based switches with multicast traffic

    Publication Year: 2001, Page(s):1664 - 1672 vol.3
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    In this paper we discuss the throughput achievable in input-queued cell-based switches loaded with multicast traffic. The switch architecture is assumed to comprise a synchronous broadcast switching fabric, where fixed-size data units, called cells, can be transferred in one slot from one Input to any set of outputs. The switch scheduler must select the time slots for transfers of non-conflicting ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Delay jitter bounds and packet scale rate guarantee for expedited forwarding

    Publication Year: 2001, Page(s):1502 - 1509 vol.3
    Cited by:  Papers (15)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB) | HTML iconHTML

    We consider the definition of the expedited forwarding per-hop behaviour (EF PHB) as given in RFC 2598 (Jacobsen et al. 1999), and its impact on worst case end-to-end delay jitter. On one hand, the definition in RFC 2598 can be used to predict extremely low end-to-end delay jitter, independent of the network scale. On the other hand, we find that the worst case delay jitter can be made arbitrarily... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the placement of Web server replicas

    Publication Year: 2001, Page(s):1587 - 1596 vol.3
    Cited by:  Papers (155)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB) | HTML iconHTML

    There has been an increasing deployment of content distribution networks (CDNs) that offer hosting services to Web content providers. CDNs deploy a set of servers distributed throughout the Internet and replicate provider content across these servers for better performance and availability than centralized provider servers. Existing work on CDNs has primarily focused on techniques for efficiently ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Congestion control via online sampling

    Publication Year: 2001, Page(s):1271 - 1280 vol.3
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB) | HTML iconHTML

    We consider the congestion control problem in a communication network with multiple traffic sources, each modeled as a fully-controllable stream of fluid traffic. The controlled traffic shares a common bottleneck node with high-priority cross traffic described by a Markov-modulated fluid (MMF). Each controlled source is assumed to have a unique round-trip delay. We wish to maximize a linear combin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-demand QoS routing in multihop mobile networks

    Publication Year: 2001, Page(s):1735 - 1744 vol.3
    Cited by:  Papers (54)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (148 KB) | HTML iconHTML

    The emergence of nomadic applications have generated a lot of interest in next generation wireless network infrastructures which provide differentiated service classes. So it is important to study how the quality of service (QoS) should be guaranteed. To accomplish this, we develop an admission control scheme which can guarantee bandwidth for real-time applications in multihop mobile networks. In ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the effectiveness of DNS-based server selection

    Publication Year: 2001, Page(s):1801 - 1810 vol.3
    Cited by:  Papers (80)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB) | HTML iconHTML

    The rapid growth of the Internet in users and content has fueled extensive efforts to improve the user's overall Internet experience. A growing number of providers deliver content from multiple servers or proxies to reduce response time by moving content closer to end users. An increasingly popular mechanism to direct clients to the closest point of service is DNS-based redirection, due to its tra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobility increases the capacity of ad-hoc wireless networks

    Publication Year: 2001, Page(s):1360 - 1369 vol.3
    Cited by:  Papers (405)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    The capacity of ad-hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad-hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convex position estimation in wireless sensor networks

    Publication Year: 2001, Page(s):1655 - 1663 vol.3
    Cited by:  Papers (603)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    A method for estimating unknown node positions in a sensor network based exclusively on connectivity-induced constraints is described. Known peer-to-peer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem for these constraints yields estimates for the unknown positions of the nodes in the network. Providing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achieving end-to-end delay bounds by EDF scheduling without traffic shaping

    Publication Year: 2001, Page(s):1493 - 1501 vol.3
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB) | HTML iconHTML

    Earliest deadline first scheduling with per-node traffic shaping (RC-EDF) has the largest schedulable region among all practical policies known today and has been considered a good solution for providing end-to-end packet delay bounds. In order to harness the traffic burstiness inside a network to satisfy the schedulability condition of EDF, per-node traffic shaping has been believed to be necessa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed topology construction of Bluetooth personal area networks

    Publication Year: 2001, Page(s):1577 - 1586 vol.3
    Cited by:  Papers (147)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB) | HTML iconHTML

    Wireless ad hoc networks have been a growing area of research. While there has been considerable research on the topic of routing in such networks, the topic of topology creation has not received due attention. This is because almost all ad hoc networks to date have been built on top of a single channel, broadcast based wireless media, such as 802.11 or IR LANs. For such networks the distance rela... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DBASE: a distributed bandwidth allocation/sharing/extension protocol for multimedia over IEEE 802.11 ad hoc wireless LAN

    Publication Year: 2001, Page(s):1558 - 1567 vol.3
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB) | HTML iconHTML

    In ad hoc networks, carrier sense multiple access (CSMA) is one of the most pervasive medium access control (MAC) schemes for asynchronous data traffic. However, CSMA could not guarantee the quality of real-time traffic. In this paper, we will propose a distributed bandwidth allocation/sharing/extension (DBASE) protocol to support multimedia traffics with the characteristics of variable bit rate (... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithmic solution to second-order fluid flow

    Publication Year: 2001, Page(s):1261 - 1270 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB) | HTML iconHTML

    We develop a numerically stable algorithm for the solution of a general fluid-flow model in steady-state. The fluid dynamics is modulated by a semi-Markov process, with phase-type distributions for the sojourn times. We use an algorithmic solution to examine the impact of variance in the case of homogeneous on-off sources, and differences between the infinite and finite buffer case. The need for t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and design of hierarchical Web caching systems

    Publication Year: 2001, Page(s):1416 - 1424 vol.3
    Cited by:  Papers (39)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB) | HTML iconHTML

    This paper aims at finding fundamental design principles for hierarchical Web caching. An analytical modeling technique is developed to characterize an uncooperative two-level hierarchical caching system where the least recently used (LRU) algorithm is locally run at each cache. With this modeling technique, we are able to identify a characteristic time for each cache, which plays a fundamental ro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On designing improved controllers for AQM routers supporting TCP flows

    Publication Year: 2001, Page(s):1726 - 1734 vol.3
    Cited by:  Papers (367)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (940 KB) | HTML iconHTML

    In this paper we study a previously developed linearized model of TCP and active queue management (AQM). We use classical control system techniques to develop controllers well suited for the application. The controllers are shown to have better theoretical properties than the well known RED controller. We present guidelines for designing stable controllers subject to network parameters like load l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fuzzy buffer management scheme for ATM and IP networks

    Publication Year: 2001, Page(s):1539 - 1547 vol.3
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB) | HTML iconHTML

    We address the relevant issue of managing traffic flows with different priorities in packet switched networks, namely ATM and IP networks. We consider a reference model in which two traffic flows with different priorities are multiplexed within the buffer of a cell-based switch. The solution we propose, based on the fuzzy system theory, is able to guarantee the QoS requirements of high-priority tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.