Sciweavers

425 search results - page 34 / 85
» A Fully Dynamic Algorithm for Distributed Shortest Paths
Sort
View
ICDCS
1999
IEEE
14 years 1 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
SIGCSE
2002
ACM
172views Education» more  SIGCSE 2002»
13 years 8 months ago
Simulation of load balancing algorithms: a comparative study
This article introduces a new load balancing algorithm, called diffusive load balancing, and compares its performance with three other load balancing algorithms: static, round rob...
Milan E. Soklic
COMCOM
2004
117views more  COMCOM 2004»
13 years 8 months ago
Dynamic bandwidth allocation in multi-class connection-oriented networks
Multi-class network is becoming a more attractive solution to provide Quality-of-Service guarantee, as more quality-demanding applications are emerging. This research considers ne...
Samer Taha, Mohsen Kavehrad
ICPP
2006
IEEE
14 years 2 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
INFOCOM
2010
IEEE
13 years 7 months ago
Distributed Monitoring and Aggregation in Wireless Sensor Networks
— Self-monitoring the sensor statuses such as liveness, node density and residue energy is critical for maintaining the normal operation of the sensor network. When building the ...
Changlei Liu, Guohong Cao