IEICE TRANSACTIONS on Communications
Network Design for Multi-Layered Photonic IP Networks Considering IP Traffic Growth
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E87-B No.2 pp.302-309
- Publication Date
- 2004/02/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Internet
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shigeru KANEDA, Tomohiko UYEMATSU, Naohide NAGATSU, Ken-ichi SATO, "Network Design for Multi-Layered Photonic IP Networks Considering IP Traffic Growth" in IEICE TRANSACTIONS on Communications,
vol. E87-B, no. 2, pp. 302-309, February 2004, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e87-b_2_302/_p
Copy
@ARTICLE{e87-b_2_302,
author={Shigeru KANEDA, Tomohiko UYEMATSU, Naohide NAGATSU, Ken-ichi SATO, },
journal={IEICE TRANSACTIONS on Communications},
title={Network Design for Multi-Layered Photonic IP Networks Considering IP Traffic Growth},
year={2004},
volume={E87-B},
number={2},
pages={302-309},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - Network Design for Multi-Layered Photonic IP Networks Considering IP Traffic Growth
T2 - IEICE TRANSACTIONS on Communications
SP - 302
EP - 309
AU - Shigeru KANEDA
AU - Tomohiko UYEMATSU
AU - Naohide NAGATSU
AU - Ken-ichi SATO
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2004
AB - 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.
ER -
English
