Sciweavers

339 search results - page 38 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
CCR
2000
96views more  CCR 2000»
13 years 8 months ago
Decentralized optimal traffic engineering in the internet
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...
Constantino M. Lagoa, Hao Che
LCN
2006
IEEE
14 years 2 months ago
Computing Real Time Jobs in P2P Networks
— 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...
Jingnan Yao, Jian Zhou, Laxmi N. Bhuyan
ICUMT
2009
13 years 6 months ago
A scalable based multicast model for P2P Conferencing applications
Multicast conferencing is a rapidly-growing area of Internet use. Audio, video and other media such as shared whiteboard data can be distributed efficiently between groups of confe...
Mourad Amad, Zahir Haddad, Lachemi Khenous, Kamal ...
SIGMETRICS
2003
ACM
106views Hardware» more  SIGMETRICS 2003»
14 years 1 months ago
On the effectiveness of movement prediction to reduce energy consumption in wireless communication
—Node movement can be exploited to reduce the energy consumption of wireless network communication. The strategy consists in delaying communication until a mobile node moves clos...
Srijan Chakraborty, David K. Y. Yau, John C. S. Lu...
CCGRID
2008
IEEE
14 years 3 months ago
A Stable Broadcast Algorithm
—Distributing large data to many nodes, known as a broadcast or a multicast, is an important operation in parallel and distributed computing. Most previous broadcast algorithms e...
Kei Takahashi, Hideo Saito, Takeshi Shibata, Kenji...