Cheng Tien Ee
University of California, Berkeley
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Cheng Tien Ee.
international conference on embedded networked sensor systems | 2004
Cheng Tien Ee; Ruzena Bajcsy
In this paper we propose a distributed and scalable algorithm that eliminates congestion within a sensor network, and that ensures the fair delivery of packets to a central node, or base station. We say that fairness is achieved when equal number of packets are received from each node. Since in general we have many sensors transmitting data to the base station, we consider the scenario where we have many-to-one multihop routing, noting that it can easily be extended to unicast or many-to-many routing. Such routing structures often result in the sensors closer to the base station experiencing congestion, which inevitably cause packets originating from sensors further away from the base station to have a higher probability of being dropped. Our algorithm exists in the transport layer of the traditional network stack model, and is designed to work with any MAC protocol in the data-link layer with minor modifications. Our solution is scalable, each sensor mote requires state proportional to the number of its neighbors. Finally, we demonstrate the effectiveness of our solution with both simulations and actual implementation in UC Berkeleys sensor motes.
acm special interest group on data communication | 2007
Cheng Tien Ee; Byung-Gon Chun; Kaushik Lakshminarayanan; Scott Shenker
The Border Gateway Protocol (BGP) allows each autonomous system (AS) to select routes to destinations based on semantically rich and locally determined policies. This autonomously exercised policy freedom can cause instability, where unresolvable policy-based disputes in the network result in interdomain route oscillations. Several recent works have established that such instabilities can only be eliminated by enforcing a globally accepted preference ordering on routes (such as shortest path). To resolve this conflict between policy autonomy and system stability, we propose a distributed mechanism that enforces a preference ordering only when disputes resulting in oscillations exist. This preserves policy freedom when possible, and imposes stability when required.
networked systems design and implementation | 2005
Rodrigo Fonseca; Sylvia Ratnasamy; Jerry Zhao; Cheng Tien Ee; David E. Culler; Scott Shenker; Ion Stoica
acm special interest group on data communication | 2005
Lakshminarayanan Subramanian; Matthew Caesar; Cheng Tien Ee; Mark Handley; Morley Mao; Scott Shenker; Ion Stoica
hot topics in operating systems | 2005
David E. Culler; Prabal Dutta; Cheng Tien Ee; Rodrigo Fonseca; Jonathan W. Hui; Philip Levis; Scott Shenker; Ion Stoica; Gilman Tolle; Jerry Zhao
operating systems design and implementation | 2006
Cheng Tien Ee; Rodrigo Fonseca; Sukun Kim; Daekyeong Moon; Arsalan Tavakoli; David E. Culler; Scott Shenker; Ion Stoica
Archive | 2003
Jaein Jeong; Cheng Tien Ee
networked systems design and implementation | 2006
Cheng Tien Ee; Sylvia Ratnasamy; Scott Shenker
operating systems design and implementation | 2006
Cheng Tien Ee; Rodrigo Fonseca; Sunyoung Kim; Arsalan Tavakoli; David E. Culler; Scott Shenker; Ion Stoica
Archive | 2007
Scott Shenker; Cheng Tien Ee