By Topic

IEEE/ACM Transactions on Networking

Issue 6 • Dec. 2005

Filter Results

Displaying Results 1 - 23 of 23
  • Table of contents

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

    Publication Year: 2005, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • Understanding Internet topology: principles, models, and validation

    Publication Year: 2005, Page(s):1205 - 1218
    Cited by:  Papers (64)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1152 KB) | HTML iconHTML

    Building on a recent effort that combines a first-principles approach to modeling router-level connectivity with a more pragmatic use of statistics and graph theory, we show in this paper that for the Internet, an improved understanding of its physical infrastructure is possible by viewing the physical connectivity as an annotated graph that delivers raw connectivity and bandwidth to the upper lay... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • What's new: finding significant differences in network data streams

    Publication Year: 2005, Page(s):1219 - 1232
    Cited by:  Papers (35)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB) | HTML iconHTML

    Monitoring and analyzing network traffic usage patterns is vital for managing IP Networks. An important problem is to provide network managers with information about changes in traffic, informing them about "what's new". Specifically, we focus on the challenge of finding significantly large differences in traffic: over time, between interfaces and between routers. We introduce the idea of a deltoi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic congestion-based pricing of bandwidth and buffer

    Publication Year: 2005, Page(s):1233 - 1246
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB) | HTML iconHTML

    We consider pricing of network resources in a reservation-based quality-of-service architecture. The pricing policy implements a distributed resource allocation to provide guaranteed bounds on packet loss and end-to-end delay for real-time applications. Distributed pricing roles are assigned to each user, each network node, and an arbitrager in between the user and the network. When delay constrai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IP easy-pass: a light-weight network-edge resource access control

    Publication Year: 2005, Page(s):1247 - 1260
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB) | HTML iconHTML

    Providing real-time communication services to multimedia applications and subscription-based Internet access often requires that sufficient network resources be reserved for real-time traffic. However, the reserved network resource is susceptible to resource theft and abuse. Without a resource access control mechanism that can efficiently differentiate legitimate real-time traffic from attacking p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A globally stable adaptive congestion control scheme for Internet-style networks with delay

    Publication Year: 2005, Page(s):1261 - 1274
    Cited by:  Papers (60)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB) | HTML iconHTML

    In this paper, we develop, analyze and implement a congestion control scheme in a noncooperative game framework, where each user's cost function is composed of a pricing function proportional to the queueing delay experienced by the user, and a fairly general utility function which captures the user demand for bandwidth. Using a network model based on fluid approximations and through a realistic m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate adaptive multimedia streams: optimization and admission control

    Publication Year: 2005, Page(s):1275 - 1288
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB) | HTML iconHTML

    This work investigates support of rate adaptive multimedia streams on communication networks. Optimal and practical mechanisms to maximize the customer average quality of service (QoS), defined in terms of a normalized time average received rate, are established. By scaling the arrival rate and link capacity, we obtain asymptotic expressions for customer average QoS in the case of networks with si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using partial differential equations to model TCP mice and elephants in large IP networks

    Publication Year: 2005, Page(s):1289 - 1301
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB) | HTML iconHTML

    In this paper we propose a new fluid model approach in which a different description of the dynamics of traffic sources is adopted, exploiting partial differential equations. This new description of the source dynamics allows the natural representation of short-lived as well as long-lived TCP connections, with no sacrifice in the scalability of the model. In addition, the use of partial differenti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A prediction-based link availability estimation for routing metrics in MANETs

    Publication Year: 2005, Page(s):1302 - 1312
    Cited by:  Papers (70)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB) | HTML iconHTML

    A Mobile Ad hoc Network (MANET) is a collection of wireless mobile terminals that are able to dynamically form a temporary network without any aid from fixed infrastructure or centralized administration. One critical issue for routing in MANETs is how to select reliable paths that can last as long as possible since terminal mobility may cause radio links to be broken frequently. To solve this prob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Localized topology control algorithms for heterogeneous wireless networks

    Publication Year: 2005, Page(s):1313 - 1324
    Cited by:  Papers (65)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB) | HTML iconHTML

    Most existing topology control algorithms assume homogeneous wireless networks with uniform maximal transmission power, and cannot be directly applied to heterogeneous wireless networks where the maximal transmission power of each node may be different. We present two localized topology control algorithms for heterogeneous networks: Directed Relative Neighborhood Graph (DRNG) and Directed Local Sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperation in wireless ad hoc networks: a market-based approach

    Publication Year: 2005, Page(s):1325 - 1338
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB) | HTML iconHTML

    We consider a market-based approach to stimulate cooperation in ad hoc networks where nodes charge a price for relaying data packets. Assuming that nodes set prices to maximize their own net benefit, we characterize the equilibria of the resulting market. In addition, we propose an iterative algorithm for the nodes to adapt their price and rate allocation, and study its convergence behavior. We us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatio-temporal sampling rates and energy efficiency in wireless sensor networks

    Publication Year: 2005, Page(s):1339 - 1352
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB) | HTML iconHTML

    A multi-hop network of wireless sensors can be used to gather spatio-temporal samples of a physical phenomenon and transmit these samples to a processing center. This paper addresses an important issue in the design of such networks: determining the spatio-temporal sampling rate of the network under conditions of minimum energy usage. A new collision-free protocol for gathering sensor data is used... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conflict detection and resolution in two-dimensional prefix router tables

    Publication Year: 2005, Page(s):1353 - 1363
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB) | HTML iconHTML

    We show that determining the minimum number of resolve filters that need to be added to a set of two-dimensional (2-D) prefix filters so that the filter set can implement a given policy using the first-matching-rule-in-table tie breaker is NP-hard. Additionally, we develop a fast O(nlogn+s) time, where n is the number of filters and s is the number of conflicts, plane-sweep algorithm to detect and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On guaranteed smooth scheduling for input-queued switches

    Publication Year: 2005, Page(s):1364 - 1375
    Cited by:  Papers (34)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB) | HTML iconHTML

    Input-queued switches are used extensively in the design of high-speed routers. As switch speeds and sizes increase, the design of the switch scheduler becomes a primary challenge, because the time interval for the matching computations needed for determining switch configurations becomes very small. Possible alternatives in scheduler design include increasing the scheduling interval by using enve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An estimator of regulator parameters in a stochastic setting

    Publication Year: 2005, Page(s):1376 - 1389
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB) | HTML iconHTML

    This paper develops a new network provisioning and resource allocation scheme. We introduce the concept of the effective burstiness curve (EBC), which is defined as a percentile of the maximum burstiness curve. For a fixed service rate, EBC represents the size of a buffer for which the probability of buffer overflow is arbitrarily small. We show that EBC is a convex nonincreasing function of the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cross-talk attack monitoring and localization in all-optical networks

    Publication Year: 2005, Page(s):1390 - 1401
    Cited by:  Papers (42)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB) | HTML iconHTML

    The effects of an attack connection can propagate quickly to different parts of an all-optical transparent network. Such attacks affect the normal traffic and can either cause service degradation or outright service denial. Quick detection and localization of an attack source can avoid losing large amounts of data in an all-optical network. Attack monitors can collect the information from connecti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical topological network design

    Publication Year: 2005, Page(s):1402 - 1409
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    We present a hierarchical solution method to approximately solve the topological network design problem: given positive integers (n,d,Δ), minimize the number of arcs required to interconnect n nodes, so that the network diameter does not exceed d, the maximum node degree does not exceed Δ, and the network is single node survivable. The method uses dynamic programming to piece together ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments and an improvement on "A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area Networks"

    Publication Year: 2005, Page(s):1410 - 1411
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (91 KB) | HTML iconHTML

    In this correspondence, we first point out an error in Jia's algorithm (1998) by a counterexample. Second, we provide a fix and make an improvement to the part of Dynamic-Join. Finally, we give an analysis and a correctness proof of our algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE order form for reprints

    Publication Year: 2005, Page(s): 1412
    Request permission for commercial reuse | PDF file iconPDF (354 KB)
    Freely Available from IEEE
  • 2005 Index

    Publication Year: 2005, Page(s):1413 - 1424
    Request permission for commercial reuse | PDF file iconPDF (186 KB)
    Freely Available from IEEE
  • IEEE/ACM Transactions on Networking society information

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

    Publication Year: 2005, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (29 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