Network resource allocation for users with multiple connections: fairness and stability
This paper studies network resource allocation between users that manage multiple connections, possibly through different routes, where each connection is subject to congestion control. We formulate a user-centric Network Utility Maximization problem ...
A cross-layer backpressure architecture for wireless multihop networks
Contemporary wireless multihop networks operate much below their capacity due to the poor coordination among transmitting nodes. In this paper, we present XPRESS, a cross-layer backpressure architecture designed to reach the capacity of wireless multihop ...
Streaming solutions for fine-grained network traffic measurements and analysis
Online network traffic measurements and analysis is critical for detecting and preventing any real-time anomalies in the network. We propose, implement, and evaluate an online, adaptive measurement platform, which utilizes real-time traffic analysis ...
IPv4 address sharing mechanism classification and tradeoff analysis
The growth of the Internet has made IPv4 addresses a scarce resource. Due to slow IPv6 deployment, IANA-level IPv4 address exhaustion was reached before the world could transition to an IPv6-only Internet. The continuing need for IPv4 reachability will ...
Topology design of communication networks: a game-theoretic perspective
We study the performance of noncooperative networks in light of three major topology design considerations, namely the price of establishing a link, path delay, and path proneness to congestion, the latter being modeled through the "relaying extent" of ...
CompactDFA: Scalable pattern matching using longest prefix match solutions
A central component in all contemporary intrusion detection systems (IDSs) is their pattern matching algorithms, which are often based on constructing and traversing a deterministic finite automaton (DFA) that represents the patterns. While this approach ...
A comparative analysis of the effects of dynamic optical circuit provisioning on IP routing
We analyze the effects of dynamic optical circuit setup on IP routing in general and on two routing mechanisms in particular, i.e., explicit routing and shortest-path-first routing. We present analytical models for computing the size and placement of ...
Boundary cutting for packet classification
Decision-tree-based packet classification algorithms such as HiCuts, HyperCuts, and EffiCuts show excellent search performance by exploiting the geometrical representation of rules in a classifier and searching for a geometric subspace to which each ...
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 ...
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 ...
Stochastic bandwidth estimation in networks with random service
Numerous methods for available bandwidth estimation have been developed for wireline networks, and their effectiveness is well-documented. However, most methods fail to predict bandwidth availability reliably in a wireless setting. It is accepted that ...
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 ...
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 ...
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, ...
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 ...
Automatic test packet generation
Networks are getting larger and more complex, yet administrators rely on rudimentary tools such as and to debug problems. We propose an automated and systematic approach for testing and debugging networks called "Automatic Test Packet Generation" (ATPG). ...
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 ...
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 ...
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 ...
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, ...
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 ...
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 ...
Incentive mechanisms for internet congestion management: fixed-budget rebate versus time-of-day pricing
Mobile data traffic has been steadily rising in the past years. This has generated a significant interest in the deployment of incentive mechanisms to reduce peak-time congestion. Typically, the design of these mechanisms requires information about user ...
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 ...
Nonconcave utilitymaximization 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 (...
