IEEE/ACM Transactions on Networking

Items from 1 to 20 out of 29 results

article

CR Switch: A Load-Balanced Switch With Contention and Reservation

Chao-Lin Yu, Cheng-Shang Chang, Duan-Shin Lee

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1659 - 1671

Load-balanced switches have received a great deal of attention recently as they are much more scalable than other existing switch architectures in the literature. However, as there exist multiple paths for flows of packets to traverse through load-balanced switches, packets in such switches may be delivered out of order. In this paper, we propose a new switch architecture, called the contention and...

article

Scalable Key Management Algorithms for Location-Based Services

M. Srivatsa, A. Iyengar, Jian Yin, Ling Liu

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1399 - 1412

Secure media broadcast over the Internet poses unique security challenges. One important problem for public broadcast location-based services (LBS) is to enforce access control on a large number of subscribers. In such a system, a user typically subscribes to an LBS for a time interval (a, b) and a spatial region (x_bi, y_bi, x_tr,y_tr) according to a 3-dimensional spatial-temporal authorization model...

article

Crossing Over the Bounded Domain: From Exponential to Power-Law Intermeeting Time in Mobile Ad Hoc Networks

Han Cai, Do Young Eun

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1578 - 1591

Intermeeting time between mobile nodes is one of the key metrics in a mobile ad hoc network (MANET) and central to the end-to-end delay of forwarding algorithms. It is typically assumed to be exponentially distributed in many performance studies of MANET or numerically shown to be exponentially distributed under most existing mobility models in the literature. However, recent empirical results show...

article

Opportunistic Energy-Efficient Contact Probing in Delay-Tolerant Applications

Wei Wang, M. Motani, V. Srinivasan

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1592 - 1605

In many delay-tolerant applications, information is opportunistically exchanged between mobile devices that encounter each other. In order to affect such information exchange, mobile devices must have knowledge of other devices in their vicinity. We consider scenarios in which there is no infrastructure and devices must probe their environment to discover other devices. This can be an extremely energy-consuming...

article

Scalability and Performance Evaluation of Hierarchical Hybrid Wireless Networks

Suli Zhao, D. Raychaudhuri

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1536 - 1549

This paper considers the problem of scaling ad hoc wireless networks now being applied to urban mesh and sensor network scenarios. Previous results have shown that the inherent scaling problems of a multihop ldquoflatrdquo ad hoc wireless network can be improved by a ldquohybrid networkrdquo with an appropriate proportion of radio nodes with wired network connections. In this work, we generalize the...

article

Resource Dimensioning Through Buffer Sampling

M. Mandjes, R. van de Meent

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1631 - 1644

Link dimensioning, i.e., selecting a (minimal) link capacity such that the users' performance requirements are met, is a crucial component of network design. It requires insight into the interrelationship among the traffic offered (in terms of the mean offered load M, but also its fluctuation around the mean, i.e., `burstiness'), the envisioned performance level, and the capacity needed. We first...

article

Modeling Spatial and Temporal Dependencies of User Mobility in Wireless Mobile Networks

Wei-Jen Hsu, T. Spyropoulos, K. Psounis, A. Helmy

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1564 - 1577

Realistic mobility models are fundamental to evaluate the performance of protocols in mobile ad hoc networks. Unfortunately, there are no mobility models that capture the non-homogeneous behaviors in both space and time commonly found in reality, while at the same time being easy to use and analyze. Motivated by this, we propose a time-variant community mobility model, referred to as the TVC model,...

article

Optimal Sleep/Wake Scheduling for Time-Synchronized Sensor Networks With QoS Guarantees

Yan Wu, S. Fahmy, N.B. Shroff

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1508 - 1521

We study sleep/wake scheduling for low-duty cycle sensor networks. Our work explicitly considers the effect of synchronization error. We focus on a widely used synchronization scheme and show that its synchronization error is nonnegligible and using a conservative guard time is energy wasteful. We formulate an optimization problem that aims to set the capture probability threshold for messages from...

article

Describing Network Traffic Using the Index of Variability

G.Y. Lazarou, J. Baca, V.S. Frost, J.B. Evans

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1672 - 1683

Commonly used measures of traffic burstiness do not capture the fluctuation of traffic variability over the entire range of time-scales. In this paper, we present a measure of variability, called the Index of Variability (Hv(tau)), that depicts the degree of variability (burstiness) of a typical network traffic process at each time-scale and is analytically tractable for many traffic models. As an...

article

Front Cover

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > C1 - C4

article

IEEE/ACM Transactions on Networking information for authors

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1696

article

IEEE/ACM Transactions on Networking publication information

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > C2

article

IEEE/ACM Transactions on Networking society information

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > C3

article

Path Switching and Grading Algorithms for Advance Channel Reservation Architectures

R. Cohen, N. Fazlollahi, D. Starobinski

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1684 - 1695

As a result of perceived limitations of TCP/IP in supporting high-throughput applications, significant efforts have recently been devoted to develop alternative architectures based on the concept of advance channel reservation. In this paper, we develop a polynomial-time algorithmic framework, called graded channel reservation (GCR), to support the implementation of such architectures. This framework...

article

Optimal Stochastic Policies for Distributed Data Aggregation in Wireless Sensor Networks

Zhenzhen Ye, A.A. Abouzeid, Jing Ai

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1494 - 1507

The scenario of distributed data aggregation in wireless sensor networks is considered, where sensors can obtain and estimate the information of the whole sensing field through local data exchange and aggregation. An intrinsic tradeoff between energy and aggregation delay is identified, where nodes must decide optimal instants for forwarding samples. The samples could be from a node's own sensor readings...

article

A Unified Approach to Congestion Control and Node-Based Multipath Routing

F. Paganini, E. Mallada

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1413 - 1426

The paper considers a TCP/IP-style network with flow control at end-systems based on congestion feedback and routing decisions at network nodes on a per-destination basis. The main generalization with respect to standard IP is to allow routers to split their traffic in a controlled way between the outgoing links. We formulate global optimization criteria, combining those used in the congestion control...

article

Nash Bargaining and Proportional Fairness for Wireless Systems

H. Boche, M. Schubert

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1453 - 1466

Nash bargaining and proportional fairness are popular strategies for distributing resources among competing users. Under the conventional assumption of a convex compact utility set, both techniques yield the same unique solution. In this paper, we show that uniqueness is preserved for a broader class of logarithmically convex sets. Then, we study a scenario where the performance of each user is measured...

article

Taking the Skeletons Out of the Closets: A Simple and Efficient Topology Discovery Scheme for Large Ethernet LANs

Y. Bejerano

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1385 - 1398

We propose a simple and efficient algorithmic solution for discovering the physical topology of large, heterogeneous Ethernet LANs that may include multiple subnets as well as uncooperative network elements, like hubs. Our scheme utilizes only generic MIB information and does not require any hardware or software modification of the underlying network elements. By rigorous analysis, we prove that our...

article

On Conflict-Free All-to-All Broadcast in One-Hop Optical Networks of Arbitrary Topologies

S.A. Pascu, A.A. El-Amawy

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1619 - 1630

In this paper, we investigate the problem of all-to-all broadcast in optical networks, also known as gossiping. This problem is very important in the context of control plane design as it relates to status information dissemination. We present a routing and wavelength assignment (RWA) method to reduce the number of wavelengths such that the communication is conflict-free in a wavelength division multiplexing...

article

Guaranteed Performance Routing of Unpredictable Traffic With Fast Path Restoration

M. Kodialam, T.V. Lakshman, S. Sengupta

IEEE/ACM Transactions on Networking > 2009 > 17 > 5 > 1427 - 1438

Two-phase routing, where traffic is first distributed to intermediate nodes before being routed to the final destination, has been recently proposed for handling widely fluctuating traffic without the need to adapt network routing to changing traffic. Preconfiguring the network in a traffic-independent manner using two-phase routing simplifies network operation considerably. In this paper, we extend...

Number:
5
Volume:
17
Year:
2009

Publication date

Set your own date range

Keywords

THROUGHPUT (10)
TELECOMMUNICATION TRAFFIC (8)
ROUTING (7)
TRAFFIC CONTROL (7)
AD HOC NETWORKS (5)
TELECOMMUNICATION NETWORK ROUTING (5)
DELAY (4)
NETWORK TOPOLOGY (4)
SCHEDULING (4)
SPREAD SPECTRUM COMMUNICATION (4)
SWITCHES (4)
TELECOMMUNICATION NETWORK TOPOLOGY (4)
BANDWIDTH (3)
COMPUTER NETWORKS (3)
DISRUPTION TOLERANT NETWORKING (3)
FREQUENCY (3)
GRAPH THEORY (3)
HELIUM (3)
INTERFERENCE (3)
INTERNET (3)
LARGE-SCALE SYSTEMS (3)
MOBILE AD HOC NETWORKS (3)
MOBILE COMMUNICATION (3)
OPTIMAL CONTROL (3)
PROPOSALS (3)
QUALITY OF SERVICE (3)
SCALABILITY (3)
WIRELESS NETWORKS (3)
ACCESS PROTOCOLS (2)
ANALYTICAL MODELS (2)
BANDWIDTH ALLOCATION (2)
BROADCASTING (2)
CLOSED-FORM SOLUTION (2)
COMMUNICATION SYSTEM CONTROL (2)
COMMUNICATION SYSTEMS (2)
CONGESTION CONTROL (2)
ENERGY EFFICIENCY (2)
FLUCTUATIONS (2)
INFORMATION ANALYSIS (2)
LOCAL AREA NETWORKS (2)
MEASUREMENT (2)
MOBILITY MANAGEMENT (MOBILE RADIO) (2)
MULTIHOP WIRELESS NETWORKS (2)
MULTIPATH ROUTING (2)
OPTIMAL SCHEDULING (2)
OPTIMISATION (2)
PACKET SWITCHING (2)
PERFORMANCE ANALYSIS (2)
POLYNOMIALS (2)
POWER SYSTEM MODELING (2)
PROBABILITY (2)
PROTOCOLS (2)
RADIO NETWORKS (2)
RADIOFREQUENCY INTERFERENCE (2)
RESERVATION (2)
RESOURCE MANAGEMENT (2)
ROBUSTNESS (2)
ROUTING PROTOCOLS (2)
SCHEDULING ALGORITHM (2)
STABILITY (2)
STOCHASTIC PROCESSES (2)
TCPIP (2)
TELECOMMUNICATION CONGESTION CONTROL (2)
WIRELESS APPLICATION PROTOCOL (2)
WIRELESS LAN (2)
WIRELESS MESH NETWORKS (2)
WIRELESS SENSOR NETWORKS (2)
2D INDEX-OF-VARIABILITY CURVES (1)
3D INDEX-OF-VARIABILITY CURVES (1)
802.11 WIRELESS MESH NETWORK (1)
80211 WLAN (1)
ACCESS CONTROL (1)
ACCESS POINTS (1)
AD HOC NETWORK (1)
AD HOC WIRELESS NETWORKS (1)
ADVANCE CHANNEL RESERVATION ARCHITECTURE (1)
AGGREGATES (1)
AGGREGATION DELAY (1)
ALGORITHMS (1)
ALOHA NETWORK NONSTARVATION CONDITION (1)
APPLICATION SOFTWARE (1)
APPROXIMATION ALGORITHMS (1)
ARBITRARY TOPOLOGY (1)
ASSOCIATE MEMBERS (1)
AUTHORISATION (1)
AUTHORIZATION (1)
AUTOCORRELATION (1)
AVAILABILITY (1)
AXIOMATIC FRAMEWORK (1)
BLUETOOTH (1)
BLUETOOTH PHONE (1)
BOUNDED DOMAIN (1)
BUFFER SAMPLING (1)
BUSINESS (1)
CACTUS REPRESENTATION (1)
CAPACITY REGION (1)
CAPACITY SCALING (1)
CARRIER-CLASS RELIABILITY (1)
CHANNEL ALLOCATION (1)
CHAOS (1)
more

INFONA - science communication portal

IEEE/ACM Transactions on Networking

CR Switch: A Load-Balanced Switch With Contention and Reservation

Scalable Key Management Algorithms for Location-Based Services

Crossing Over the Bounded Domain: From Exponential to Power-Law Intermeeting Time in Mobile Ad Hoc Networks

Opportunistic Energy-Efficient Contact Probing in Delay-Tolerant Applications

Scalability and Performance Evaluation of Hierarchical Hybrid Wireless Networks

Resource Dimensioning Through Buffer Sampling

Modeling Spatial and Temporal Dependencies of User Mobility in Wireless Mobile Networks

Optimal Sleep/Wake Scheduling for Time-Synchronized Sensor Networks With QoS Guarantees

Describing Network Traffic Using the Index of Variability

Front Cover

IEEE/ACM Transactions on Networking information for authors

IEEE/ACM Transactions on Networking publication information

IEEE/ACM Transactions on Networking society information

Path Switching and Grading Algorithms for Advance Channel Reservation Architectures

Optimal Stochastic Policies for Distributed Data Aggregation in Wireless Sensor Networks

A Unified Approach to Congestion Control and Node-Based Multipath Routing

Nash Bargaining and Proportional Fairness for Wireless Systems

Taking the Skeletons Out of the Closets: A Simple and Efficient Topology Discovery Scheme for Large Ethernet LANs

On Conflict-Free All-to-All Broadcast in One-Hop Optical Networks of Arbitrary Topologies

Guaranteed Performance Routing of Unpredictable Traffic With Fast Path Restoration

Filter options

Publication date

Keywords

INFONA - science communication portal

IEEE/ACM Transactions on Networking

Add recipient

Sending message cancelled

Are you sure you want to cancel sending this message?

Send message

Filter options

Publication date

Date range setting

Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.

Keywords

Reporting an error / abuse

Sending the report failed

Accessibility options