Sciweavers

38 search results - page 6 / 8
» MotionCast: on the capacity and delay tradeoffs
Sort
View
JSAC
2007
128views more  JSAC 2007»
13 years 6 months ago
Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?
— Most of the real deployed peer-to-peer streaming systems adopt pull-based streaming protocol. In this paper, we demonstrate that, besides simplicity and robustness, with proper...
Meng Zhang, Qian Zhang, Lifeng Sun, Shiqiang Yang
INFOCOM
2008
IEEE
14 years 13 days ago
On the Throughput Capacity of Opportunistic Multicasting with Erasure Codes
— In this paper, we concentrate on opportunistic scheduling for multicast information. We pose the problem as a multicast throughput optimization problem. As a solution we presen...
Ulas C. Kozat
IMSCCS
2007
IEEE
14 years 10 days ago
An Improved RED Algorithm with Combined of Queue Length and Sending-Rate Inspection
The main purpose of active queue management is to provide congestion information so that sources can set their rates. In this paper, we consider an algorithm which can achieve hig...
Chunna Cao, Wenbin Yao, Jun Ni, Shaobin Cai
MOBIHOC
2003
ACM
14 years 5 months ago
The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way)
In wireless ad hoc networks, capacity can be traded for delay. This tradeoff has been the subject of a number of studies, mainly concentrating on the two extremes: either minimizi...
Tara Small, Zygmunt J. Haas
VLSID
2002
IEEE
120views VLSI» more  VLSID 2002»
14 years 6 months ago
Floorplan Evaluation with Timing-Driven Global Wireplanning, Pin Assignment and Buffer/Wire Sizing
We describe a new algorithm for floorplan evaluation using timing-driven buffered routing according to a prescribed buffer site map. Specifically, we describe a provably good mult...
Christoph Albrecht, Andrew B. Kahng, Ion I. Mandoi...