Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.

# IEEE/ACM Transactions on Networking

## Filter Results

Displaying Results 1 - 25 of 32
• ### [Front cover]

Publication Year: 2010, Page(s):C1 - C4
| PDF (427 KB)
• ### IEEE/ACM Transactions on Networking publication information

Publication Year: 2010, Page(s): C2
| PDF (38 KB)
• ### POPI: A User-Level Tool for Inferring Router Packet Forwarding Priority

Publication Year: 2010, Page(s):1 - 14
Cited by:  Papers (4)
| | PDF (759 KB) | HTML

Packet forwarding prioritization (PFP) in routers is one of the mechanisms commonly available to network operators. PFP can have a significant impact on the accuracy of network measurements, the performance of applications and the effectiveness of network troubleshooting procedures. Despite its potential impacts, no information on PFP settings is readily available to end users. In this paper, we p... View full abstract»

• ### Computational Analysis and Efficient Algorithms for Micro and Macro OFDMA Downlink Scheduling

Publication Year: 2010, Page(s):15 - 26
Cited by:  Papers (10)
| | PDF (481 KB) | HTML

Orthogonal frequency-division multiple access (OFDMA) is one of the most important modulation and access methods for the future mobile networks. Before transmitting a frame on the downlink, an OFDMA base station has to invoke an algorithm that determines which of the pending packets will be transmitted, what modulation should be used for each of them, and how to construct the complex OFDMA frame m... View full abstract»

• ### On Suitability of Euclidean Embedding for Host-Based Network Coordinate Systems

Publication Year: 2010, Page(s):27 - 40
Cited by:  Papers (25)
| | PDF (1563 KB) | HTML

In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classical scaling and matrix perturbation theories, we first establish the (sum of the) magnitude of negative eigenvalues of the (doubly centered, squared) distance matrix as a measure of suitability of Euclidean embedding. We t... View full abstract»

• ### Detection of Intelligent Mobile Target in a Mobile Sensor Network

Publication Year: 2010, Page(s):41 - 52
Cited by:  Papers (14)
| | PDF (1537 KB) | HTML

We study the problem of a mobile target (the mouse) trying to evade detection by one or more mobile sensors (we call such a sensor a cat) in a closed network area. We view our problem as a game between two players: the mouse, and the collection of cats forming a single (meta-)player. The game ends when the mouse falls within the sensing range of one or more cats. A cat tries to deter... View full abstract»

• ### Thwarting Zero-Day Polymorphic Worms With Network-Level Length-Based Signature Generation

Publication Year: 2010, Page(s):53 - 66
Cited by:  Papers (7)  |  Patents (3)
| | PDF (846 KB) | HTML

It is crucial to detect zero-day polymorphic worms and to generate signatures at network gateways or honeynets so that we can prevent worms from propagating at their early phase. However, most existing network-based signatures are specific to exploit and can be easily evaded. In this paper, we propose generating vulnerability-driven signatures at network level without any host-level analysis of wo... View full abstract»

• ### $1+{rm N}$ Network Protection for Mesh Networks: Network Coding-Based Protection Using p-Cycles

Publication Year: 2010, Page(s):67 - 80
Cited by:  Papers (46)
| | PDF (492 KB) | HTML

p-cycles have been proposed for preprovisioned 1:N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the rerouting of traffic can be a time consuming operation. Another survivable mode of operation is the 1+1 protection mode, in which a signal is transmitted to the destination on two link disjoint circuits, hence re... View full abstract»

• ### SUSE: Superior Storage-Efficiency for Routing Tables Through Prefix Transformation and Aggregation

Publication Year: 2010, Page(s):81 - 94
Cited by:  Papers (2)
| | PDF (1179 KB) | HTML

A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). The proposed design involves two key techniques to lower table storage required drastically: 1) storing transformed prefix representations; and 2) accommodating multiple prefixes per table entry via prefix aggregation, achieving s... View full abstract»

• ### Message-Efficient Beaconless Georouting With Guaranteed Delivery in Wireless Sensor, Ad Hoc, and Actuator Networks

Publication Year: 2010, Page(s):95 - 108
Cited by:  Papers (32)
| | PDF (1266 KB) | HTML

Beaconless georouting algorithms are fully reactive and work without prior knowledge of their neighbors. However, existing approaches can either not guarantee delivery or they require the exchange of complete neighborhood information. We describe two general methods for completely reactive face routing with guaranteed delivery. The beaconless forwarder planarization (BFP) scheme determines correct... View full abstract»

• ### The (In)Completeness of the Observed Internet AS-level Structure

Publication Year: 2010, Page(s):109 - 122
Cited by:  Papers (68)
| | PDF (1093 KB) | HTML

Despite significant efforts to obtain an accurate picture of the Internet's connectivity structure at the level of individual autonomous systems (ASes), much has remained unknown in terms of the quality of the inferred AS maps that have been widely used by the research community. In this paper, we assess the quality of the inferred Internet maps through case studies of a sample set of ASes. These ... View full abstract»

• ### Efficient and Dynamic Routing Topology Inference From End-to-End Measurements

Publication Year: 2010, Page(s):123 - 135
Cited by:  Papers (23)
| | PDF (933 KB) | HTML

Inferring the routing topology and link performance from a node to a set of other nodes is an important component in network monitoring and application design. In this paper, we propose a general framework for designing topology inference algorithms based on additive metrics. The framework can flexibly fuse information from multiple measurements to achieve better estimation accuracy. We develop co... View full abstract»

• ### Global Access Network Evolution

Publication Year: 2010, Page(s):136 - 149
Cited by:  Papers (2)
| | PDF (785 KB) | HTML

In this paper, we propose to tackle the problem of updating the access network in order to connect new subscribers and to satisfy the new class of service requirements for the existing subscribers to offer, for instance, new services such as high-definition television (HDTV) over the Internet protocol (IPTV). Four important access network architectures/technologies are considered: the digital subs... View full abstract»

• ### A Dynamic En-route Filtering Scheme for Data Reporting in Wireless Sensor Networks

Publication Year: 2010, Page(s):150 - 163
Cited by:  Papers (23)
| | PDF (798 KB) | HTML

In wireless sensor networks, adversaries can inject false data reports via compromised nodes and launch DoS attacks against legitimate reports. Recently, a number of filtering schemes against false reports have been proposed. However, they either lack strong filtering capacity or cannot support highly dynamic sensor networks very well. Moreover, few of them can deal with DoS attacks simultaneously... View full abstract»

• ### Weighted Spectral Distribution for Internet Topology Analysis: Theory and Applications

Publication Year: 2010, Page(s):164 - 176
Cited by:  Papers (33)
| | PDF (2023 KB)

Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant to the study of Internet topologies, such as the generation of synthetic topologies to represent the Internet's AS topology. We derive a new metric that enables exactly such a structural comparison: the weighted spectral distribut... View full abstract»

• ### Gradually Reconfiguring Virtual Network Topologies Based on Estimated Traffic Matrices

Publication Year: 2010, Page(s):177 - 189
Cited by:  Papers (25)
| | PDF (1271 KB) | HTML

Traffic matrix is essential to traffic engineering (TE) methods. Because it is difficult to monitor traffic matrices directly, several methods for estimating them from link loads have been proposed. However, estimated traffic matrix includes estimation errors which degrade the performance of TE significantly. In this paper, we propose a method that reduces estimation errors while reconfiguring the... View full abstract»

• ### Distributed Resource Sharing in Low-Latency Wireless Ad Hoc Networks

Publication Year: 2010, Page(s):190 - 201
Cited by:  Papers (1)
| | PDF (628 KB) | HTML

With the growing abundance of portable wireless communication devices, a challenging question that arises is whether one can efficiently harness the collective communication and computation power of these devices. In this paper, we investigate this question by studying a streaming application. Consider a network of N wireless nodes, each of power P, in which one or more nodes are interested in rec... View full abstract»

• ### Coverage-Time Optimization for Clustered Wireless Sensor Networks: A Power-Balancing Approach

Publication Year: 2010, Page(s):202 - 215
Cited by:  Papers (34)
| | PDF (544 KB) | HTML

In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network by optimal balancing of power consumption among cluster heads (CHs). Clustering significantly reduces the energy consumption of individual sensors, but it also increases the communication burden on CHs. To investigate this tradeoff, our analytical model incorporates both intra- and interclus... View full abstract»

• ### Deploying Sensor Networks With Guaranteed Fault Tolerance

Publication Year: 2010, Page(s):216 - 228
Cited by:  Papers (40)
| | PDF (848 KB) | HTML

We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multipath connectivity (k-connectivity) between all nodes. Such a guarantee simultaneously provides fault tolerance against node failures and high overall network capacity (by the max-flow min-cut theorem). We design and analyze the first algorithms that place an almost-minimum number of add... View full abstract»

• ### Measurement-Based Analysis, Modeling, and Synthesis of the Internet Delay Space

Publication Year: 2010, Page(s):229 - 242
Cited by:  Papers (26)
| | PDF (1318 KB) | HTML

Understanding the characteristics of the Internet delay space (i.e., the all-pairs set of static round-trip propagation delays among edge networks in the Internet) is important for the design of global-scale distributed systems. For instance, algorithms used in overlay networks are often sensitive to violations of the triangle inequality and to the growth properties within the Internet delay space... View full abstract»

Publication Year: 2010, Page(s):243 - 256
Cited by:  Papers (21)
| | PDF (1198 KB) | HTML

Augmenting cellular networks with shorter multihop wireless links that carry traffic to/from a base station can be expected to facilitate higher rates and improved spatial reuse, therefore potentially yielding increased wireless capacity. The resulting network is referred to as a hybrid network. However, while this approach can result in shorter range higher rate links and improved spatial reuse, ... View full abstract»

• ### Understanding and Modeling the Internet Topology: Economics and Evolution Perspective

Publication Year: 2010, Page(s):257 - 270
Cited by:  Papers (14)
| | PDF (616 KB) | HTML

In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to traditional models based on preferential attachment and centralized optimization, the Pareto degree of the Internet can be explained by the evolution of wealth associated with each ISP. The proposed topology model utilizes a simple m... View full abstract»

• ### QoS-Based Manycasting Over Optical Burst-Switched (OBS) Networks

Publication Year: 2010, Page(s):271 - 283
Cited by:  Papers (14)
| | PDF (1218 KB) | HTML

Many distributed applications require a group of destinations to be coordinated with a single source. Multicasting is a communication paradigm to implement these distributed applications. However in multicasting, if at least one of the members in the group cannot satisfy the service requirement of the application, the multicast request is said to be blocked. On the contrary in manycasting, destina... View full abstract»

• ### ILP Formulations for $p$-Cycle Design Without Candidate Cycle Enumeration

Publication Year: 2010, Page(s):284 - 295
Cited by:  Papers (30)
| | PDF (1194 KB) | HTML

The concept of p-cycle (preconfigured protection cycle) allows fast and efficient span protection in wavelength division multiplexing (WDM) mesh networks. To design p-cycles for a given network, conventional algorithms need to enumerate cycles in the network to form a candidate set, and then use an integer linear program (ILP) to find a set of p -cycles from the candidate set.... View full abstract»

• ### Approximation Algorithms for Minimum Energy Transmission Scheduling in Rate and Duty-Cycle Constrained Wireless Networks

Publication Year: 2010, Page(s):296 - 306
Cited by:  Papers (1)
| | PDF (408 KB) | HTML

We consider a constrained energy optimization called minimum energy scheduling problem (MESP) for a wireless network of N users transmitting over M time slots, where the constraints arise because of interference between wireless nodes that limits their transmission rates along with load and duty-cycle (on-off) restrictions. Since traditional optimization methods using Lagrange multip... View full abstract»

## 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