Sciweavers

953 search results - page 160 / 191
» A Heuristic for Channel Routing
Sort
View
JCM
2007
105views more  JCM 2007»
13 years 7 months ago
A Flexible Wavelength Converter Placement Scheme for Guaranteed Wavelength Usage
Abstract— Wavelength is one of the most important resources in Wavelength Division Multiplexing(WDM) networks. In optical routing, we are given a set of communication paths (or l...
Can Fang, Chor Ping Low
TON
2008
125views more  TON 2008»
13 years 7 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
AEI
1999
120views more  AEI 1999»
13 years 7 months ago
Genetic algorithms for designing multihop lightwave network topologies
Multihop lightwave networks are a means of utilizing the large bandwidth of optical fibers. In these networks, each node has a fixed number of transmitters and receivers connected...
Cenk Gazen, Cem Ersoy
FGCS
2008
95views more  FGCS 2008»
13 years 6 months ago
SemreX: Efficient search in a semantic overlay for literature retrieval
The World Wide Web is growing at such a pace that even the biggest centralized search engines are able to index only a small part of the available documents on the Internet. The d...
Hai Jin, Hanhua Chen
NETWORKS
2010
13 years 6 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...