10 search results - page 2 / 2 » Randomization does not reduce the average delay in parallel ... |
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
—Burst loss and delay are two main issues in optical hop-count. Network diameter is the hop-count of the shortest burst switching (OBS) networks. In OBS, if the hop-count path be...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—In this paper, we propose a novel transport protocol that effectively utilizes available bandwidth and diversity gains provided by heterogeneous, highly lossy paths. Our Multi-P...
EUROPAR
2003
Springer
13 years 10 months ago
2003
Springer
Recently, a server-less video-on-demand architecture has been proposed which can completely eliminate costly dedicated video servers and yet is highly scalable and reliable. Due to...
CLUSTER
2002
IEEE
13 years 4 months ago
2002
IEEE
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
ISCA
2005
IEEE
13 years 10 months 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...