Logo Institute of Communication Networks (E-4)
Institute of Communication Networks (E-4)
Logo Institute of Communication Networks (E-4)
Institute of Communication Networks (E-4)
EN
DE
Search
EN
DE
Search
ET6 > Publications

Publications

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

[117415]
Title: Distributed algorithm for dynamic logical topology reconfiguration in IP over WDM networks..
Written by: Phuong Nga Tran and Ulrich Killat
in: <em>in Proceedings of 14th IEEE International Conference in Computer Communications (ISCC'09)</em>. (2009).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/586/
ARXIVID:
PMID:

[www]

Note:

Abstract: In this paper, we present a novel distributed algorithm to solve the logical topology reconfiguration problem for IP over WDM networks under dynamic traffic. From the optimization model proposed in, we apply the Lagrangian relaxation to eliminate the capacity constraint and form a dual problem whose optimal solution is the lower bound of the original one. The dual problem is then decomposed into subproblems, which can be solved in a distributed manner. Based on the solution of the dual problem, a heuristic algorithm is proposed to obtain a good feasible solution for the original reconfiguration problem. Our distributed algorithm fulfils all requirements of the reconfiguration process, such as no service disruption, load balancing in the new logical topology while allowing to add and to delete multiple lightpaths. Moreover, the distributed approach offers a high scalability. Not limited to small or medium-sized networks as the centralized model in, this distributed algorithm can be applied to large networks with the computation time increasing linearly with the network size. The performance of the proposed distributed algorithm, which lends itself to a protocol implementation, is investigated and compared with the corresponding centralized approach

[117415]
Title: Distributed algorithm for dynamic logical topology reconfiguration in IP over WDM networks..
Written by: Phuong Nga Tran and Ulrich Killat
in: <em>in Proceedings of 14th IEEE International Conference in Computer Communications (ISCC'09)</em>. (2009).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/586/
ARXIVID:
PMID:

[www]

Note:

Abstract: In this paper, we present a novel distributed algorithm to solve the logical topology reconfiguration problem for IP over WDM networks under dynamic traffic. From the optimization model proposed in, we apply the Lagrangian relaxation to eliminate the capacity constraint and form a dual problem whose optimal solution is the lower bound of the original one. The dual problem is then decomposed into subproblems, which can be solved in a distributed manner. Based on the solution of the dual problem, a heuristic algorithm is proposed to obtain a good feasible solution for the original reconfiguration problem. Our distributed algorithm fulfils all requirements of the reconfiguration process, such as no service disruption, load balancing in the new logical topology while allowing to add and to delete multiple lightpaths. Moreover, the distributed approach offers a high scalability. Not limited to small or medium-sized networks as the centralized model in, this distributed algorithm can be applied to large networks with the computation time increasing linearly with the network size. The performance of the proposed distributed algorithm, which lends itself to a protocol implementation, is investigated and compared with the corresponding centralized approach

[117415]
Title: Distributed algorithm for dynamic logical topology reconfiguration in IP over WDM networks..
Written by: Phuong Nga Tran and Ulrich Killat
in: <em>in Proceedings of 14th IEEE International Conference in Computer Communications (ISCC'09)</em>. (2009).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/586/
ARXIVID:
PMID:

[www]

Note:

Abstract: In this paper, we present a novel distributed algorithm to solve the logical topology reconfiguration problem for IP over WDM networks under dynamic traffic. From the optimization model proposed in, we apply the Lagrangian relaxation to eliminate the capacity constraint and form a dual problem whose optimal solution is the lower bound of the original one. The dual problem is then decomposed into subproblems, which can be solved in a distributed manner. Based on the solution of the dual problem, a heuristic algorithm is proposed to obtain a good feasible solution for the original reconfiguration problem. Our distributed algorithm fulfils all requirements of the reconfiguration process, such as no service disruption, load balancing in the new logical topology while allowing to add and to delete multiple lightpaths. Moreover, the distributed approach offers a high scalability. Not limited to small or medium-sized networks as the centralized model in, this distributed algorithm can be applied to large networks with the computation time increasing linearly with the network size. The performance of the proposed distributed algorithm, which lends itself to a protocol implementation, is investigated and compared with the corresponding centralized approach

[117415]
Title: Distributed algorithm for dynamic logical topology reconfiguration in IP over WDM networks..
Written by: Phuong Nga Tran and Ulrich Killat
in: <em>in Proceedings of 14th IEEE International Conference in Computer Communications (ISCC'09)</em>. (2009).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/586/
ARXIVID:
PMID:

[www]

Note:

Abstract: In this paper, we present a novel distributed algorithm to solve the logical topology reconfiguration problem for IP over WDM networks under dynamic traffic. From the optimization model proposed in, we apply the Lagrangian relaxation to eliminate the capacity constraint and form a dual problem whose optimal solution is the lower bound of the original one. The dual problem is then decomposed into subproblems, which can be solved in a distributed manner. Based on the solution of the dual problem, a heuristic algorithm is proposed to obtain a good feasible solution for the original reconfiguration problem. Our distributed algorithm fulfils all requirements of the reconfiguration process, such as no service disruption, load balancing in the new logical topology while allowing to add and to delete multiple lightpaths. Moreover, the distributed approach offers a high scalability. Not limited to small or medium-sized networks as the centralized model in, this distributed algorithm can be applied to large networks with the computation time increasing linearly with the network size. The performance of the proposed distributed algorithm, which lends itself to a protocol implementation, is investigated and compared with the corresponding centralized approach

[117415]
Title: Distributed algorithm for dynamic logical topology reconfiguration in IP over WDM networks..
Written by: Phuong Nga Tran and Ulrich Killat
in: <em>in Proceedings of 14th IEEE International Conference in Computer Communications (ISCC'09)</em>. (2009).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/586/
ARXIVID:
PMID:

[www]

Note:

Abstract: In this paper, we present a novel distributed algorithm to solve the logical topology reconfiguration problem for IP over WDM networks under dynamic traffic. From the optimization model proposed in, we apply the Lagrangian relaxation to eliminate the capacity constraint and form a dual problem whose optimal solution is the lower bound of the original one. The dual problem is then decomposed into subproblems, which can be solved in a distributed manner. Based on the solution of the dual problem, a heuristic algorithm is proposed to obtain a good feasible solution for the original reconfiguration problem. Our distributed algorithm fulfils all requirements of the reconfiguration process, such as no service disruption, load balancing in the new logical topology while allowing to add and to delete multiple lightpaths. Moreover, the distributed approach offers a high scalability. Not limited to small or medium-sized networks as the centralized model in, this distributed algorithm can be applied to large networks with the computation time increasing linearly with the network size. The performance of the proposed distributed algorithm, which lends itself to a protocol implementation, is investigated and compared with the corresponding centralized approach

[117415]
Title: Distributed algorithm for dynamic logical topology reconfiguration in IP over WDM networks..
Written by: Phuong Nga Tran and Ulrich Killat
in: <em>in Proceedings of 14th IEEE International Conference in Computer Communications (ISCC'09)</em>. (2009).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/586/
ARXIVID:
PMID:

[www]

Note:

Abstract: In this paper, we present a novel distributed algorithm to solve the logical topology reconfiguration problem for IP over WDM networks under dynamic traffic. From the optimization model proposed in, we apply the Lagrangian relaxation to eliminate the capacity constraint and form a dual problem whose optimal solution is the lower bound of the original one. The dual problem is then decomposed into subproblems, which can be solved in a distributed manner. Based on the solution of the dual problem, a heuristic algorithm is proposed to obtain a good feasible solution for the original reconfiguration problem. Our distributed algorithm fulfils all requirements of the reconfiguration process, such as no service disruption, load balancing in the new logical topology while allowing to add and to delete multiple lightpaths. Moreover, the distributed approach offers a high scalability. Not limited to small or medium-sized networks as the centralized model in, this distributed algorithm can be applied to large networks with the computation time increasing linearly with the network size. The performance of the proposed distributed algorithm, which lends itself to a protocol implementation, is investigated and compared with the corresponding centralized approach

[117415]
Title: Distributed algorithm for dynamic logical topology reconfiguration in IP over WDM networks..
Written by: Phuong Nga Tran and Ulrich Killat
in: <em>in Proceedings of 14th IEEE International Conference in Computer Communications (ISCC'09)</em>. (2009).
Volume: Number:
on pages:
Chapter:
Editor:
Publisher:
Series:
Address:
Edition:
ISBN:
how published:
Organization:
School:
Institution:
Type:
DOI:
URL: http://pollux.et6.tu-harburg.de/586/
ARXIVID:
PMID:

[www]

Note:

Abstract: In this paper, we present a novel distributed algorithm to solve the logical topology reconfiguration problem for IP over WDM networks under dynamic traffic. From the optimization model proposed in, we apply the Lagrangian relaxation to eliminate the capacity constraint and form a dual problem whose optimal solution is the lower bound of the original one. The dual problem is then decomposed into subproblems, which can be solved in a distributed manner. Based on the solution of the dual problem, a heuristic algorithm is proposed to obtain a good feasible solution for the original reconfiguration problem. Our distributed algorithm fulfils all requirements of the reconfiguration process, such as no service disruption, load balancing in the new logical topology while allowing to add and to delete multiple lightpaths. Moreover, the distributed approach offers a high scalability. Not limited to small or medium-sized networks as the centralized model in, this distributed algorithm can be applied to large networks with the computation time increasing linearly with the network size. The performance of the proposed distributed algorithm, which lends itself to a protocol implementation, is investigated and compared with the corresponding centralized approach

TU Hamburg
Institute of Communication Networks (E-4)
Prof. Dr.-Ing. Andreas Timm-Giel
Am Schwarzenberg-Campus 3, Room E1.058
21073 Hamburg
E-mail : comnets@tuhh.de
Phone : +49 40 42878-3049/3249
Links
Imprint
Data Privacy
Sitemap
ComNetsHH at GitHub