Sciweavers

846 search results - page 44 / 170
» The stability of paths in a dynamic network
Sort
View
INFOCOM
2011
IEEE
14 years 3 months ago
Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints
— We consider a peer-to-peer network where nodes can send and receive files amongst their peers. File requests are generated randomly, and each new file can correspond to a dif...
Michael J. Neely, Leana Golubchik
INFOCOM
2007
IEEE
15 years 6 months ago
Joint Multi-Channel Link Layer and Multi-Path Routing Design for Wireless Mesh Networks
— In recent years, the wireless mesh network (WMN) attracts the interest of many people as a new broadband Internet access technology. However, increasing throughput is still an ...
Wai-Hong Tam, Yu-Chee Tseng
INFOCOM
1991
IEEE
15 years 3 months ago
On Multicast Path Finding Algorithms
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuri...
Ching-Hua Chow
INFOCOM
1997
IEEE
15 years 4 months ago
Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks
The paper addresses the issue of minimizing the number of nodes involved in routing over a multicast tree and in the maintenance of such a tree in a datagram network. It presents a...
Ehud Aharoni, Reuven Cohen
INFOCOM
2003
IEEE
15 years 5 months ago
Network Management Information For Light-Path Assessment: Trade-off between Performance and Complexity
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
Guanglei Liu, Chuanyi Ji, Vincent W. S. Chan