Sciweavers

365 search results - page 57 / 73
» Fast construction of overlay networks
Sort
View
ICC
2008
IEEE
167views Communications» more  ICC 2008»
15 years 6 months ago
Traceroute-Based Topology Inference without Network Coordinate Estimation
Abstract— Underlay topology information is important to construct efficient overlay networks. To achieve end-to-end network topology inference among a group of hosts, traceroute...
Xing Jin, Wanqing Tu, S.-H. Gary Chan
GMAI
2006
IEEE
126views Solid Modeling» more  GMAI 2006»
15 years 5 months ago
Generating Surface Textures based on Cellular Networks
This paper describes a method allowing the automatic multi-texturing and simulation of surface imperfections based on a cellular network. In this representation, networks of conne...
Stéphane Gobron, Denis Finck
IPPS
2006
IEEE
15 years 5 months ago
Node-disjoint paths in hierarchical hypercube networks
The hierarchical hypercube network is suitable for massively parallel systems. An appealing property of this network is the low number of connections per processor, which can faci...
Ruei-Yu Wu, J. G. Chang, Gen-Huey Chen
FSTTCS
2004
Springer
15 years 5 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
ICDCS
1998
IEEE
15 years 4 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