Contention-Free λ-Planes in Optically Burst-Switched WDM Networks(Internet)
スポンサーリンク
概要
- 論文の詳細を見る
This paper proposes a contention-free burst scheduling scheme for optically burst-switched WDM networks. We construct contention-free wavelength planes (λ-planes) by assigning dedicated wavelengths to each ingress node. Bursts are transmitted to their egress nodes on λ-planes, along routes forming a spanning tree. As a result, contention at intermediate core nodes is completely eliminated, and contention at ingress nodes is resolved by means of electric buffers. This paper develops a spanning tree construction algorithm, aiming at balancing input loads among output ports at each ingress node. Furthermore, a wavelength assignment algorithm is proposed, which is based on the amount of traffic lost at ingress nodes. We show that the proposed scheme can decrease the burst loss probability drastically, even if traffic intensities at ingress nodes are different.
- 社団法人電子情報通信学会の論文
- 2007-09-01
著者
-
Nagamochi Hiroshi
The Graduate School Of Informatics Kyoto University
-
TAKINE Tetsuya
Graduate School of Engineering, Osaka University
-
Takine Tetsuya
Graduate School Of Engineering Osaka University
-
Nagamochi Hiroshi
Graduate School Of Informatics Kyoto University
-
MATSUDA Takahiro
Graduate School of Engineering, Osaka University
-
HIRATA Kouji
Graduate School of Engineering, Osaka University
-
Hirata Kouji
Graduate School Of Engineering Osaka University
-
Matsuda Takahiro
Graduate School Of Engineering Osaka University
-
NAGAMOCHI Hiroshi
Graduate School of Informatics, Kyoto University
関連論文
- On Strategies for Allocating Replicas of Mobile Databases
- Constant Time Generation of Trees with Degree Bounds
- Recent Development of Graph Connectivity Augmentation Algorithms(Special Issue on Algorithm Engineering : Surveys)
- Constant Time Generation of Trees with Degree Bounds
- Enumerating Colored and Rooted Outerplanar Graphs
- Survivable Network Design Problems with Weighted Degree Constraints (Combinatorial Optimization and Discrete Algorithms)
- Broadcasting with Randomized Network Coding in Dense Wireless Ad Hoc Networks
- Contention-Free λ-Planes in Optically Burst-Switched WDM Networks(Internet)
- TCP Congestion Control with ACK-Pacing for Vertical Handover(Network)
- Mismatch of Packet Recovery Mechanisms for Bit Error and Handover in Wireless TCP(TCP)(Networking Technologies for Mobile Internet Systems)
- Comparative Study on the Self-Similarity of TCP Reno and TCP Vegas(Network Quality and Control)
- Contribution of the Application, Transport and Network Layers to the Self-Similarity of Internet Traffic(Network Protocols)
- The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights
- Survey of Network Coding and Its Applications
- Active ECN Mechanism for Fairness among TCP Sessions with Different Round Trip Times(Internet)
- Performance Analysis of Fairness Issue of Wireless and Wired TCP Connections
- Performance Evaluation of TCP Session Considering Long-Range Dependence of RTT
- Accelerating A* algorithms by sweeping out small-degree nodes
- Indexing All Rooted Subgraphs of a Rooted Graph
- Compressive Sampling for Remote Control Systems
- Comparative Study on the Self-Similarity of TCP Reno and TCP Vegas
- Comparative Study on the Self-Similarity of TCP Reno and TCP Vegas
- Bitwise Operation-Based In-Network Processing for Loss Tomography
- Sequential Loss Tomography Using Compressed Sensing
- Contribution of the Application, Transport and Network Layers to the Self-Similarity of Internet Traffic