366 search results - page 62 / 74 » A new model for selfish routing |
DAC
2008
ACM
15 years 10 months ago
2008
ACM
A fundamental problem in timing-driven physical synthesis is the reduction of critical paths in a design. In this work, we propose a powerful new technique that moves (and can als...
INFOCOM
2008
IEEE
15 years 3 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
ISCC
2005
IEEE
15 years 3 months ago
2005
IEEE
— The main characterisrics of ad hoc networks are the lack of predefined infrastructure and the dynamic topology. These characteristics present some new security vulnerabilities...
ICPP
1992
IEEE
15 years 1 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
ESORICS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Mix networks are a popular mechanism for anonymous Internet communications. By routing IP traffic through an overlay chain of mixes, they aim to hide the relationship bet...