Sciweavers

916 search results - page 82 / 184
» Distributed Construction of a Fault-Tolerant Network from a ...
Sort
View
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 6 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
COMCOM
2004
89views more  COMCOM 2004»
15 years 6 months ago
QROUTE: an QoS-guaranteed multicast routing
In this paper, we propose QROUTE, an integrated framework for QoS-guaranteed multicast routing, in which a feasible multicast tree meeting multiple QoS constraints can be construc...
Jinquan Dai, Touchai Angchuan, Hung Keng Pung
AINTEC
2006
Springer
15 years 10 months ago
A Topology-Aware Overlay Multicast Approach for Mobile Ad-Hoc Networks
AOMP (Ad-hoc Overlay Multicast Protocol) is a novel approach for application-layer multicast in ad-hoc networks. We introduce in this paper a new algorithm that exploits a few prop...
Mohamed Ali Kâafar, Cyrine Mrabet, Thierry T...
IPPS
2007
IEEE
16 years 18 days ago
Online Aggregation over Trees
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula
CONEXT
2007
ACM
15 years 10 months ago
Rethinking internet traffic management: from multiple decompositions to a practical protocol
In the Internet today, traffic management spans congestion control (at end hosts), routing protocols (on routers), and traffic engineering (by network operators). Historically, th...
Jiayue He, Martin Suchara, Ma'ayan Bresler, Jennif...