Sciweavers

906 search results - page 71 / 182
» Linking Theories of Concurrency
Sort
View
CDC
2009
IEEE
15 years 10 months ago
On the queue-overflow probabilities of distributed scheduling algorithms
Abstract-- In this paper, we are interested in using largedeviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless sch...
Can Zhao, Xiaojun Lin
NETWORKING
2004
15 years 7 months ago
Reducing Packet-Loss by Taking Long-Range Dependences into Account
We show that the "fractal" behavior of Internet traffic can be efficiently and practically employed to significantly reduce packetloss. Thanks to recent advances in the t...
J. Ignacio Alvarez-Hamelin, Pierre Fraigniaud
INFOCOM
2011
IEEE
14 years 10 months ago
On the achievable throughput of CSMA under imperfect carrier sensing
Abstract—Recently, it has been shown that a simple, distributed CSMA algorithm is throughput-optimal. However, throughput-optimality is established under the perfect or ideal car...
Tae Hyun Kim 0001, Jian Ni, R. Srikant, Nitin H. V...
CACM
1998
103views more  CACM 1998»
15 years 5 months ago
The Virtual Design Team
The long range goal of the “Virtual Design Team” (VDT) research program is to develop computational tools to analyze decision making and communication behavior and thereby to ...
John C. Kunz, Tore R. Christiansen, Geoff P. Cohen...
CASES
2005
ACM
15 years 8 months ago
Software-directed power-aware interconnection networks
Interconnection networks have been deployed as the communication fabric in a wide range of parallel computer systems. With recent technological trends allowing growing quantities ...
Vassos Soteriou, Noel Eisley, Li-Shiuan Peh