Sciweavers

425 search results - page 17 / 85
» A Fully Dynamic Algorithm for Distributed Shortest Paths
Sort
View
JNW
2006
98views more  JNW 2006»
13 years 7 months ago
Efficient Distributed Algorithm for RWA Using Path Protection
A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such ...
Arunita Jaekel, Ying Chen
CIC
2006
102views Communications» more  CIC 2006»
13 years 9 months ago
On-line Algorithm for Server Selection of Video Streaming over P2P Networks
We consider a video streaming application over P2P networks and introduce the P2P on-line server selection problem. This task is related to the classic K-server problem, known fro...
Hao Wang, Andras Farago
ICPP
2009
IEEE
14 years 2 months ago
Generalizing k-Betweenness Centrality Using Short Paths and a Parallel Multithreaded Implementation
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
Karl Jiang, David Ediger, David A. Bader
HPDC
2009
IEEE
14 years 2 months ago
Maintaining reference graphs of globally accessible objects in fully decentralized distributed systems
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
Björn Saballus, Thomas Fuhrmann
AINA
2010
IEEE
13 years 12 months ago
A Fully Dynamic and Self-Stabilizing TDMA Scheme for Wireless Ad-hoc Networks
One important challenge in wireless ad hoc networks is to achieve collision free communication. Many MAC layer protocols have been proposed by considering various communication mod...
Bezawada Bruhadeshwar, Kishore Kothapalli, Indira ...