Sciweavers

445 search results - page 71 / 89
» Maximizable Routing Metrics
Sort
View
ISPAN
1999
IEEE
15 years 1 months ago
Complete Exchange Algorithms in Wormhole-Routed Torus Networks: A Divide-and-Conquer Strategy
We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approac...
Si-Gwan Kim, Seung Ryoul Maeng, Jung Wan Cho
CLADE
2004
IEEE
15 years 1 months ago
An on Demand Path Marking and Capacity Reservation Method using Split Agent
Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. T...
Constandinos X. Mavromoustakis, Helen D. Karatza
66
Voted
ICCAD
2005
IEEE
110views Hardware» more  ICCAD 2005»
15 years 6 months ago
Computational geometry based placement migration
Placement migration is a critical step to address a variety of postplacement design closure issues, such as timing, routing congestion, signal integrity, and heat distribution. To...
Tao Luo, Haoxing Ren, Charles J. Alpert, David Zhi...
ICC
2009
IEEE
15 years 4 months ago
A Laplace Transform-Based Method to Stochastic Path Finding
—Finding the most likely path satisfying a requested additive Quality-of-Service (QoS) value, such as delay, when link metrics are defined as random variables by known probabili...
Suleyman Uludag, Ziyneti Elif Uludag, Klara Nahrst...
P2P
2008
IEEE
184views Communications» more  P2P 2008»
15 years 4 months ago
Ad Hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
Hasan Guclu, Durgesh Kumari, Murat Yuksel