Sciweavers

3678 search results - page 511 / 736
» On the Stable Paths Problem
Sort
View
PDP
2005
IEEE
15 years 10 months ago
Some Solutions for Peer-to-Peer Global Computing
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...
Guillaume Jourjon, Didier El Baz
RTAS
2005
IEEE
15 years 10 months ago
Scalable QoS-Based Resource Allocation in Hierarchical Networked Environment
In this paper, we study the problem of allocating end-toend bandwidth to each of multiple traffic flows in a largescale network. We adopt the QoS-based Resource Allocation Model...
Sourav Ghosh, Ragunathan Rajkumar, Jeffery P. Hans...
DAC
2004
ACM
15 years 10 months ago
Optical proximity correction (OPC): friendly maze routing
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...
Li-Da Huang, Martin D. F. Wong
INFOCOM
2003
IEEE
15 years 10 months ago
The Impact of Correlated Link Weights on QoS Routing
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
Fernando A. Kuipers, Piet Van Mieghem
129
Voted
COMPGEOM
2010
ACM
15 years 9 months ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...