By Topic

IEEE/ACM Transactions on Networking

Issue 2 • Date April 2006

Filter Results

Displaying Results 1 - 24 of 24
  • Table of contents

    Publication Year: 2006, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (352 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 (37 KB)
    Freely Available from IEEE
  • Resilient multicast using overlays

    Publication Year: 2006, Page(s):237 - 248
    Cited by:  Papers (70)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB) | HTML iconHTML

    We introduce Probabilistic Resilient Multicast (PRM): a multicast data recovery scheme that improves data delivery ratios while maintaining low end-to-end latencies. PRM has both a proactive and a reactive components; in this paper we describe how PRM can be used to improve the performance of application-layer multicast protocols especially when there are high packet losses and host failures. Thro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of multicast protocols robust against inflated subscription

    Publication Year: 2006, Page(s):249 - 262
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB) | HTML iconHTML

    To disseminate data to a heterogeneous body of receivers efficiently,congestion control protocols for IP multicast compose a session from several multicast groups and prescribe guidelines that enable each receiver to subscribe to an appropriate subset of the groups. However, a misbehaving receiver can ignore the group subscription rules and inflate its subscription to acquire unfairly high through... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed collaborative key agreement and authentication protocols for dynamic peer Groups

    Publication Year: 2006, Page(s):263 - 276
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB) | HTML iconHTML

    We consider several distributed collaborative key agreement and authentication protocols for dynamic peer groups. There are several important characteristics which make this problem different from traditional secure group communication. They are: 1) distributed nature in which there is no centralized key server; 2) collaborative nature in which the group key is contributory (i.e., each group membe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of packet dispersion on voice applications in IP networks

    Publication Year: 2006, Page(s):277 - 288
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1792 KB) | HTML iconHTML

    Delivery of real time streaming applications, such as voice and video over IP, in packet switched networks is based on dividing the stream into packets and shipping each of the packets on an individual basis to the destination through the network. The basic implicit assumption on these applications is that shipping all the packets of an application is done, most of the time,over a single path alon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • WiFi access point pricing as a dynamic game

    Publication Year: 2006, Page(s):289 - 301
    Cited by:  Papers (39)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB) | HTML iconHTML

    We study the economic interests of a wireless access point owner and his paying client, and model their interaction as a dynamic game. The key feature of this game is that the players have asymmetric information - the client knows more than the access provider. We find that if a client has a "web browser" utility function (a temporal utility function that grows linearly), it is a Nash equilibrium ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The impact of imperfect scheduling on cross-Layer congestion control in wireless networks

    Publication Year: 2006, Page(s):302 - 315
    Cited by:  Papers (180)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    In this paper, we study cross-layer design for congestion control in multihop wireless networks. In previous work, we have developed an optimal cross-layer congestion control scheme that jointly computes both the rate allocation and the stabilizing schedule that controls the resources at the underlying layers. However, the scheduling component in this optimal cross-layer congestion control scheme ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatial correlation-based collaborative medium access control in wireless sensor networks

    Publication Year: 2006, Page(s):316 - 329
    Cited by:  Papers (124)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB) | HTML iconHTML

    Wireless Sensor Networks (WSN) are mainly characterized by dense deployment of sensor nodes which collectively transmit information about sensed events to the sink. Due to the spatial correlation between sensor nodes subject to observed events, it may not be necessary for every sensor node to transmit its data. This paper shows how the spatial correlation can be exploited on the Medium Access Cont... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks

    Publication Year: 2006, Page(s):330 - 340
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB) | HTML iconHTML

    We develop on-line routing and wavelength assignment (RWA) algorithms for WDM bidirectional ring and torus networks with N nodes. The algorithms dynamically support all k-allowable traffic matrices, where k denotes an arbitrary integer vector [k1, k2,... kN], and node i, 1 ≤ i ≤ N, can transmit at most ki wavelengths and receive at most k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Packet delay in optical circuit-switched networks

    Publication Year: 2006, Page(s):341 - 354
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    A framework is provided for evaluation of packet delay distribution in an optical circuit-switched network. The framework is based on a fluid traffic model, packet queueing at edge routers, and circuit-switched transmission between edge routers. Packets are assigned to buffers according to their destination, delay constraint, physical route and wavelength. At every decision epoch, a subset of buff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Counter-intuitive throughput behaviors in networks under end-to-end control

    Publication Year: 2006, Page(s):355 - 368
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB) | HTML iconHTML

    It has been shown that as long as traffic sources adapt their rates to aggregate congestion measure in their paths, they implicitly maximize certain utility. In this paper we study some counter-intuitive throughput behaviors in such networks, pertaining to whether a fair allocation is always inefficient and whether increasing capacity always raises aggregate throughput. A bandwidth allocation poli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new TCP for persistent packet reordering

    Publication Year: 2006, Page(s):369 - 382
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1328 KB) | HTML iconHTML

    Most standard implementations of TCP perform poorly when packets are reordered. In this paper, we propose a new version of TCP that maintains high throughput when reordering occurs and yet, when packet reordering does not occur, is friendly to other versions of TCP. The proposed TCP variant, or TCP-PR, does not rely on duplicate acknowledgments to detect a packet loss. Instead, timers are maintain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical analysis of TCP's retransmission timeout algorithm

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

    The retransmission timeout (RTO) algorithm of Transmission Control Protocol (TCP), which sets a dynamic upper bound on the next round-trip time (RTT) based on past RTTs, plays an important role in reliable data transfer and congestion control of the Internet. A rigorous theoretical analysis of the RTO algorithm is important in that it provides insight into the algorithm and prompts optimal design ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Longest prefix matching using bloom filters

    Publication Year: 2006, Page(s):397 - 409
    Cited by:  Papers (80)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    We introduce the first algorithm that we are aware of to employ Bloom filters for longest prefix matching (LPM). The algorithm performs parallel queries on Bloom filters, an efficient data structure for membership queries, in order to determine address prefix membership in sets of prefixes sorted by prefix length. We show that use of this algorithm for Internet Protocol (IP) routing lookups result... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the role and controllability of persistent clients in traffic aggregates

    Publication Year: 2006, Page(s):410 - 423
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB) | HTML iconHTML

    Flash crowd events (FCEs) present a real threat to the stability of routers and end-servers. Such events are characterized by a large and sustained spike in client arrival rates, usually to the point of service failure. Traditional rate-based drop policies, such as Random Early Drop (RED), become ineffective in such situations since clients tend to be persistent, in the sense that they make multip... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network protocol system monitoring-a formal approach with passive testing

    Publication Year: 2006, Page(s):424 - 437
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB) | HTML iconHTML

    We study network protocol system monitoring for fault detection using a formal technique of passive testing that is a process of detecting system faults by passively observing its input/output behaviors without interrupting its normal operations. After describing a formal model of event-driven extended finite state machines, we present two algorithms for passive testing of protocol system control ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient location area planning for personal communication systems

    Publication Year: 2006, Page(s):438 - 450
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB) | HTML iconHTML

    A central problem in personal communication systems is to optimize bandwidth usage, while providing Quality of Service (QoS) guarantees to mobile users. Network mobility management, and in particular, location management, consumes a significant portion of bandwidth, which is a necessary overhead for supporting mobile users. We focus our efforts on minimizing this overhead. Unlike previous works, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Modeling TCP reno performance: a simple model and its empirical Validation"

    Publication Year: 2006, Page(s):451 - 453
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (182 KB) | HTML iconHTML

    In this Comments, several errors in Padhye , 2000, are pointed out. The more serious of these errors result in an over prediction of the send rate. The expression obtained for send rate in this Comments leads to greater accuracy when compared with the measurement data than the originals end rate expression in Padhye et al. 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: 2006, Page(s): 454
    Request permission for commercial reuse | PDF file iconPDF (341 KB)
    Freely Available from IEEE
  • IEEE Member Digital Library [advertisement]

    Publication Year: 2006, Page(s): 455
    Request permission for commercial reuse | PDF file iconPDF (179 KB)
    Freely Available from IEEE
  • Celebrating the vitality of technology the Proceedings of the IEEE [advertisement]

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