Sciweavers

1594 search results - page 168 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
SAPIR
2004
Springer
15 years 8 months ago
Probabilistic Routing in Intermittently Connected Networks
We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at...
Anders Lindgren, Avri Doria, Olov Schelén
LCN
2000
IEEE
15 years 7 months ago
Load-Balanced Routing and Scheduling for Real-Time Traffic in Packet-Switch Networks
Future computer networks are expected to carry bursty real-time traffic with stringent time-delay requirements. Popular shortest-path routing protocols have the disadvantage of ca...
Sangman Bak, Albert Mo Kim Cheng, Jorge Arturo Cob...
123
Voted
BROADNETS
2004
IEEE
15 years 7 months ago
Capacity and Delay Tradeoffs for Ad-Hoc Mobile Networks
We consider the throughput/delay tradeoffs for scheduling data transmissions in a mobile ad hoc network. To reduce delays in the network, each user sends redundant packets along mu...
Michael J. Neely, Eytan Modiano
126
Voted
CCR
2002
62views more  CCR 2002»
15 years 3 months ago
An enforced inter-admission delay performance-driven connection admission control algorithm
Connection Admission Control (CAC) is an important function in a computer network that supports Quality of Service (QoS). The function of CAC is to decide whether a new connection...
Stanislav Belenki
114
Voted
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 10 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen