Article
Licensed
Unlicensed
Requires Authentication
Routing Algorithm based on Minimum Spanning Tree and Minimum Cost Flow for Hybrid Wireless-optical Broadband Access Network
-
Zichun Le
,
Kaihua Suo
Published/Copyright:
March 22, 2012
Abstract
In order to minimize the average end to end delay for data transporting in hybrid wireless optical broadband access network, a novel routing algorithm named MSTMCF (minimum spanning tree and minimum cost flow) is devised. The routing problem is described as a minimum spanning tree and minimum cost flow model and corresponding algorithm procedures are given. To verify the effectiveness of MSTMCF algorithm, extensively simulations based on OWNS have been done under different types of traffic source.
Keywords.: Routing; wireless optical broadband access network; delay; minimum spanning tree; minimum cost flow
Received: 2011-03-24
Accepted: 2011-09-13
Published Online: 2012-03-22
Published in Print: 2012-03-08
©2012 by Walter de Gruyter Berlin Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Masthead
- Editorial
- Photo Parametric Amplifier Using Up & Down Converter Configuration for Optical Receiver
- Monitoring and Compensation of Optical Telecommunication Channels by using Optical Add Drop Multiplexers for Optical OFDM System
- Laser Diode to Single Mode Circular Core Graded Index Fiber Excitation via Hemispherical Microlens on the Fiber Tip: Identification of Suitable Refractive Index Profile for Maximum Efficiency with Consideration for Allowable Aperture
- Routing Algorithm based on Minimum Spanning Tree and Minimum Cost Flow for Hybrid Wireless-optical Broadband Access Network
- Performance Comparison of Coherent Time-spreading and Spectral Phase Encoding OCDMA Systems
- Development of a New Class of Zero Cross Correlation Codes for Optical CDMA Systems
- Distribution of DVB-C Channels over an Externally Modulated Optical Link
- Self-Phase Modulation Effect on Performance of 40 Gbit/s Optical Duty-Cycle Division Multiplexing Technique
- A Recursive Algorithm for a Non-uniform Amplitude Beam Propagating Through a Sub-wavelength Grating
- Re-evaluation of “;The Propagation of Radiation in the Spherical Wave Form”
Keywords for this article
Routing;
wireless optical broadband access network;
delay;
minimum spanning tree;
minimum cost flow
Articles in the same Issue
- Masthead
- Editorial
- Photo Parametric Amplifier Using Up & Down Converter Configuration for Optical Receiver
- Monitoring and Compensation of Optical Telecommunication Channels by using Optical Add Drop Multiplexers for Optical OFDM System
- Laser Diode to Single Mode Circular Core Graded Index Fiber Excitation via Hemispherical Microlens on the Fiber Tip: Identification of Suitable Refractive Index Profile for Maximum Efficiency with Consideration for Allowable Aperture
- Routing Algorithm based on Minimum Spanning Tree and Minimum Cost Flow for Hybrid Wireless-optical Broadband Access Network
- Performance Comparison of Coherent Time-spreading and Spectral Phase Encoding OCDMA Systems
- Development of a New Class of Zero Cross Correlation Codes for Optical CDMA Systems
- Distribution of DVB-C Channels over an Externally Modulated Optical Link
- Self-Phase Modulation Effect on Performance of 40 Gbit/s Optical Duty-Cycle Division Multiplexing Technique
- A Recursive Algorithm for a Non-uniform Amplitude Beam Propagating Through a Sub-wavelength Grating
- Re-evaluation of “;The Propagation of Radiation in the Spherical Wave Form”
