— Scalable and efficient routing is a main challenge in the deployment of large ad hoc wireless networks. An essential element of practical routing protocols is their accommodat...
Abstract— In this paper, we study the problem of exact emulation of two types of optical queues: (i) N-to-1 output-buffered multiplexers with variable length bursts, and (ii) N ...
Yi-Ting Chen, Cheng-Shang Chang, Jay Cheng, Duan-S...
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
— Window growth function for congestion control is a strong determinant of protocol behaviors, especially its second and higher-order behaviors associated with the distribution o...
Han Cai, Do Young Eun, Sangtae Ha, Injong Rhee, Li...
— In this work, we study the problem of minimizing the total power consumption in a multi-hop wireless network subject to a given offered load. It is well-known that the total po...
—This paper presents a theoretic framework of optimal resource allocation and admission control for peer-topeer networks. Peer’s behavioral rankings are incorporated into the r...
— Internet backbone networks are under constant flux, struggling to keep up with increasing demand. The pace of technology change often outstrips the deployment of associated fa...
Ramana Rao Kompella, Jennifer Yates, Albert G. Gre...
— This paper argues for the need to address the issue of multi-channel network performance under constraints on channel switching. We present examples from emergent directions in...
— This paper presents an algorithm for maximizing the lifetime of a sensor network while guaranteeing an upper bound on the end-to-end delay. We prove that the proposed algorithm...
—Existing methods of measuring lifetimes in P2P systems usually rely on the so-called Create-Based Method (CBM) [16], which divides a given observation window into two halves and...