IEEE/ACM Transactions on Networking

Filter Results

Displaying Results 1 - 24 of 24

Publication Year: 2008, Page(s): C1
| PDF (478 KB)
• IEEE/ACM Transactions on Networking publication information

Publication Year: 2008, Page(s): C2
| PDF (38 KB)

Publication Year: 2008, Page(s):253 - 266
Cited by:  Papers (16)
| | PDF (761 KB) | HTML

The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70% of the Internet's bandwidth usage. Measurement studies show that a typical download of a file can take from minutes up to several hours depending on the level of network congestion or the service capacity fluctuation. In this paper, we consider two major factors that have significant im... View full abstract»

• Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems

Publication Year: 2008, Page(s):267 - 280
Cited by:  Papers (101)
| | PDF (594 KB) | HTML

In recent years, peer-to-peer (P2P) file-sharing systems have evolved to accommodate growing numbers of participating peers. In particular, new features have changed the properties of the unstructured overlay topologies formed by these peers. Little is known about the characteristics of these topologies and their dynamics in modern file-sharing applications, despite their importance. This paper pr... View full abstract»

• Building Heterogeneous Peer-to-Peer Networks: Protocol and Analysis

Publication Year: 2008, Page(s):281 - 292
Cited by:  Papers (32)  |  Patents (1)
| | PDF (450 KB) | HTML

In this paper, we propose a simple protocol for building heterogeneous unstructured peer-to-peer (P2P) networks. The protocol consists of two parts-the joining process and the rebuilding process. The basic idea for the joining process is to use a random walk to assist new incoming peers in selecting their suitable neighbors in terms of capacity and connectivity to achieve load-balancing. The rebui... View full abstract»

Publication Year: 2008, Page(s):293 - 306
Cited by:  Papers (16)
| | PDF (1333 KB) | HTML

A novel scheme for processing packets in a router is presented that provides load sharing among multiple network processors distributed within the router. It is complemented by a feedback control mechanism designed to prevent processor overload. Incoming traffic is scheduled to multiple processors based on a deterministic mapping. The mapping formula is derived from the robust hash routing (also k... View full abstract»

• A Geometric Approach to Improving Active Packet Loss Measurement

Publication Year: 2008, Page(s):307 - 320
Cited by:  Papers (39)  |  Patents (1)
| | PDF (1021 KB) | HTML

Measurement and estimation of packet loss characteristics are challenging due to the relatively rare occurrence and typically short duration of packet loss episodes. While active probe tools are commonly used to measure packet loss on end-to-end paths, there has been little analysis of the accuracy of these tools or their impact on the network. The objective of our study is to understand how to me... View full abstract»

• Rate Allocation and Network Lifetime Problems for Wireless Sensor Networks

Publication Year: 2008, Page(s):321 - 334
Cited by:  Papers (53)
| | PDF (960 KB) | HTML

An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Since the objective of maximizing the sum of rates of all the nodes in the network can lead to a severe bias in rate allocation among the nodes, we advocate the use of lexicographical max-min (LMM) rate allocation. To calcul... View full abstract»

• Low Latency Wireless Ad Hoc Networking: Power and Bandwidth Challenges and a Solution

Publication Year: 2008, Page(s):335 - 346
Cited by:  Papers (5)
| | PDF (326 KB) | HTML

This paper is concerned with the scaling of the number of relay nodes (i.e., hops) individual messages have to transit through in a large-scale wireless ad hoc network (WANET); we call this hop-count as network latency (NL). A large network latency affects all aspects of data communication in a WANET, including an increase in delay, packet loss, and the power needed to process and store messages i... View full abstract»

• Asymptotic Critical Total Power for $k$ -Connectivity of Wireless Networks

Publication Year: 2008, Page(s):347 - 358
Cited by:  Papers (18)
| | PDF (475 KB) | HTML

An important issue in wireless ad hoc networks is to reduce the transmission power subject to certain connectivity requirement. In this paper, we study the fundamental scaling law of the minimum total power (termed as critical total power) required to ensure k -connectivity in wireless networks. Contrary to several previous results that assume all nodes use a (minimum) common power, we allow nodes... View full abstract»

• A Real-Time and Reliable Transport (RT)$^{2}$ Protocol for Wireless Sensor and Actor Networks

Publication Year: 2008, Page(s):359 - 370
Cited by:  Papers (99)
| | PDF (716 KB) | HTML

Wireless sensor and actor networks (WSANs) are characterized by the collective effort of heterogeneous nodes called sensors and actors. Sensor nodes collect information about the physical world, while actor nodes take action decisions and perform appropriate actions upon the environment. The collaborative operation of sensors and actors brings significant advantages over traditional sensing, inclu... View full abstract»

• Delay Models of Single-Source Single-Relay Cooperative ARQ Protocols in Slotted Radio Networks With Poisson Frame Arrivals

Publication Year: 2008, Page(s):371 - 382
Cited by:  Papers (42)
| | PDF (1591 KB) | HTML

In conventional (noncooperative) automatic repeat request (ARQ) protocols for radio networks, the corrupted data frames that cannot be correctly decoded at the destination are retransmitted by the source. In cooperative ARQ protocols, data frame retransmissions may be performed by a neighboring node (the relay) that has successfully overheard the source's frame transmission. One advantage of the l... View full abstract»

• A Superlinearly and Globally Convergent Algorithm for Power Control and Resource Allocation With General Interference Functions

Publication Year: 2008, Page(s):383 - 395
Cited by:  Papers (21)
| | PDF (392 KB) | HTML

In wireless networks, users are typically coupled by interference. Hence, resource allocation can strongly depend on receive strategies, such as beamforming, CDMA receivers, etc. We study the problem of minimizing the total transmission power while maintaining individual quality-of-service (QoS) values for all users. This problem can be solved by the fixed-point iteration proposed by Yates (1995) ... View full abstract»

• Fairness and Optimal Stochastic Control for Heterogeneous Networks

Publication Year: 2008, Page(s):396 - 409
Cited by:  Papers (166)  |  Patents (1)
| | PDF (707 KB) | HTML

We consider optimal control for general networks with both wireless and wireline components and time varying channels. A dynamic strategy is developed to support all traffic whenever possible, and to make optimally fair decisions about which data to serve when inputs exceed network capacity. The strategy is decoupled into separate algorithms for flow control, routing, and resource allocation, and ... View full abstract»

• Measurement-Based Admission Control at Edge Routers

Publication Year: 2008, Page(s):410 - 423
Cited by:  Papers (15)
| | PDF (637 KB) | HTML

It is very important to allocate and manage resources for multimedia traffic flows with real-time performance requirements in order to guarantee quality of service (QoS). In this paper, we develop a scalable architecture and an algorithm for admission control of real-time flows. Since individual management of each traffic flow on each transit router can cause a fundamental scalability problem in b... View full abstract»

• A Scalable Call Admission Control Algorithm

Publication Year: 2008, Page(s):424 - 434
Cited by:  Papers (8)
| | PDF (876 KB) | HTML

In this paper, we propose a scalable algorithm for connection admission control (CAC). The algorithm applies to a multiprotocol label switching (MPLS) ATM switch with a FIFO buffer. The switch carries data from statistically independent variable bit rate (VBR) sources that asynchronously alternate between ON and OFF states with exponentially distributed pe... View full abstract»

• Dual-Resource TCP/AQM for Processing-Constrained Networks

Publication Year: 2008, Page(s):435 - 449
Cited by:  Papers (6)
| | PDF (954 KB) | HTML

This paper examines congestion control issues for TCP flows that require in-network processing on the fly in network elements such as gateways, proxies, firewalls and even routers. Applications of these flows are increasingly abundant in the future as the Internet evolves. Since these flows require use of CPUs in network elements, both bandwidth and CPU resources can be a bottleneck and thus conge... View full abstract»

• Efficient Broadcasting Using Network Coding

Publication Year: 2008, Page(s):450 - 463
Cited by:  Papers (116)
| | PDF (564 KB) | HTML

We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless networks since it directly affects battery life and thus network lifetime. We prove that applying ideas from network coding allows to realize signifi... View full abstract»

• Rateless Forward Error Correction for Topology-Transparent Scheduling

Publication Year: 2008, Page(s):464 - 472
Cited by:  Papers (14)  |  Patents (1)
| | PDF (553 KB) | HTML

Topology-transparent scheduling for mobile wireless ad hoc networks has been treated as a theoretical curiosity. This paper makes two contributions towards its practical deployment: (1) We generalize the combinatorial requirement on the schedules and show that the solution is a cover-free family. As a result, a much wider number and variety of constructions for schedules exist to match network con... View full abstract»

• MICRON—A Framework for Connection Establishment in Optical Networks

Publication Year: 2008, Page(s):473 - 485
Cited by:  Papers (3)
| | PDF (910 KB) | HTML

Traffic grooming in optical networks has gained significance due to the prevailing sub-wavelength requirement of end users. Optical networks get upgraded to the latest technology slowly with time with only a subset of nodes being upgraded to the latest technology. The networks are thus comprised of nodes employing heterogeneous switching architectures. In this paper, we develop a framework called ... View full abstract»

• Efficient Distributed Bandwidth Management for MPLS Fast Reroute

Publication Year: 2008, Page(s):486 - 495
Cited by:  Papers (21)  |  Patents (2)
| | PDF (451 KB) | HTML

As service providers move more applications to their IP/MPLS (multiple protocol label switching ) backbone networks, rapid restoration upon failure becomes more and more crucial. Recently MPLS fast reroute has attracted lots of attention as it was designed to meet the needs of real-time applications, such as voice over IP. MPLS fast reroute achieves rapid restoration by computing and signaling bac... View full abstract»

• Corrections to "On the Performance Benefits of Multihoming Route Control"

Publication Year: 2008, Page(s): 496
| | PDF (114 KB) | HTML

First Page of the Article
View full abstract»

• IEEE/ACM Transactions on Networking society information

Publication Year: 2008, Page(s): C3
| PDF (40 KB)
• IEEE/ACM Transactions on Networking Information for authors

Publication Year: 2008, Page(s): C4
| PDF (29 KB)

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