Sciweavers

184 search results - page 28 / 37
» Survivable routing in WDM networks
Sort
View
NETWORKS
2010
14 years 8 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...
INFOCOM
2005
IEEE
15 years 3 months ago
Interference-aware routing in multihop wireless networks using directional antennas
— Recent research has shown that interference can make a significant impact on the performance of multihop wireless networks. Researchers have studied interference-aware topolog...
Jian Tang, Guoliang Xue, Christopher Chandler, Wei...
IWCMC
2006
ACM
15 years 3 months ago
Security aspects of inter-satellite links using neural networks
This paper presents a neural network model for routing in the space segment of a Satellite Personal Communication System. At first, a proper energy function is constructed from th...
Peter P. Stavroulakis, Ioannis Dimou, Harilaos G. ...
JCM
2007
105views more  JCM 2007»
14 years 9 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
GLOBECOM
2006
IEEE
15 years 3 months ago
Optimal Routing Between Alternate Paths With Different Network Transit Delays
— We consider the path-determination problem in Internet core routers that distribute flows across alternate paths leading to the same destination. We assume that the remainder ...
Essia Hamouda Elhafsi, Mart Molle