3116 search results - page 176 / 624 » Design and implementation of network puzzles |
163
click to vote
SIGCOMM
2009
ACM
16 years 1 months ago
2009
ACM
This paper considers the requirements for a scalable, easily manageable, fault-tolerant, and efficient data center network fabric. Trends in multi-core processors, end-host virtua...
325
click to vote
ASUNAM
2011
IEEE
14 years 6 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
207
click to vote
CASES
2006
ACM
15 years 10 months ago
2006
ACM
Packet classification is crucial for the Internet to provide more value-added services and guaranteed quality of service. Besides hardware-based solutions, many software-based cla...
193
click to vote
ISCA
2005
IEEE
16 years 3 days ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
173
click to vote
INFOCOM
2007
IEEE
16 years 24 days ago
2007
IEEE
—In recent literature, network coding has emerged as a promising information theoretic approach to improve the performance of both peer-to-peer and wireless networks. It has been...