By Topic

IEEE/ACM Transactions on Networking

Issue 6 • Dec. 2004

Filter Results

Displaying Results 1 - 20 of 20
  • Table of contents

    Publication Year: 2004, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (454 KB)
    Freely Available from IEEE
  • IEEE/ACM Transactions on Networking publication information

    Publication Year: 2004, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (34 KB)
    Freely Available from IEEE
  • Packet-dispersion techniques and a capacity-estimation methodology

    Publication Year: 2004, Page(s):963 - 977
    Cited by:  Papers (157)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB) | HTML iconHTML

    The packet-pair technique aims to estimate the capacity of a path (bottleneck bandwidth) from the dispersion of two equal-sized probing packets sent back to back. It has been also argued that the dispersion of longer packet bursts (packet trains) can estimate the available bandwidth of a path. This paper examines such packet-pair and packet-train dispersion techniques in depth. We first demonstrat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network tomography from measured end-to-end delay covariance

    Publication Year: 2004, Page(s):978 - 992
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB) | HTML iconHTML

    End-to-end measurement is a common tool for network performance diagnosis, primarily because it can reflect user experience and typically requires minimal support from intervening network elements. However, pinpointing the site of performance degradation from end-to-end measurements is a challenging problem. We show how end-to-end delay measurements of multicast traffic can be used to infer the un... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Big-bang simulation for embedding network distances in Euclidean space

    Publication Year: 2004, Page(s):993 - 1006
    Cited by:  Papers (51)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1072 KB) | HTML iconHTML

    Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selection, and application level routing. We propose a new graph embedding scheme called Big-Bang Simulation (BBS), which simulates an explosion of particles under a force field derived from embedding error. BBS is shown to be signif... 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 the web

    Publication Year: 2004, Page(s):1007 - 1020
    Cited by:  Papers (5)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    Today's HTTP carries Web interactions over client-initiated TCP connections. An important implication of using this transport method is that interception caches in the network violate the end-to-end principle of the Internet, which severely limits deployment options of these caches. Furthermore, while an increasing number of Web interactions are short, and in fact frequently carry only control inf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The predictive user mobility profile framework for wireless multimedia networks

    Publication Year: 2004, Page(s):1021 - 1035
    Cited by:  Papers (100)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB) | HTML iconHTML

    User mobility profile (UMP) is a combination of historic records and predictive patterns of mobile terminals, which serve as fundamental information for mobility management and enhancement of quality of service (QoS) in wireless multimedia networks. In this paper, a UMP framework is developed for estimating service patterns and tracking mobile users, including descriptions of location, mobility, a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchy schedule-sensing protocol for CDMA wireless data-centric networks with multiple packet collision and capture effect

    Publication Year: 2004, Page(s):1036 - 1048
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB) | HTML iconHTML

    This paper focuses on performance analysis of a CDMA wireless data network based on hierarchy schedule-sensing (HSS) protocol, in which a common-code permission frame beacon is used to schedule request transmissions to avoid packet collisions. To further reduce scheduling delay, hierarchical group-based coding is adopted in the scheme. The performance of such a network is evaluated considering pac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • URSA: ubiquitous and robust access control for mobile ad hoc networks

    Publication Year: 2004, Page(s):1049 - 1063
    Cited by:  Papers (132)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB) | HTML iconHTML

    Restricting network access of routing and packet forwarding to well-behaving nodes and denying access from misbehaving nodes are critical for the proper functioning of a mobile ad-hoc network where cooperation among all networking nodes is usually assumed. However, the lack of a network infrastructure, the dynamics of the network topology and node membership, and the potential attacks from inside ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient integration of multihop wireless and wired networks with QoS constraints

    Publication Year: 2004, Page(s):1064 - 1078
    Cited by:  Papers (73)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB) | HTML iconHTML

    This study considers the problem of designing an efficient and low-cost infrastructure for connecting static multihop wireless networks with wired backbone, while ensuring QoS requirements such as bandwidth and delay. This infrastructure is useful for designing low-cost and fast deployed access networks in rural and suburban areas. It may also be used for providing access to sensor networks or for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlinear instabilities in TCP-RED

    Publication Year: 2004, Page(s):1079 - 1092
    Cited by:  Papers (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (976 KB) | HTML iconHTML

    This work develops a discrete-time dynamical feedback system model for a simplified TCP network with RED control and provides a nonlinear analysis that can help in understanding observed parametric sensitivities. The model describes network dynamics over large parameter variations. The dynamical model is used to analyze the TCP-RED operating point and its stability with respect to various RED cont... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The variation of optimal bandwidth and buffer allocation with the number of sources

    Publication Year: 2004, Page(s):1093 - 1104
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB) | HTML iconHTML

    We consider a single node which multiplexes a large number of traffic sources. We ask a simple question: how do the optimal allocations of bandwidth and buffer vary with the number of sources? We investigate this issue using previous results on the probability of overflow for an aggregate of i.i.d. flows, e.g., overflow resulting from effective bandwidth models. We wish to determine the variation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

    Publication Year: 2004, Page(s):1105 - 1118
    Cited by:  Papers (71)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB) | HTML iconHTML

    This paper focuses on the problem of dynamic survivable routing for segment shared protection (SSP) in mesh communication networks provisioning bandwidth guaranteed tunnels. With SSP, a connection is settled by concatenating a series of protection domains, each of which contains a working and protection segment pair behaving as a self-healing unit for performing local restoration whenever the work... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Loopback recovery from double-link failures in optical mesh networks

    Publication Year: 2004, Page(s):1119 - 1130
    Cited by:  Papers (46)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB) | HTML iconHTML

    Network survivability is a crucial requirement in high-speed optical networks. Typical approaches of providing survivability have considered the failure of a single component such as a link or a node. We motivate the need for considering double-link failures and present three loopback methods for handling such failures. In the first two methods, two edge-disjoint backup paths are computed for each... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Underload instabilities in packet networks with flow schedulers

    Publication Year: 2004, Page(s):1131 - 1143
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB) | HTML iconHTML

    Instability in packet-switching networks is normally associated with overload conditions, since queueing network models show that, in simple configurations, only overload generates instability. However, some results showing that instability can happen also in underloaded queueing networks began to appear about a decade ago. Underload instabilities can be produced by: 1) customer routes that visit ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SRR: an O(1) time-complexity packet scheduler for flows in multiservice packet networks

    Publication Year: 2004, Page(s):1144 - 1155
    Cited by:  Papers (37)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB) | HTML iconHTML

    We present a novel fair queueing scheme, which we call Smoothed Round Robin (SRR). Ordinary round-robin schedulers are well known for the burstiness of their scheduling output. In order to overcome this problem, SRR codes the weights of the flows into binary vectors to form a Weight Matrix and then uses a Weight Spread Sequence (WSS), which is specially designed to distribute the output more evenl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal power and retransmission control policies for random access systems

    Publication Year: 2004, Page(s):1156 - 1166
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB) | HTML iconHTML

    We consider in this study dynamic control policies for slotted Aloha random access systems. New performance bounds are derived when random access is combined with power control for system optimization, and we establish the existence of optimal control approaches for such systems. We analyze throughput and delay when the number of backlogged users is known, where we can explicitly obtain optimal po... View full abstract»

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

    Publication Year: 2004, Page(s):1167 - 1178
    Cited by:  Papers (2)
    Request permission for commercial reuse | PDF file iconPDF (205 KB)
    Freely Available from IEEE
  • IEEE/ACM Transactions on Networking society information

    Publication Year: 2004, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (39 KB)
    Freely Available from IEEE
  • IEEE/ACM Transactions on Networking Information for authors

    Publication Year: 2004, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (30 KB)
    Freely Available from IEEE

Aims & Scope

The IEEE/ACM Transactions on Networking’s high-level objective is to publish high-quality, original research results derived from theoretical or experimental exploration of the area of communication/computer networking.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
R. Srikant
Dept. of Electrical & Computer Engineering
Univ. of Illinois at Urbana-Champaign