Sciweavers

479 search results - page 73 / 96
» cn 2008
Sort
View
CN
2002
98views more  CN 2002»
14 years 9 months ago
New models and algorithms for programmable networks
In todays IP networks most of the network control and management tasks are performed at the end points. As a result, many important network functions cannot be optimized due to la...
Danny Raz, Yuval Shavitt
CN
2007
90views more  CN 2007»
14 years 9 months ago
A scalable solution for engineering streaming traffic in the future Internet
As traffic on the Internet continues to grow exponentially, there is a real need to solve scalability and traffic engineering simultaneously — specifically, without using over-p...
Mario Baldi, Guido Marchetto, Yoram Ofek
CN
2010
134views more  CN 2010»
14 years 8 months ago
TCP Libra: Derivation, analysis, and comparison with other RTT-fair TCPs
— The Transmission Control Protocol (TCP), the most widely used transport protocol over the Internet, has been advertised to implement fairness between flows competing for the s...
Gustavo Marfia, Claudio E. Palazzi, Giovanni Pau, ...
CORR
2008
Springer
92views Education» more  CORR 2008»
14 years 10 months ago
A connection between palindromic and factor complexity using return words
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...
Michelangelo Bucci, Alessandro De Luca, Amy Glen, ...
CN
2008
126views more  CN 2008»
14 years 10 months ago
Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
Pallab Datta, Arun K. Somani