Deflection Routing for Optical Bursts Considering Possibility of Contention at Downstream Nodes(Network)
スポンサーリンク
概要
- 論文の詳細を見る
Deflection routing is one of the promising approaches to resolve contention in the optical burst switching networks. In the conventional deflection routing scheme, optical bursts may be unable to traverse the route evaluated to select an outgoing link because of the contention at succeeding downstream transit nodes. As a result, the optical bursts may traverse a different route resulting in a long distance or decreased performance. This paper proposes a deflection routing scheme that considers the possibility of the contention at downstream nodes. This scheme utilizes the "expected route distance" instead of the static route distance toward a destination node. The expected route distance considers the possibility of contention at each downstream transit node and is calculated using measured link blocking probabilities at each downstream transit node. The selection priority of each outgoing link is given dynamically based on its expected route distance toward a destination node. By considering the possibility of contention at downstream nodes, a routing scheme with high performance can be realized. The loss rate of optical bursts is improved when an imbalanced load is applied to the network, and the loss rate of optical bursts is also improved when the network includes links with extremely different distances.
- 社団法人電子情報通信学会の論文
- 2005-09-01
著者
関連論文
- BS-7-10 MIMO estimation for polarization division multiplexing in fiber-optic OFDM transmission systems
- CS-7-5 Optical OFDM Transmission Technologies
- B-10-24 Carrier-to-signal power ratio in fiber-optic SSB-OFDM transmission systems(B-10.光通信システムB(光通信),一般講演)
- Performance Analysis of a Polarizer-Based PMD Compensator and Its Applicability to an Installed SMF WDM System(Fiber-Optic Transmission for Communications)
- A Distributed Route Computation Method to Promote Bandwidth Sharing between Backup Lightpaths(Next Generation Photonic Network Technologies)
- An Efficient Multicast Forwarding Method for Optical Bursts under Restricted Number of Burst Replicas
- Routing and Re-Routing of Reliable Label Switched Paths with Variable Bandwidths in MPLS over Optical Networks(Optical Network Operation)(Next Generation Networks Software)
- An Inter-Domain Path Computation Scheme Adaptive to Traffic Load in Domains
- Proposal of a Price-Based Inter-AS Policy Routing to Improve ASes' Profits (Special Issue on Internet Technology II)
- BS-4-15 Enhanced Communication Services Based on User Context Management(BS-4. System, control and design technologies for emerging network)
- Cost Analysis in Survivable IP/MPLS over WDM Networks(Internet)
- A Decentralized Optical Bursts Routing Based on Adaptive Load Splitting into Pre-Calculated Multiple Paths(Traffic Issues, Autonomous Decentralized Systems)
- Grid Network Service-Web Services Interface Version 2 Achieving Scalable Reservation of Network Resources Across Multiple Network Domains via Management Plane
- Optimum Light-Path Pricing in Survivable Optical Networks(Photonic IP Network Technologies for Next Generation Broadband Access)
- The Evaluation for Required Bit Resolution of Digital-Analog-Converter in Optical OFDM Signal Generation
- Optical Network Design Considering Transmission Equipment Failure and the Maintenance of Two Transmission Lines(Fiber-Optic Transmission for Communications)
- Adaptive QoS Class Allocation Schemes in Multi-Domain Path-Based Networks
- High-capacity direct-detection optical OFDM by optical multi-band receiving (光通信システム)
- Experimental Study of Energy-Efficient WDM Transponder Utilizing Adaptive Interface Control with Link-Aggregation of Ethernet Links
- Deflection Routing for Optical Bursts Considering Possibility of Contention at Downstream Nodes(Network)
- Telecommunications Network Planning Method Based on Probabilistic Risk Assessment
- QoS-Ensured Network Resource Federation Driven by Bandwidth Brokers in Open Access Network Architecture
- All-Optical Monitoring Path Computation Using Lower Bounds of Required Number of Paths
- Route Computation Method for Secure Delivery of Secret Shared Content