Sciweavers

14 search results - page 2 / 3
» Routing Metric Designs for Greedy, Face and Combined-Greedy-...
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 23 days ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
ANTSW
2006
Springer
13 years 11 months ago
An Analysis of the Different Components of the AntHocNet Routing Algorithm
Abstract. Mobile ad hoc networks are a class of highly dynamic networks. In previous work, we developed a new routing algorithm, called AntHocNet, for these challenging network env...
Frederick Ducatelle, Gianni Di Caro, Luca Maria Ga...
HPCA
2008
IEEE
14 years 7 months ago
Regional congestion awareness for load balance in networks-on-chip
Interconnection networks-on-chip (NOCs) are rapidly replacing other forms of interconnect in chip multiprocessors and system-on-chip designs. Existing interconnection networks use...
Paul Gratz, Boris Grot, Stephen W. Keckler
SLIP
2006
ACM
14 years 1 months ago
A tale of two nets: studies of wirelength progression in physical design
At every stage in physical design, engineers are faced with many different objectives and tools to develop, optimize, and evaluate their design. Each choice of a tool or an objec...
Andrew B. Kahng, Sherief Reda
ICDCS
2007
IEEE
14 years 1 months ago
Protocol Design for Dynamic Delaunay Triangulation
Delaunay triangulation (DT) is a useful geometric structure for networking applications. In this paper we investigate the design of join, leave, and maintenance protocols to const...
Dong-Young Lee, Simon S. Lam