Integer linear programming models and performance evaluation on wavelength rearrangement in a mesh-restored all-optical network

2006 ◽  
Vol 10 (2) ◽  
pp. 111-113 ◽  
Author(s):  
Mingzhou Jin ◽  
Rose Q. Hu ◽  
Zhuoxiu Zhang ◽  
Weiwei Hu
Keyword(s):  
Linear Programming ◽  
Performance Evaluation ◽  
Integer Linear Programming ◽  
Optical Network ◽  
Programming Models ◽  
All Optical ◽  
And Performance ◽  
All Optical Network

Transmission modes, cross talk requirements, and performance of the circuit-switched A-service in the all-optical network

2005 ◽  
Author(s):  
B.R. Hemenway ◽  
M.L. Stevens ◽  
S.A. Parikh ◽  
D. Marquis ◽  
E.A. Swanson ◽  
...  
Keyword(s):  
Cross Talk ◽  
Optical Network ◽  
Transmission Modes ◽  
All Optical ◽  
And Performance ◽  
All Optical Network

Mixed Integer Linear Programming Models for Selecting Ground-Level Ozone Control Strategies

2014 ◽  
Vol 19 (6) ◽  
pp. 503-514 ◽  
Author(s):  
Wei-Che Hsu ◽  
Jay M. Rosenberger ◽  
Neelesh V. Sule ◽  
Melanie L. Sattler ◽  
Victoria C. P. Chen
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Control Strategies ◽  
Ground Level ◽  
Programming Models ◽  
Mixed Integer ◽  
Ground Level Ozone ◽  
Ozone Control

Optimal Cost and Performance Evaluation of Various Protection Schemes for a Reliable All-Optical Subwavelength Switching Network

2016 ◽  
Vol 8 (11) ◽  
pp. 902
Author(s):  
Ion Popescu ◽  
Ahmed Triki ◽  
Esther Le Rouzic ◽  
Annie Gravey ◽  
Edoardo Bonetto ◽  
...  
Keyword(s):  
Performance Evaluation ◽  
Switching Network ◽  
Optimal Cost ◽  
All Optical ◽  
And Performance

scholarly journals Optimization of a k-covering of a bounded set with circles of two given radii

2021 ◽  
Vol 11 (1) ◽  
pp. 232-240
Author(s):  
Alexander V. Khorkov ◽  
Shamil I. Galiev
Keyword(s):  
Linear Programming ◽  
Numerical Method ◽  
Lower Bounds ◽  
Integer Linear Programming ◽  
Numerical Results ◽  
Programming Models ◽  
Bounded Set ◽  
The Given

Abstract A numerical method for investigating k-coverings of a convex bounded set with circles of two given radii is proposed. Cases with constraints on the distances between the covering circle centers are considered. An algorithm for finding an approximate number of such circles and the arrangement of their centers is described. For certain specific cases, approximate lower bounds of the density of the k-covering of the given domain are found. We use either 0–1 linear programming or general integer linear programming models. Numerical results demonstrating the effectiveness of the proposed methods are presented.

Merit of hybrid EDFA/Raman amplification in fixed-grid all-optical network exploiting multirate transponders

2017 ◽  
Vol 31 (1) ◽  
pp. e3383
Author(s):  
Arsalan Ahmad ◽  
Andrea Bianco ◽  
Hussein Chouman ◽  
Daniele DeTommas ◽  
Guido Marchetto ◽  
...  
Keyword(s):  
Optical Network ◽  
Raman Amplification ◽  
Fixed Grid ◽  
All Optical ◽  
All Optical Network
Sign in / Sign up

Export Citation Format

Share Document