Node Placement Algorithms in the Case that Routes are Design Variables in Shuffle-Like Multihop Lightwave Networks

Tokumi YOKOHIRA; Kiyohiko OKAYAMA

doi:10.1093/ietcom/e88-b.12.4578

Node Placement Algorithms in the Case that Routes are Design Variables in Shuffle-Like Multihop Lightwave Networks

Tokumi YOKOHIRA, Kiyohiko OKAYAMA

Full Text Views

0

Share
Cite this

Summary :

The shuffle-like network (SL-Net) is known as a logical topology for WDM-based multihop packet-switched networks. Even if we fix the logical topology to an SL-Net, we can still reposition nodes in the SL-Net by re-tuning wavelengths of transmitters and/or receivers. In conventional node placement algorithms, routes between nodes are assumed to be given. In this paper, we propose two heuristic node placement algorithms for the SL-Net to decrease the average end-to-end packet transmission delay under a given traffic matrix in the case that routes are design variables. The principal idea is to prevent too many traffic flows from overlapping on any link. To attain the idea, in one of the algorithms, a node is selected one by one in a decreasing order of the sums of sending and receiving traffic requirements in nodes, and its placement and routes between the node and all the nodes already placed are simultaneously decided so that the maximum of the amounts of traffic on links at the moment is minimum. In the other algorithm, a node is selected in the same way, and first it is placed so that the average distance between the node and all the nodes already placed is as large as possible, and then routes between the node and all the nodes already placed are decided so that the maximum of the amounts of traffic on links at the moment is minimum. Numerical results for four typical traffic matrices show that either of the proposed algorithms has better performance than conventional algorithms for each matrix, and show that the proposed algorithms, which are based on a jointed optimization approach of node placement and routing, are superior to algorithms which execute node placement and routing as two isolated phases.

Publication: IEICE TRANSACTIONS on Communications Vol.E88-B No.12 pp.4578-4587

Publication Date: 2005/12/01

Publicized

Online ISSN

DOI: 10.1093/ietcom/e88-b.12.4578

Type of Manuscript: PAPER

Category: Network

Cite this

Copy

Tokumi YOKOHIRA, Kiyohiko OKAYAMA, "Node Placement Algorithms in the Case that Routes are Design Variables in Shuffle-Like Multihop Lightwave Networks" in IEICE TRANSACTIONS on Communications, vol. E88-B, no. 12, pp. 4578-4587, December 2005, doi: 10.1093/ietcom/e88-b.12.4578.
Abstract: The shuffle-like network (SL-Net) is known as a logical topology for WDM-based multihop packet-switched networks. Even if we fix the logical topology to an SL-Net, we can still reposition nodes in the SL-Net by re-tuning wavelengths of transmitters and/or receivers. In conventional node placement algorithms, routes between nodes are assumed to be given. In this paper, we propose two heuristic node placement algorithms for the SL-Net to decrease the average end-to-end packet transmission delay under a given traffic matrix in the case that routes are design variables. The principal idea is to prevent too many traffic flows from overlapping on any link. To attain the idea, in one of the algorithms, a node is selected one by one in a decreasing order of the sums of sending and receiving traffic requirements in nodes, and its placement and routes between the node and all the nodes already placed are simultaneously decided so that the maximum of the amounts of traffic on links at the moment is minimum. In the other algorithm, a node is selected in the same way, and first it is placed so that the average distance between the node and all the nodes already placed is as large as possible, and then routes between the node and all the nodes already placed are decided so that the maximum of the amounts of traffic on links at the moment is minimum. Numerical results for four typical traffic matrices show that either of the proposed algorithms has better performance than conventional algorithms for each matrix, and show that the proposed algorithms, which are based on a jointed optimization approach of node placement and routing, are superior to algorithms which execute node placement and routing as two isolated phases.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.12.4578/_p

Copy

@ARTICLE{e88-b_12_4578,
author={Tokumi YOKOHIRA, Kiyohiko OKAYAMA, },
journal={IEICE TRANSACTIONS on Communications},
title={Node Placement Algorithms in the Case that Routes are Design Variables in Shuffle-Like Multihop Lightwave Networks},
year={2005},
volume={E88-B},
number={12},
pages={4578-4587},
abstract={The shuffle-like network (SL-Net) is known as a logical topology for WDM-based multihop packet-switched networks. Even if we fix the logical topology to an SL-Net, we can still reposition nodes in the SL-Net by re-tuning wavelengths of transmitters and/or receivers. In conventional node placement algorithms, routes between nodes are assumed to be given. In this paper, we propose two heuristic node placement algorithms for the SL-Net to decrease the average end-to-end packet transmission delay under a given traffic matrix in the case that routes are design variables. The principal idea is to prevent too many traffic flows from overlapping on any link. To attain the idea, in one of the algorithms, a node is selected one by one in a decreasing order of the sums of sending and receiving traffic requirements in nodes, and its placement and routes between the node and all the nodes already placed are simultaneously decided so that the maximum of the amounts of traffic on links at the moment is minimum. In the other algorithm, a node is selected in the same way, and first it is placed so that the average distance between the node and all the nodes already placed is as large as possible, and then routes between the node and all the nodes already placed are decided so that the maximum of the amounts of traffic on links at the moment is minimum. Numerical results for four typical traffic matrices show that either of the proposed algorithms has better performance than conventional algorithms for each matrix, and show that the proposed algorithms, which are based on a jointed optimization approach of node placement and routing, are superior to algorithms which execute node placement and routing as two isolated phases.},
keywords={},
doi={10.1093/ietcom/e88-b.12.4578},
ISSN={},
month={December},}

Copy

TY - JOUR
TI - Node Placement Algorithms in the Case that Routes are Design Variables in Shuffle-Like Multihop Lightwave Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 4578
EP - 4587
AU - Tokumi YOKOHIRA
AU - Kiyohiko OKAYAMA
PY - 2005
DO - 10.1093/ietcom/e88-b.12.4578
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2005
AB - The shuffle-like network (SL-Net) is known as a logical topology for WDM-based multihop packet-switched networks. Even if we fix the logical topology to an SL-Net, we can still reposition nodes in the SL-Net by re-tuning wavelengths of transmitters and/or receivers. In conventional node placement algorithms, routes between nodes are assumed to be given. In this paper, we propose two heuristic node placement algorithms for the SL-Net to decrease the average end-to-end packet transmission delay under a given traffic matrix in the case that routes are design variables. The principal idea is to prevent too many traffic flows from overlapping on any link. To attain the idea, in one of the algorithms, a node is selected one by one in a decreasing order of the sums of sending and receiving traffic requirements in nodes, and its placement and routes between the node and all the nodes already placed are simultaneously decided so that the maximum of the amounts of traffic on links at the moment is minimum. In the other algorithm, a node is selected in the same way, and first it is placed so that the average distance between the node and all the nodes already placed is as large as possible, and then routes between the node and all the nodes already placed are decided so that the maximum of the amounts of traffic on links at the moment is minimum. Numerical results for four typical traffic matrices show that either of the proposed algorithms has better performance than conventional algorithms for each matrix, and show that the proposed algorithms, which are based on a jointed optimization approach of node placement and routing, are superior to algorithms which execute node placement and routing as two isolated phases.
ER -