By Topic

IEEE/ACM Transactions on Networking

Issue 3 • Date June 2006

Filter Results

Displaying Results 1 - 23 of 23
  • Table of contents

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

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (36 KB)
    Freely Available from IEEE
  • Locating mobile nodes with EASE: learning efficient routes from encounter histories alone

    Publication Year: 2006, Page(s):457 - 469
    Cited by:  Papers (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (939 KB) | HTML iconHTML

    Routing in large-scale mobile ad hoc networks is challenging because all the nodes are potentially moving. Geographic routing can partially alleviate this problem, as nodes can make local routing decisions based solely on the destinations' geographic coordinates. However, geographic routing still requires an efficient location service, i.e., a distributed database recording the location of every d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An opportunistic power control algorithm for cellular network

    Publication Year: 2006, Page(s):470 - 478
    Cited by:  Papers (38)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (613 KB) | HTML iconHTML

    We propose an opportunistic power control algorithm, which exploits channel fluctuation in order to maximize system throughput. The basic idea is that it instructs a transmitter to increase its power when the channel is good and to decrease its power when the channel is bad. The transmission rate is adjusted according to the received signal-to-interference ratio. The proposed algorithm is distribu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gossip-based ad hoc routing

    Publication Year: 2006, Page(s):479 - 491
    Cited by:  Papers (207)  |  Patents (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (642 KB) | HTML iconHTML

    Many ad hoc routing protocols are based on some variant of flooding. Despite various optimizations of flooding, many routing messages are propagated unnecessarily. We propose a gossiping-based approach, where each node forwards a message with some probability, to reduce the overhead of the routing protocols. Gossiping exhibits bimodal behavior in sufficiently large networks: in some executions, th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattice networks: capacity limits, optimal routing, and queueing behavior

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

    Lattice networks are widely used in regular settings like grid computing, distributed control, satellite constellations, and sensor networks. Thus, limits on capacity, optimal routing policies, and performance with finite buffers are key issues and are addressed in this paper. In particular, we study the routing algorithms that achieve the maximum rate per node for infinite and finite buffers in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pricing network resources for adaptive applications

    Publication Year: 2006, Page(s):506 - 519
    Cited by:  Papers (25)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (669 KB) | HTML iconHTML

    The Differentiated Services framework (DiffServ) has been proposed to provide multiple Quality of Service (QoS) classes over IP networks. A network supporting multiple classes of service also requires a differentiated pricing structure. In this work, we propose a pricing algorithm in a DiffServ environment based on the cost of providing different levels of services, and on long-term average user r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LSRP: local stabilization in shortest path routing

    Publication Year: 2006, Page(s):520 - 531
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (479 KB) | HTML iconHTML

    We formulate a notion of local stabilization, by which a system self-stabilizes in time proportional to the size of any perturbation that changes the network topology or the state of nodes. The notion implies that the part of the network involved in the stabilization includes at most the nodes whose distance from the perturbed nodes is proportional to the perturbation size. Also, we present LSRP, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Avoiding instability during graceful shutdown of multiple OSPF routers

    Publication Year: 2006, Page(s):532 - 542
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (661 KB) | HTML iconHTML

    Many recent router architectures decouple the routing engine from the forwarding engine, allowing packet forwarding to continue even when the routing process is not active. This opens up the possibility of using the forwarding capability of a router even when its routing process is brought down for software upgrade or maintenance, thus avoiding the route flaps that normally occur when the routing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental service deployment using the hop-by-hop multicast routing protocol

    Publication Year: 2006, Page(s):543 - 556
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1072 KB) | HTML iconHTML

    IP multicast is facing a slow take-off although it has been a hotly debated topic for more than a decade. Many reasons are responsible for this status. Hence, the Internet is likely to be organized with both unicast and multicast enabled networks. Thus, it is of utmost importance to design protocols that allow the progressive deployment of the multicast service by supporting unicast clouds. This p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On multicast trees: structure and size estimation

    Publication Year: 2006, Page(s):557 - 567
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (641 KB) | HTML iconHTML

    This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and real Internet data, we characterize the structure of such trees and show that they obey the rank-degree power law; that most high degree tree nodes are concentrated in a low diameter neighborhood; and that the sub-tree size also obey... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Congestion notification and probing mechanisms for endpoint admission control

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

    There has been much interest in admission control schemes that place the burden of admission control decisions on the end users. In these schemes, referred to as Endpoint Admission Control, the decision to join the network is taken by the user, based on the probing of the network using probe packets. Depending on the level of congestion, routers mark the probe packets and thus inform the user of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global stability of Internet congestion controllers with heterogeneous delays

    Publication Year: 2006, Page(s):579 - 590
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (713 KB) | HTML iconHTML

    In this paper, we study the problem of designing globally stable, scalable congestion control algorithms for the Internet. Prior work has primarily used linear stability as the criterion for such a design. Global stability has been studied only for single node, single source problems. Here, we obtain conditions for a general topology network accessed by sources with heterogeneous delays. We obtain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic packet marking for time-varying congestion price estimation

    Publication Year: 2006, Page(s):592 - 602
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (498 KB) | HTML iconHTML

    The addition of the two-bit Explicit Congestion Notification (ECN) field to the IP header provides routers with a mechanism for conveying link price information necessary for the successful operation of a number of congestion control schemes. Two recent proposals for probabilistic packet marking at the routers allow receivers to estimate path price from the fraction of marked packets. In this pape... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate-adaptive snoop: a TCP enhancement scheme over rate-controlled lossy links

    Publication Year: 2006, Page(s):603 - 615
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1172 KB) | HTML iconHTML

    We study TCP performance over the wireless links deploying a wireless rate-control technique, whose link characteristics are identified by variable link rate and bursty transmission error. We present a TCP enhancement scheme, called rate-adaptive snoop (RA-Snoop). RA-Snoop caches TCP packets selectively based on the wireless channel condition and the cached packets are retransmitted locally over t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A positive systems model of TCP-like congestion control: asymptotic results

    Publication Year: 2006, Page(s):616 - 629
    Cited by:  Papers (158)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (853 KB) | HTML iconHTML

    We study communication networks that employ drop-tail queueing and Additive-Increase Multiplicative-Decrease (AIMD) congestion control algorithms. It is shown that the theory of nonnegative matrices may be employed to model such networks. In particular, important network properties, such as: 1) fairness; 2) rate of convergence; and 3) throughput, can be characterized by certain nonnegative matrice... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Per-domain packet scale rate guarantee for expedited forwarding

    Publication Year: 2006, Page(s):630 - 643
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (545 KB) | HTML iconHTML

    The expedited forwarding per-hop behavior (EF PHB) was recently replaced by a new definition, called packet scale rate guarantee (PSRG), under the Differentiated Services (DiffServ) framework. This replacement raises two challenges. One is the implementation of a PSRG server. Another is the provision of per-domain PSRG. Specifically, for the former, an open issue is whether hierarchical schedulers... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Providing guaranteed rate services in the load balanced Birkhoff-von Neumann switches

    Publication Year: 2006, Page(s):644 - 656
    Cited by:  Papers (9)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (887 KB) | HTML iconHTML

    In this paper, we propose two schemes for the load balanced Birkhoff-von Neumann switches to provide guaranteed rate services. The first scheme is based on an earliest eligible time first (EETF) policy. In such a scheme, we assign every packet of a guaranteed rate flow a targeted departure time that is the departure time from the corresponding work conserving link with capacity equal to the guaran... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic inter-SLA resource sharing in path-oriented differentiated services networks

    Publication Year: 2006, Page(s):657 - 670
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (763 KB) | HTML iconHTML

    This paper proposes novel resource sharing schemes for differentiated services (DiffServ) networks, to achieve both high resource utilization and quality of service (QoS) guarantee. Service level agreements (SLAs) are negotiated at network boundaries and supported by path-oriented resource mapping within the network. The recently proposed SLA management scheme based on virtual partitioning (Bouill... 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: 2006, Page(s): 671
    Request permission for commercial reuse | PDF file iconPDF (354 KB)
    Freely Available from IEEE
  • Explore IEL IEEE's most comprehensive resource [advertisement]

    Publication Year: 2006, Page(s): 672
    Request permission for commercial reuse | PDF file iconPDF (341 KB)
    Freely Available from IEEE
  • IEEE/ACM Transactions on Networking society information

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