Sciweavers

46 search results - page 7 / 10
» Scalable routing on flat names
Sort
View
SSD
2005
Springer
188views Database» more  SSD 2005»
14 years 2 months ago
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
Qingsong Lu, Betsy George, Shashi Shekhar
PE
2006
Springer
127views Optimization» more  PE 2006»
13 years 8 months ago
Cycloid: A constant-degree and lookup-efficient P2P overlay network
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(lo...
Haiying Shen, Cheng-Zhong Xu, Guihai Chen
DAC
2004
ACM
14 years 9 months ago
Profile-guided microarchitectural floorplanning for deep submicron processor design
As process technology migrates to deep submicron with feature size less than 100nm, global wire delay is becoming a major hindrance in keeping the latency of intra-chip communicat...
Mongkol Ekpanyapong, Jacob R. Minz, Thaisiri Watew...
INFOCOM
2009
IEEE
14 years 3 months ago
On the Effectiveness of Measurement Reuse for Performance-Based Detouring
— For both technological and economic reasons, the default path between two end systems in the wide-area Internet can be suboptimal. This observation has motivated a number of sy...
David R. Choffnes, Fabian E. Bustamante
COMCOM
2007
111views more  COMCOM 2007»
13 years 8 months ago
Failover, load sharing and server architecture in SIP telephony
We apply some of the existing web server redundancy techniques for high service availability and scalability to the relatively new IP telephony context. The paper compares various...
Kundan Singh, Henning Schulzrinne