Sciweavers

2808 search results - page 1 / 562
» Routing betweenness centrality
Sort
View
JACM
2010
92views more  JACM 2010»
13 years 3 months ago
Routing betweenness centrality
Shlomi Dolev, Yuval Elovici, Rami Puzis
TON
2008
120views more  TON 2008»
13 years 4 months ago
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
Miriam Allalouf, Yuval Shavitt
ICC
2011
IEEE
257views Communications» more  ICC 2011»
12 years 4 months ago
Increasing the Lifetime of Roadside Sensor Networks Using Edge-Betweenness Clustering
Abstract—Wireless Sensor Networks are proven highly successful in many areas, including military and security monitoring. In this paper, we propose a method to use the edge–bet...
Joakim Flathagen, Ovidiu Valentin Drugan, Paal E. ...
ESWS
2005
Springer
13 years 10 months ago
Optimally Distributing Interactions Between Composed Semantic Web Services
When information services are organized to provide some composed functionality, their interactions can be formally represented as workflows. Traditionally, workflows are executed...
Ion Constantinescu, Walter Binder, Boi Faltings
IPPS
1999
IEEE
13 years 9 months ago
Oblivious Deadlock-Free Routing in a Faulty Hypercube
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
Jin Suk Kim, Eric Lehman, Frank Thomson Leighton