Electronics

Nonconcave Utility Maximization in Locally Coupled Systems, With Applications to Wireless and Wireline Networks
Motivated by challenging resource allocation issues arising in large-scale wireless and wireline communication networks, we study distributed network utility maximization problems with a mixture of concave (e.g., best-effort throughputs) and nonconcave (e.g., voice/video streaming rates) utilities. In the first part of the paper, we develop our methodological framework in the context of a local...


Cost-Effective Resource Allocation of Overlay Routing Relay Nodes
Overlay routing is a very attractive scheme that allows improving certain properties of the routing (such as delay or TCP throughput) without the need to change the standards of the current underlying routing. However, deploying overlay routing requires the placement and maintenance of overlay infrastructure. This gives rise to the following optimization problem: Find a minimal set of overlay n...
On the Delay Performance of In-Network Aggregation in Lossy Wireless Sensor Networks
In this paper, we study the implication of wireless broadcast for data aggregation in lossy wireless sensor networks. Each sensor node generates information by sensing its physical environment and transmits the data to a special node called the sink, via multihop communications. The goal of the network system is to compute a function at the sink from the information gathered by spatially distri...


Capacity Allocation Games for Network-Coded Multicast Streaming
In this paper, we formulate and study a capacity allocation game between a set of receivers (players) that are interested in receiving multicast data (video/multimedia) being streamed from a server through a multihop network. We consider fractional multicast streaming, where the multicast stream from the source (origin-server) to any particular receiver (end-user) can be split over multiple pat...
Iterative Localization of Wireless Sensor Networks: An Accurate and Robust Approach
In wireless sensor networks, an important research problem is to use a few anchor nodes with known locations to derive the locations of other nodes deployed in the sensor field. A category of solutions for this problem is the iterative localization, which sequentially merges the elements in a network to finally locate them. Here, a network element is different from its definition in iterative t...


Multicast Capacity With Max-Min Fairness for Heterogeneous Networks
In this paper, we investigate the multicast capacity for static ad hoc networks with heterogeneous clusters. We study the effect of heterogeneous cluster traffic (HCT) on the achievable capacity. HCT means cluster clients are more likely to appear near the cluster head instead of being uniformly distributed across the network. Such a property is commonly found in real networks. By adopting max-...
Interconnecting Routing Instances
Many operators run more than one routing instance—more than one routing protocol, or more than one instance of a given routing protocol—in their networks. Route election and route redistribution are mechanisms introduced by router vendors to interconnect routing instances. We show that these mechanisms do not heed basic performance goals. Especially, we show that, in general, they...

Automatic Test Packet Generation
Networks are getting larger and more complex, yet administrators rely on rudimentary tools such as ${tt ping}$ and ${tt traceroute}$ to debug problems. We propose an automated and systematic approach for testing and debugging networks called “Automatic Test Packet Generation” (ATPG). ATPG reads router configurations and generates a device-independent model. The model is used to ge...
LBDP: Localized Boundary Detection and Parametrization for 3-D Sensor Networks
Many applications of wireless sensor networks involve monitoring a time-variant event (e.g., radiation pollution in the air). In such applications, fast boundary detection is a crucial function, as it allows us to track the event variation in a timely fashion. However, the problem becomes very challenging as it demands a highly efficient algorithm to cope with the dynamics introduced by the evo...

Fair Scheduling in Cellular Systems in the Presence of Noncooperative Mobiles
We consider the problem of “fair” scheduling the resources to one of the many mobile stations by a centrally controlled base station (BS). The BS is the only entity taking decisions in this framework based on truthful information from the mobiles on their radio channel. We study the well-known family of parametric $alpha$ -fair scheduling problems from a game-theoretic perspective...
OSA: An Optical Switching Architecture for Data Center Networks With Unprecedented Flexibility
A detailed examination of evolving traffic characteristics, operator requirements, and network technology trends suggests a move away from nonblocking interconnects in data center networks (DCNs). As a result, recent efforts have advocated oversubscribed networks with the capability to adapt to traffic requirements on-demand. In this paper, we present the design, implementation, and evaluation ...

Competition of Wireless Providers for Atomic Users
We study a problem where wireless service providers compete for heterogenous wireless users. The users differ in their utility functions as well as in the perceived quality of service of individual providers. We model the interaction of an arbitrary number of providers and users as a two-stage multi-leader–follower game. We prove existence and uniqueness of the subgame perfect Nash equil...
An Adaptive Video Streaming Control System: Modeling, Validation, and Performance Evaluation
Adaptive video streaming is a relevant advancement with respect to classic progressive download streaming a la YouTube. Among the different approaches, the video stream-switching technique is getting wide acceptance, being adopted by Microsoft, Apple, and popular video streaming services such as Akamai, Netflix, Hulu, Vudu, and Livestream. In this paper, we present a model of the automatic vide...
Which Protocol? Mutual Interaction of Heterogeneous Congestion Controllers
A large number of congestion control protocols have been proposed in the last few years, with all having the same purpose—to divide available bandwidth resources among different flows in a fair manner. Each protocol operates on the paradigm of some conception of link price (such as packet losses or packet delays) that determines source transmission rates. Recent work on network utility m...
A Polynomial-Time Algorithm for Computing Disjoint Lightpath Pairs in Minimum Isolated-Failure-Immune WDM Optical Networks
A fundamental problem in survivable routing in wavelength division multiplexing (WDM) optical networks is the computation of a pair of link-disjoint (or node-disjoint) lightpaths connecting a source with a destination, subject to the wavelength continuity constraint. However, this problem is NP-hard when the underlying network topology is a general mesh network. As a result, heuristic algorithm...