Network Design for Multi-Layered Photonic IP Networks Considering IP Traffic Growth(Internet)
スポンサーリンク
概要
- 論文の詳細を見る
In order to transport an ever-increasing amount of IP traffic effectively, Photonic IP networks that employ wavelength routing and Layer 3 cut-through are very important. This paper proposes a new network design algorithm that minimizes the network cost considering IP traffic growth for multi-layered photonic IP networks that comprise electrical label switched paths (LSPs) and optical LSPs. We evaluate the network cost obtained from the developed network design algorithm that considers IP traffic growth and compare it to the results obtained from a static zero- based algorithm. The static zero-based algorithm does not take into account the history of progressive past IP traffic changes/growth until that time. The results show that our proposed algorithm is very effective; the cost increase from the cost obtained using the zero-based algorithm is marginal. The algorithm developed herein enables effective multi-layered photonic IP network design that can be applied to practical networks where IP traffic changes/increases progressively and that can be used for long term network provisioning.
- 社団法人電子情報通信学会の論文
- 2004-02-01
著者
-
UYEMATSU Tomohiko
Department of Communications and Integrated Systems, Tokyo Institute of Technology
-
SATO Ken-ichi
NTT Network Innovation Laboratories
-
Uyematsu Tomohiko
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
KANEDA Shigeru
Department of Communications and Integrated Systems, Tokyo Institute of Technology
-
NAGATSU Naohide
Department of Communications and Integrated Systems, Tokyo Institute of Technology
-
Kaneda Shigeru
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Nagatsu Naohide
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Sato K
Ntt Corp. Yokosuka‐shi Jpn
-
Sato Ken-ichi
Ntt Network Innovation Laboratories Ntt Corporation
関連論文
- Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model
- Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet(Source Coding,Information Theory and Its Applications)
- Robust IP Backbone Network Utilizing WDM Optical Paths (Joint Special Issue on Recent Progress in Optoelectronics and Communications)
- Flexible OADM Architecture and Its Impact on WDM Ring Evolution for Robust and Large-Scale Optical Transport Networks (Joint Special Issue on Recent Progress in Optoelectronics and Communications)
- Robust IP Backbone Network Utilizing WDM Optical Paths (Joint Special Issue on Recent Progress in Optoelectronics and Communications)
- Flexible OADM Architecture and Its Impact on WDM Ring Evolution for Robust and Large-Scale Optical Transport Networks (Joint Special Issue on Recent Progress in Optoelectronics and Communications)
- FOREWORD
- Decodability of Network Coding with Time-Varying Delay and No Buffering
- Universal Coding for Correlated Sources with Complementary Delivery(Information Theory and Its Applications)
- Universal source coding for complementary delivery
- Information-theoretical analysis of index searching : Revised
- Multiterminal source coding with complementary delivering(HISC2006)
- Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources
- Network Design for Multi-Layered Photonic IP Networks Considering IP Traffic Growth(Internet)
- Fast Restoration on Network Control Plane Established through Photonic MPLS Routers(The IEICE Transactions on Communications, Vol.E86-B, No.5)
- Fast Restoration on Network Control Plane Established through Photonic MPLS Routers ( Recent Progress in Optoelectronics and Communications)
- Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
- Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder(Communication Theory)(Information Theory and Its Applications)
- Randomness of Individual Sequences
- Universal Variable-to-Fixed Length Codes Achieving Optimum Large Deviations Performance for Empirical Compression Ratio
- A Novel Realization of Threshold Schemes over Binary Field Extensions
- Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight