Sciweavers

4781 search results - page 99 / 957
» Online algorithms for network design
Sort
View
CONEXT
2006
ACM
15 years 7 months ago
Using forgetful routing to control BGP table size
Running the Border Gateway Protocol (BGP), the Internet’s interdomain routing protocol, consumes a large amount of memory. A BGP-speaking router typically stores one or more rou...
Elliott Karpilovsky, Jennifer Rexford
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 1 months ago
Real-Time Multi-path Tracking of Probabilistic Available Bandwidth
Applications such as traffic engineering and network provisioning can greatly benefit from knowing, in real time, what is the largest input rate at which it is possible to transmit...
Frederic Thouin, Mark Coates, Michael Rabbat
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
15 years 2 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...
AAIM
2007
Springer
120views Algorithms» more  AAIM 2007»
15 years 5 months ago
Online OVSF Code Assignment with Resource Augmentation
Abstract. Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband Code-Division MultipleAccess (W-CDMA) systems, which play an important ro...
Francis Y. L. Chin, Yong Zhang, Hong Zhu
ICMLA
2008
15 years 2 months ago
Towards On-line Treatment Verification Using cine EPID for Hypofractionated Lung Radiotherapy
We propose a novel approach for on-line treatment verification using cine EPID (Electronic Portal Imaging Device) images for hypofractionated lung radiotherapy based on a machine ...
Xiaoli Tang, Tong Lin, Steve B. Jiang