Sciweavers

295 search results - page 21 / 59
» A New Node Centroid Algorithm for Bandwidth Minimization
Sort
View
SODA
2004
ACM
120views Algorithms» more  SODA 2004»
15 years 4 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
Prasanna Ganesan, Gurmeet Singh Manku
WMCSA
1999
IEEE
15 years 7 months ago
Ad-hoc On-Demand Distance Vector Routing
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In th...
Charles E. Perkins, Elizabeth M. Belding-Royer
JCM
2006
89views more  JCM 2006»
15 years 3 months ago
A Premium Traffic Management in DiffServ Through End-to-End Delay Budget Partitioning
Our novel Call Admission Control (CAC) scheme [1], [2] determines the number of Expedited Forwarding (EF) (Premium) flows accepted, based on e2e available bandwidth measurement. Ho...
Hamada Alshaer, Eric Horlait
CVGIP
2002
126views more  CVGIP 2002»
15 years 2 months ago
Dual Mesh Resampling
The dual of a 2-manifold polygonal mesh without boundary is commonly defined as another mesh with the same topology (genus) but different connectivity (vertex-face incidence), in ...
Gabriel Taubin
JCO
2006
126views more  JCO 2006»
15 years 3 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li