Sciweavers

1574 search results - page 203 / 315
» Efficient QoS Routing
Sort
View
FPGA
2000
ACM
114views FPGA» more  FPGA 2000»
15 years 10 months ago
Generating highly-routable sparse crossbars for PLDs
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
Guy G. Lemieux, Paul Leventis, David M. Lewis
AHSWN
2010
102views more  AHSWN 2010»
15 years 6 months ago
A Framework for the Capacity Evaluation of Multihop Wireless Networks?
The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically...
Hervé Rivano, Fabrice Theoleyre, Fabrice Va...
FCSC
2007
131views more  FCSC 2007»
15 years 6 months ago
SONNET: subscription using path queries over structured overlay networks
Application-level content-based routing using XML is a key technology for decentralized publish/subscribe systems. In this paper, a new approach is proposed to support the efficien...
Weining Qian, Linhao Xu, Aoying Zhou, Minqi Zhou
CCR
2004
120views more  CCR 2004»
15 years 6 months ago
MAC-layer anycasting in ad hoc networks
A wireless ad hoc network is formed by a group of wireless hosts, without the use of any infrastructure. To enable communication, hosts cooperate among themselves to forward packet...
Romit Roy Choudhury, Nitin H. Vaidya
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 6 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg