Sciweavers

236 search results - page 38 / 48
» On the Vehicle Routing Problem with lower bound capacities
Sort
View
TPDS
2008
124views more  TPDS 2008»
14 years 11 months ago
TROP: A Novel Approximate Link-State Dissemination Framework For Dynamic Survivable Routing in MPLS Networks
In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in Multi-Protocol Label Switching (MPLS) ne...
János Tapolcai, Pin-Han Ho, Anwar Haque
INFOCOM
2010
IEEE
14 years 10 months ago
Value-aware Resource Allocation for Service Guarantees in Networks
—The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixe...
Parimal Parag, Srinivas Shakkottai, Jean-Fran&cced...
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
15 years 4 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
DAC
1997
ACM
15 years 3 months ago
System-Level Synthesis of Low-Power Hard Real-Time Systems
We present a system-level approach for power optimization under a set of user specified costs and timing constraints of hard real-time designs. The approach optimizes all three d...
Darko Kirovski, Miodrag Potkonjak
ICDCS
2006
IEEE
15 years 5 months ago
Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks
Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of ne...
Haiying Shen, Cheng-Zhong Xu