1259 search results - page 192 / 252 » On Survivable Access Network Design: Complexity and Algorith... |
175
click to vote
LCN
2006
IEEE
16 years 5 days ago
2006
IEEE
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
146
click to vote
INFOCOM
2006
IEEE
16 years 5 days ago
2006
IEEE
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
146
click to vote
CONEXT
2008
ACM
15 years 8 months ago
2008
ACM
Today's Internet's routing paths are inefficient with respect to both connectivity and the market for interconnection. The former manifests itself via needlessly long pa...
181
click to vote
MM
2004
ACM
15 years 11 months ago
2004
ACM
A novel solution to the reliable multicast problem is the “digital fountain” approach, in which data is encoded with an erasure protection code before transmission, and receiv...
185
click to vote
CIDM
2007
IEEE
15 years 6 months ago
2007
IEEE
Data stream applications like sensor network data, click stream data, have data arriving continuously at high speed rates and require online mining process capable of delivering c...