Sciweavers

94 search results - page 3 / 19
» An Integer Linear Programming Based Routing Algorithm for Fl...
Sort
View
INFOCOM
1998
IEEE
13 years 9 months ago
Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
Rajesh M. Krishnaswamy, Kumar N. Sivarajan
GLOBECOM
2007
IEEE
13 years 11 months ago
Non-Cooperative Design of Translucent Networks
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
Benoît Châtelain, Shie Mannor, Fran&cc...
ICC
2007
IEEE
123views Communications» more  ICC 2007»
13 years 11 months ago
A New ILP-Based p-Cycle Construction Algorithm without Candidate Cycle Enumeration
—The notion of p-cycle (Preconfigured Protection Cycle) allows capacity efficient schemes to be designed for fast span protection in WDM mesh networks. Conventional p-cycle const...
Bin Wu, Kwan Lawrence Yeung, King-Shan Lui, Shizho...
DAC
2006
ACM
14 years 6 months ago
BoxRouter: a new global router based on box expansion and progressive ILP
In this paper, we propose a new global router, BoxRouter, powered by the concept of box expansion and progressive integer linear programming (ILP). BoxRouter first uses a simple P...
Minsik Cho, David Z. Pan
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 2 days ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...