397 search results - page 79 / 80 » Bounds on the Greedy Routing Algorithm for Array Networks |
SPAA
2005
ACM
13 years 11 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
TC
2008
13 years 6 months ago
2008
The design and performance of next-generation chip multiprocessors (CMPs) will be bound by the limited amount of power that can be dissipated on a single die. We present photonic n...
INFOCOM
2002
IEEE
13 years 11 months ago
2002
IEEE
Abstract— Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services...
SLIP
2003
ACM
13 years 11 months ago
2003
ACM
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
SIGECOM
2006
ACM
14 years 6 days 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...