Sciweavers

593 search results - page 52 / 119
» Optimal Distributed Multicast Routing using Network Coding
Sort
View
INFOCOM
1997
IEEE
15 years 6 months ago
A Distributed Algorithm for Delay-Constrained Unicast Routing
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
Hussein F. Salama, Douglas S. Reeves, Yannis Vinio...
HIPC
2003
Springer
15 years 7 months ago
POMA: Prioritized Overlay Multicast in Ad Hoc Environments
Abstract: Overlay Multicast networks in mobile ad-hoc environments have received much attention due to their increasing number of practical applications. Although overlay multicast...
Abhishek P. Patil, Yunhao Liu, Lionel M. Ni, Li Xi...
123
Voted
ICDCS
1998
IEEE
15 years 6 months ago
Improved Lightpath (Wavelength) Routing in Large WDM Networks
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
Weifa Liang, George Havas, Xiaojun Shen
148
Voted
CLADE
2004
IEEE
15 years 6 months ago
An on Demand Path Marking and Capacity Reservation Method using Split Agent
Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. T...
Constandinos X. Mavromoustakis, Helen D. Karatza
SIGOPS
2010
127views more  SIGOPS 2010»
15 years 24 days ago
Optimizing information flow in the gossip objects platform
Gossip-based protocols are commonly used for diffusing information in large-scale distributed applications. GO (Gossip Objects) is a per-node gossip platform that we developed in...
Ymir Vigfusson, Ken Birman, Qi Huang, Deepak P. Na...