Notice
There is currently an issue with the citation download feature. Learn more

IEEE/ACM Transactions on Networking

Issue 1 • Feb. 2005

Filter Results

Displaying Results 1 - 25 of 25
  • Table of contents

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

    Publication Year: 2005, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (24 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable packet classification

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

    Packet classification is important for applications such as firewalls, intrusion detection, and differentiated services. Existing algorithms for packet classification reported in the literature scale poorly in either time or space as filter databases grow in size. Hardware solutions such as TCAMs do not scale to large classifiers. However, even for large classifiers (say, 100 000 rules), any packe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms

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

    We clarify, extend, and solve a long-standing open problem concerning the computational complexity for packet scheduling algorithms to achieve tight end-to-end delay bounds. We first focus on the difference between the time a packet finishes service in a scheduling algorithm and its virtual finish time under a GPS (General Processor Sharing) scheduler, called GPS-relative delay. We prove that, und... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Defending against distributed denial-of-service attacks with max-min fair server-centric router throttles

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

    Our work targets a network architecture and accompanying algorithms for countering distributed denial-of-service (DDoS) attacks directed at an Internet server. The basic mechanism is for a server under stress to install a router throttle at selected upstream routers. The throttle can be the leaky-bucket rate at which a router can forward packets destined for the server. Hence, before aggressive pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Congestion control for high performance, stability, and fairness in general networks

    Publication Year: 2005, Page(s):43 - 56
    Cited by:  Papers (112)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB) | HTML iconHTML

    This paper is aimed at designing a congestion control system that scales gracefully with network capacity, providing high utilization, low queueing delay, dynamic stability, and fairness among users. The focus is on developing decentralized control laws at end-systems and routers at the level of fluid-flow models, that can provably satisfy such properties in arbitrary networks, and subsequently ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Queueing properties of feedback flow control systems

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

    In this paper, we consider a network with both controllable and uncontrollable flows. Uncontrollable flows are typically generated from applications with stringent QoS requirements and are given high priority. On the other hand, controllable flows are typically generated by elastic applications and can adapt to the available link capacities in the network. We provide a general model of such a syst... View full abstract»

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

    Publication Year: 2005, Page(s):69 - 80
    Cited by:  Papers (16)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB) | HTML iconHTML

    This paper generalizes the TCP Vegas congestion avoidance mechanism and uses accumulation , buffered packets of a flow inside network routers, as a congestion measure based on which a family of congestion control schemes can be derived. We call this model Accumulation-based Congestion Control (ACC), which fits into the nonlinear optimization framework proposed by Kelly. The ACC model serves as a r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robustness of real and virtual queue-based active queue management schemes

    Publication Year: 2005, Page(s):81 - 93
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    In this paper, we evaluate the performance of both real and virtual queue-based marking schemes designed for use at routers in the Internet. Using fluid flow models, we show via analysis and simulations that Virtual Queue (VQ)-based marking schemes outperform Real Queue (RQ)-based marking schemes in terms of robustness to disturbances and the ability to maintain low queueing delays. In fact, we pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive nonlinear congestion controller for a differentiated-services framework

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

    The growing demand of computer usage requires efficient ways of managing network traffic in order to avoid or at least limit the level of congestion in cases where increases in bandwidth are not desirable or possible. In this paper we developed and analyzed a generic Integrated Dynamic Congestion Control (IDCC) scheme for controlling traffic using information on the status of each queue in the net... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of TCP congestion control with explicit rate feedback

    Publication Year: 2005, Page(s):108 - 120
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB) | HTML iconHTML

    We consider a modification of TCP congestion control in which the congestion window is adapted to explicit bottleneck rate feedback; we call this RATCP (Rate Adaptive TCP). Our goal in this paper is to study and compare the performance of RATCP and TCP in various network scenarios with a view to understanding the possibilities and limits of providing better feedback to TCP than just implicit feedb... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fair distributed congestion control in multirate multicast networks

    Publication Year: 2005, Page(s):121 - 133
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB) | HTML iconHTML

    We study fairness of resource allocation in multirate, multicast networks. In multirate networks, different receivers of the same multicast session can receive service at different rates. We develop a mathematical framework to model the maxmin fair allocation of bandwidth with minimum and maximum rate constraints. We present a necessary and sufficient condition for a rate allocation to be maxmin f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource-aware conference key establishment for heterogeneous networks

    Publication Year: 2005, Page(s):134 - 146
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (589 KB) | HTML iconHTML

    The Diffie-Hellman problem is often the basis for establishing conference keys. In heterogeneous networks, many conferences have participants of varying resources, yet most conference keying schemes do not address this concern and place the same burden upon less powerful clients as more powerful ones. The establishment of conference keys should minimize the burden placed on resource-limited users ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A cone-based distributed topology-control algorithm for wireless multi-hop networks

    Publication Year: 2005, Page(s):147 - 159
    Cited by:  Papers (154)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB) | HTML iconHTML

    The topology of a wireless multi-hop network can be controlled by varying the transmission power at each node. In this paper, we give a detailed analysis of a cone-based distributed topology-control (CBTC) algorithm. This algorithm does not assume that nodes have GPS information available; rather it depends only on directional information. Roughly speaking, the basic idea of the algorithm is that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the scalability of network management information for inter-domain light-path assessment

    Publication Year: 2005, Page(s):160 - 172
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB) | HTML iconHTML

    We investigate the necessary amount of network management information for light-path assessment to dynamically set up end-to-end light-paths across administrative domains in optical networks. Our focus is on the scalability of partial management information. We pose light-path assessment as a decision problem, and define the performance as the Bayes probability of an erroneous decision. We then ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient routing and wavelength assignment for reconfigurable WDM ring networks with wavelength converters

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

    We consider the problem of wavelength assignment in reconfigurable WDM networks with wavelength converters. We show that for N-node P-port bidirectional rings, a minimum number of ┌PN/4┐ wavelengths are required to support all possible connected virtual topologies in a rearrang... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of blocking probability for distributed lightpath establishment in WDM optical networks

    Publication Year: 2005, Page(s):187 - 197
    Cited by:  Papers (55)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB) | HTML iconHTML

    In this paper, we analyze the blocking probability of distributed lightpath establishment in wavelength-routed WDM networks by studying the two basic methods: destination-initiated reservation (DIR) and source-initiated reservation (SIR). We discuss three basic types of connection blocking: 1) blocking due to insufficient network capacity; 2) blocking due to outdated information; and 3) blocking d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximating optimal spare capacity allocation by successive survivable routing

    Publication Year: 2005, Page(s):198 - 211
    Cited by:  Papers (79)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1256 KB) | HTML iconHTML

    The design of survivable mesh based communication networks has received considerable attention in recent years. One task is to route backup paths and allocate spare capacity in the network to guarantee seamless communications services survivable to a set of failure scenarios. This is a complex multi-constraint optimization problem, called the spare capacity allocation (SCA) problem. This paper unr... View full abstract»

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

    Publication Year: 2005, Page(s):212 - 216
    Request permission for commercial reuse | PDF file iconPDF (157 KB)
    Freely Available from IEEE
  • Quality without compromise [advertisement]

    Publication Year: 2005, Page(s): 217
    Request permission for commercial reuse | PDF file iconPDF (319 KB)
    Freely Available from IEEE
  • IEEE order form for reprints

    Publication Year: 2005, Page(s): 218
    Request permission for commercial reuse | PDF file iconPDF (378 KB)
    Freely Available from IEEE
  • IEEE copyright form

    Publication Year: 2005, Page(s):219 - 220
    Request permission for commercial reuse | PDF file iconPDF (1058 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 (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
Eytan Modiano
Laboratory for Information and Decision Systems
Massachusetts Institute of Technology