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
  • A viability analysis of cooperative proxy caching

    Publication Year: 2001, Page(s):1205 - 1214 vol.3
    Cited by:  Papers (23)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB) | HTML iconHTML

    Cooperating proxy caches are groups of HTTP proxy servers that share cached objects. This paper models the speedup in average user response time for proxy cooperation and derives expressions for the upper bound, a mesh organization, and a hierarchical organization. The expressions are parameterized using empirically determined hit rates and HTTP response times. Models account for overhead of diffe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Class-based cache management for dynamic Web content

    Publication Year: 2001, Page(s):1215 - 1224 vol.3
    Cited by:  Papers (20)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    Caching dynamic pages at a server site is beneficial in reducing server resource demands and it also helps dynamic page caching at proxy sites. Previous work has used fine-grain dependence graphs among individual dynamic pages and underlying data sets to enforce result consistency. This paper proposes a complementary solution for applications that require coarse-grain cache management. The key ide... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the sensitivity of Web proxy cache performance to workload characteristics

    Publication Year: 2001, Page(s):1225 - 1234 vol.3
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (358 KB) | HTML iconHTML

    This paper describes the design and use of a synthetic Web proxy workload generator (ProWGen) to investigate the sensitivity of proxy cache replacement policies to selected Web workload characteristics. Trace-driven simulations with synthetic workloads from ProWGen show the relative sensitivity of three popular cache replacement algorithms-LRU, LFU-aging and GD-size-to Zipf slope, temporal localit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A secure, publisher-centric Web caching infrastructure

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

    The current Web caching infrastructure, though it has a number of performance benefits for clients and network providers, does not meet publishers' requirements. We argue that to satisfy these requirements, caches should be enhanced in both the data and control planes. In the data plane, caches will dynamically generate content for clients by running code provided by publishers. In the control pla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study of networks simulation efficiency: fluid simulation vs. packet-level simulation

    Publication Year: 2001, Page(s):1244 - 1253 vol.3
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (251 KB) | HTML iconHTML

    Network performance evaluation through traditional packet-level simulation is becoming increasingly difficult as today's networks grow in scale along many dimensions. As a consequence, fluid simulation has been proposed to cope with the size and complexity of such systems. This study focuses on analyzing and comparing the relative efficiencies of fluid simulation and packet-level simulation for se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the limitations of the variance-time test for inference of long-range dependence

    Publication Year: 2001, Page(s):1254 - 1260 vol.3
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (193 KB) | HTML iconHTML

    The objective of this paper is to demonstrate the limitations of the variance-time (VT) test as a statistical tool for inferring long-range dependence (LRD) in network traffic. Since the early Bellcore studies, LRD has been in the center of a continuous debate within the teletraffic community. The controversy is typically focused on the utility of LRD models to predict the performance at network b... 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 (994 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.
  • 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 (246 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.
  • 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 (153 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.
  • Implementation and evaluation of the KOM RSVP engine

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

    We describe implementation aspects and performance results of an innovative and publicly available RSVP implementation. Much debate exists about the applicability of RSVP as a signalling protocol in the Internet, particularly for a large number of unicast flows. While there has been a significant amount of work published on the theoretical concepts of RSVP signalling and conjectures about its pres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MATE: MPLS adaptive traffic engineering

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

    Destination-based forwarding in traditional IP routers has not been able to take full advantage of multiple paths that frequently exist in Internet service provider networks. As a result, the networks may not operate efficiently, especially when the traffic patterns are dynamic. This paper describes a multipath adaptive traffic engineering mechanism, called MATE, which is targeted for switched net... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On retransmission schemes for real-time streaming in the Internet

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

    This paper presents a trace-driven simulation study of three classes of retransmission timeout (RTO) estimators in the context of low-bitrate real-time streaming over the Internet. We explore the viability of employing retransmission timeouts in NACK-based real-time streaming applications that support multiple retransmission attempts per lost packet. In such applications, real-time RTO estimation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Window-based congestion control with heterogeneous users

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

    We investigate the fundamental problem of achieving the system optimal rates, which maximize the total user utility, in a distributed network environment using only the information available at the end hosts. This is done by decomposing the overall system problem into subproblems for the network and for the individual users and introducing an incentive-compatible pricing scheme. The users are to s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A time scale decomposition approach to adaptive ECN marking

    Publication Year: 2001, Page(s):1330 - 1339 vol.3
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    Fair resource allocation in high-speed networks such as the Internet can be viewed as a constrained optimization program. Kelly and his co-workers have shown that an unconstrained penalty function formulation of this problem can be used to design congestion controllers that are stable. In this paper, we examine the question of providing feedback from the network such that the congestion controller... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aggregate flow control: improving assurances for differentiated services network

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

    The differentiated services architecture is a simple, but novel, approach for providing service differentiation in an IP network. However, there are various issues to be addressed before any sophisticated end-to-end services can be offered. This work proposes an aggregate flow control (AFC) technique with a Diffserv traffic conditioner to improve the bandwidth and delay assurance of differentiated... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State-dependent M/G/1 type queueing analysis for congestion control in data networks

    Publication Year: 2001, Page(s):1350 - 1359 vol.3
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (357 KB) | HTML iconHTML

    We study in this paper a TCP-like linear-increase multiplicative-decrease flow control mechanism. We consider congestion signals that arrive in batches according to a Poisson process. We focus on the case when the transmission rate cannot exceed a certain maximum value. We write the Kolmogorov equations and we use Laplace transforms to calculate the distribution of the transmission rate in the ste... 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 (444)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (297 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.
  • A self-coordinating approach to distributed fair queueing in ad hoc wireless networks

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

    Distributed fair queueing in shared-medium ad hoc wireless networks is non-trivial because of the unique design challenges in such networks, such as location-dependent contention, distributed nature of ad hoc fair queueing, channel spatial reuse, and scalability in the presence of node mobility. In this paper, we seek to devise new distributed, localized, scalable and efficient solutions to this p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coverage problems in wireless ad-hoc sensor networks

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

    Wireless ad-hoc sensor networks have recently emerged as a premier research topic. They have great long-term economic potential, ability to transform our lives, and pose many new system-building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as location, deployment, and tracking, are fundamental issues, in that many applications rely on them ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed topology control for power efficient operation in multihop wireless ad hoc networks

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

    The topology of wireless multihop ad hoc networks can be controlled by varying the transmission power of each node. We propose a simple distributed algorithm where each node makes local decisions about its transmission power and these local decisions collectively guarantee global connectivity. Specifically, based on the directional information, a node grows it transmission power until it finds a n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Refreshment policies for Web content caches

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

    Web content caches are often placed between end-users and origin servers as a mean to reduce server load, network usage, and ultimately, user-perceived latency. Cached objects typically have associated expiration times, after which they are considered stale and must be validated with a remote server (origin or another cache) before they can be sent to a client. A considerable fraction of cache hit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A randomized Web-cache replacement scheme

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

    The problem of document replacement in Web caches has received much attention in the literature research, and it has been shown that the eviction rule "replace the least recently used document" performs poorly in Web caches. Instead, it has been shown that using a combination of several criteria, such as the recentness and frequency of use, the size, and the cost of fetching a document, leads to a... 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 (46)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (419 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.
  • Pseudo-address generation algorithm of packet destinations for Internet performance simulation

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

    This paper investigates the stochastic property of the packet destinations and proposes an address generation algorithm which is applicable for describing various Internet access patterns. We assume that a stochastic process of Internet access satisfies the stationary condition and derive the fundamental structure of the address generation algorithm. The pseudo IP-address sequence generated from o... View full abstract»

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