Sciweavers

5580 search results - page 632 / 1116
» Randomized priority algorithms
Sort
View
INFOCOM
2008
IEEE
15 years 11 months ago
Wireless Medium Access via Adaptive Backoff: Delay and Loss Minimization
— We consider packet transmission scheduling at the MAC-layer via adaptive backoff algorithms that are favorable in terms of queue occupancies in a wireless network. General netw...
Gardar Hauksson, Murat Alanyali
GLOBECOM
2007
IEEE
15 years 11 months ago
Centralized Scheduling Tree Construction Under Multi-Channel IEEE 802.16 Mesh Networks
—This paper focuses on routing tree construction problem and its influence on the performance of utilizing centralized scheduling in IEEE 802.16 mesh networks. We apply three rou...
Wenhua Jiao, Pin Jiang, Ruoju Liu, Ming Li
ICDCS
2007
IEEE
15 years 11 months ago
Distributed Slicing in Dynamic Systems
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
Antonio Fernández, Vincent Gramoli, Ernesto...
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
15 years 11 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
SPAA
2005
ACM
15 years 10 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi