Sciweavers

4037 search results - page 43 / 808
» Routing without ordering
Sort
View
COMCOM
2004
92views more  COMCOM 2004»
13 years 7 months ago
Benefits of traffic engineering using QoS routing schemes and network controls
We demonstrate the benefits of traffic engineering by studying three realistic network models derived from an actual service provider network. We evaluate traffic engineering in t...
Shekhar Srivastava, Balaji Krithikaivasan, Cory C....
AAECC
2007
Springer
113views Algorithms» more  AAECC 2007»
14 years 1 months ago
Generalized Sudan's List Decoding for Order Domain Codes
Abstract. We generalize Sudan’s list decoding algorithm without multiplicity to evaluation codes coming from arbitrary order domains. The number of correctable errors by the prop...
Olav Geil, Ryutaroh Matsumoto
DISOPT
2006
118views more  DISOPT 2006»
13 years 7 months ago
Improved bounds for vehicle routing solutions
We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then...
Agustín Bompadre, Moshe Dror, James B. Orli...
ICNP
1999
IEEE
14 years 9 hour ago
Policy Disputes in Path-Vector Protocols
The Border Gateway Protocol, BGP, is currently the only interdomain routing protocol employed on the Internet. As required of any interdomain protocol, BGP allows policy-based met...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
OSDI
1996
ACM
13 years 9 months ago
Safe Kernel Extensions Without Run-Time Checking
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel r...
George C. Necula, Peter Lee