Sciweavers

13214 search results - page 357 / 2643
» Pseudorandomness for network algorithms
Sort
View
LCN
1999
IEEE
15 years 11 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen
SPAA
2004
ACM
16 years 7 days ago
Improved combination of online algorithms for acceptance and rejection
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
David P. Bunde, Yishay Mansour
SPAA
2003
ACM
16 years 1 days ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd
AICT
2006
IEEE
142views Communications» more  AICT 2006»
16 years 26 days ago
An Inter-Piconet Scheduling Algorithm for Bluetooth Scatternets
Bluetooth is a wireless specification delivering short-range radio communication between electronic devices that are equipped with specialized Bluetooth chips. It lets nearly all ...
Suman Saha, Mitsuji Matsumoto
DSD
2006
IEEE
159views Hardware» more  DSD 2006»
16 years 26 days ago
Deadlock Free Routing Algorithms for Mesh Topology NoC Systems with Regions
Region concept helps to accommodate cores larger than the tile size in mesh topology NoC architectures. In addition, it offers many new opportunities for NoC design, as well as pr...
Rickard Holsmark, Maurizio Palesi, Shashi Kumar