1578 search results - page 264 / 316 » Direct Routing: Algorithms and Complexity |
ASPDAC
2009
ACM
14 years 4 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
GLOBECOM
2008
IEEE
14 years 4 months ago
2008
IEEE
Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple des...
SIGCOMM
2006
ACM
14 years 3 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
SIGECOM
2006
ACM
14 years 3 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
GI
2004
Springer
14 years 3 months ago
2004
Springer
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...