By Topic

IEEE/ACM Transactions on Networking

Issue 2 • Date April 2004

Filter Results

Displaying Results 1 - 21 of 21
  • Table of contents

    Publication Year: 2004, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (428 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
  • Internet indirection infrastructure

    Publication Year: 2004, Page(s):205 - 218
    Cited by:  Papers (149)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB) | HTML iconHTML

    Attempts to generalize the Internet's point-to-point communication abstraction to provide services like multicast, anycast, and mobility have faced challenging technical problems and deployment barriers. To ease the deployment of such services, this paper proposes a general, overlay-based Internet Indirection Infrastructure (i3) that offers a rendezvous-based communication abstraction. Instead of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analyzing peer-to-peer traffic across large networks

    Publication Year: 2004, Page(s):219 - 232
    Cited by:  Papers (268)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB) | HTML iconHTML

    The use of peer-to-peer (P2P) applications is growing dramatically, particularly for sharing large video/audio files and software. In this paper, we analyze P2P traffic by measuring flow-level information collected at multiple border routers across a large ISP network, and report our investigation of three popular P2P systems-FastTrack, Gnutella, and Direct-Connect. We characterize the P2P traffic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficiently serving dynamic data at highly accessed web sites

    Publication Year: 2004, Page(s):233 - 246
    Cited by:  Papers (25)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB) | HTML iconHTML

    We present architectures and algorithms for efficiently serving dynamic data at highly accessed Web sites together with the results of an analysis motivating our design and quantifying its performance benefits. This includes algorithms for keeping cached data consistent so that dynamic pages can be cached at the Web server and dynamic content can be served at the performance level of static conten... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SCORE: a scalable communication protocol for large-scale virtual environments

    Publication Year: 2004, Page(s):247 - 260
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB) | HTML iconHTML

    This paper describes and analyzes SCORE, a scalable multicast-based communication protocol for large-scale virtual environments (LSVE) on the Internet. Today, many of these applications have to handle an increasing number of participants and deal with the difficult problem of scalability. We propose an approach at the transport layer, using multiple multicast groups and multiple agents. This appro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Protocol scrubbing: network security through transparent flow modification

    Publication Year: 2004, Page(s):261 - 273
    Cited by:  Papers (27)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    This paper describes the design and implementation of protocol scrubbers. Protocol scrubbers are transparent, interposed mechanisms for explicitly removing network scans and attacks at various protocol layers. The transport scrubber supports downstream passive network-based intrusion detection systems by converting ambiguous network flows into well-behaved flows that are unequivocally interpreted ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Congestion control for fair resource allocation in networks with multicast flows

    Publication Year: 2004, Page(s):274 - 285
    Cited by:  Papers (34)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB) | HTML iconHTML

    We consider the problem of congestion control in networks which support both multirate multicast sessions and unicast sessions. We present a decentralized algorithm which enables the different rate-adaptive receivers in different multicast sessions to adjust their rates to satisfy some fairness criterion. A one-bit ECN marking strategy to be used at the nodes is also proposed. The congestion-contr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive virtual queue (AVQ) algorithm for active queue management

    Publication Year: 2004, Page(s):286 - 299
    Cited by:  Papers (243)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB) | HTML iconHTML

    Virtual queue-based marking schemes have been recently proposed for Active Queue Management (AQM) in Internet routers. We consider a particular scheme, which we call the Adaptive Virtual Queue (AVQ), and study its following properties: its stability in the presence of feedback delays, its ability to maintain small queue lengths, and its robustness in the presence of extremely short flows (the so-c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Closed queueing network models of interacting long-lived TCP flows

    Publication Year: 2004, Page(s):300 - 311
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB) | HTML iconHTML

    This paper presents a new analytical model for the estimation of the performance of TCP connections. The model is based on the description of the behavior of TCP in terms of a closed queueing network. The model is very accurate, deriving directly from the finite state machine description of the protocol. The assessment of the accuracy of the analytical model is based on comparisons against detaile... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of a static pricing scheme for priority services

    Publication Year: 2004, Page(s):312 - 325
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    We analyze a static pricing scheme for priority services. Users are free to choose the priority of their traffic but are charged accordingly. Using a game theoretic framework, we study the case where users choose priorities to maximize their net benefit. For the single link case, we show that there always exists an equilibrium for the corresponding game; however, the equilibrium is not necessarily... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Providing absolute differentiated services for real-time applications in static-priority scheduling networks

    Publication Year: 2004, Page(s):326 - 339
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB) | HTML iconHTML

    In this paper, we propose and analyze a methodology for providing absolute differentiated services for real-time applications. We develop a method that can be used to derive delay bounds without specific information on flow population. With this new method, we are able to successfully employ a utilization-based admission control approach for flow admission. This approach does not require explicit ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource optimization in QoS multicast routing of real-time multimedia

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

    We consider a network design problem, where applications require various levels of Quality-of-Service (QoS) while connections have limited performance. Suppose that a source needs to send a message to a heterogeneous set of receivers. The objective is to design a low-cost multicast tree from the source that would provide the QoS levels (e.g., bandwidth) requested by the receivers. We assume that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhancing both network and user performance for networks supporting best effort traffic

    Publication Year: 2004, Page(s):349 - 360
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    With a view on improving user-perceived performance on networks supporting best effort flows, e.g., multimedia/data file transfers, we propose a family of bandwidth allocation criteria that depends on the residual work of on-going transfers. Analysis and simulations show that allocating bandwidth in this fashion can significantly improve the user-perceived delay, bit transmission delay, and throug... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fixed point approximation for multirate multihop loss networks with state-dependent routing

    Publication Year: 2004, Page(s):361 - 374
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    In this paper we consider a class of loss networks that have arbitrary topologies and routes of arbitrary length. Multiple traffic classes are present, each with different bandwidth requirement, and each routed according to a state-dependent routing scheme. In particular, we consider the least loaded routing method generalized to routes of arbitrary number of hops. The connection level performance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal virtual topologies for one-to-many communication in WDM paths and rings

    Publication Year: 2004, Page(s):375 - 383
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    In this paper we examine the problem of constructing optimal virtual topologies for one-to-many communication in optical networks employing wavelength-division multiplexing. A virtual topology is a collection of optical lightpaths embedded in a physical topology. A packet sent from the source node travels over one or more lightpaths en route to its destination. Within a lightpath, transmission is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blocking in all-optical networks

    Publication Year: 2004, Page(s):384 - 397
    Cited by:  Papers (64)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB) | HTML iconHTML

    We present an analytical technique of very low complexity, using the inclusion-exclusion principle of combinatorics, for the performance evaluation of all-optical, wavelength-division multiplexed networks with no wavelength conversion. The technique is a generalized reduced-load approximation scheme which is applicable to arbitrary topologies and traffic patterns. One of the main issues in computi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Explore IEL IEEE's most comprehensive resource [advertisement]

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

    Publication Year: 2004, Page(s):399 - 400
    Request permission for commercial reuse | PDF file iconPDF (1058 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 (37 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 (27 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