Sciweavers

410 search results - page 42 / 82
» Upgrading Shortest Paths in Networks
Sort
View
GLOBECOM
2009
IEEE
14 years 11 months ago
Minimum-Length Scheduling for Multicast Traffic under Channel Uncertainty
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...
Anna Pantelidou, Anthony Ephremides
INFOCOM
2009
IEEE
15 years 8 months ago
A Queueing Model Framework of PCE-Based Inter-Area Path Computation
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
Juanjuan Yu, Yue He, Kai Wu, Marco Tacca, Andrea F...
SIMUTOOLS
2008
15 years 2 months ago
An OMNeT++ model for the evaluation of OBS routing strategies
Optical Burst Switching (OBS) has been proposed as a costeffective paradigm for supporting, with adequate flexibility, the increasingly high transmission capacity required by the ...
A. L. Barradas, M. C. R. Medeiros
ICDE
2006
IEEE
160views Database» more  ICDE 2006»
16 years 2 months ago
Surface k-NN Query Processing
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu 0003...
HICSS
2003
IEEE
148views Biometrics» more  HICSS 2003»
15 years 6 months ago
Bluenet II - A Detailed Realization of the Algorithm and Performance
The recent interest in ad hoc networks, in general, and in the Bluetooth technology, in particular, has stimulated much research in algorithms for topology control of such network...
Zhifang Wang, Zygmunt J. Haas, Robert J. Thomas