Node placement algorithms for shuffle-like packet-switched networks with wavelength-division multiplexing

Tokumi Yokohira, Takuji Okamoto

Research output: Contribution to journalArticle

Abstract

The shuffle-like network (SL-Net) is known as a logical topology for WDM-based multihop packet-switched networks. We propose two heuristic node placement algorithms for the SL-Net to decrease the average end-to-end packet transmission delay for a given traffic matrix. The principal idea is to prevent too many traffic flows from overlapping on any link. To attain this objective, one algorithm selects nodes one by one in decreasing order of the sums of their sending and receiving traffic requirements, and places them so that the maximum traffic in the links is minimal. The other selects nodes in the same way, and places then so that the average distance among the nodes which have already been placed is as large as possible. Numerical results for four typical traffic matrices show that either of the proposed algorithms has better performance than the conventional algorithms for each matrix.

Original languageEnglish
Pages (from-to)72-81
Number of pages10
JournalElectronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)
Volume88
Issue number1
DOIs
Publication statusPublished - Jan 2005

Fingerprint

Packet networks
Wavelength division multiplexing
Topology

Keywords

  • Logical topology
  • Node placement
  • Shuffle-like network
  • Wavelength assignment
  • Wavelength-division multiplexing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

@article{ec8a429873aa47f2a1682a3e4212bfeb,
title = "Node placement algorithms for shuffle-like packet-switched networks with wavelength-division multiplexing",
abstract = "The shuffle-like network (SL-Net) is known as a logical topology for WDM-based multihop packet-switched networks. We propose two heuristic node placement algorithms for the SL-Net to decrease the average end-to-end packet transmission delay for a given traffic matrix. The principal idea is to prevent too many traffic flows from overlapping on any link. To attain this objective, one algorithm selects nodes one by one in decreasing order of the sums of their sending and receiving traffic requirements, and places them so that the maximum traffic in the links is minimal. The other selects nodes in the same way, and places then so that the average distance among the nodes which have already been placed is as large as possible. Numerical results for four typical traffic matrices show that either of the proposed algorithms has better performance than the conventional algorithms for each matrix.",
keywords = "Logical topology, Node placement, Shuffle-like network, Wavelength assignment, Wavelength-division multiplexing",
author = "Tokumi Yokohira and Takuji Okamoto",
year = "2005",
month = "1",
doi = "10.1002/ecja.10184",
language = "English",
volume = "88",
pages = "72--81",
journal = "Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)",
issn = "8756-6621",
publisher = "John Wiley and Sons Inc.",
number = "1",

}

TY - JOUR

T1 - Node placement algorithms for shuffle-like packet-switched networks with wavelength-division multiplexing

AU - Yokohira, Tokumi

AU - Okamoto, Takuji

PY - 2005/1

Y1 - 2005/1

N2 - The shuffle-like network (SL-Net) is known as a logical topology for WDM-based multihop packet-switched networks. We propose two heuristic node placement algorithms for the SL-Net to decrease the average end-to-end packet transmission delay for a given traffic matrix. The principal idea is to prevent too many traffic flows from overlapping on any link. To attain this objective, one algorithm selects nodes one by one in decreasing order of the sums of their sending and receiving traffic requirements, and places them so that the maximum traffic in the links is minimal. The other selects nodes in the same way, and places then so that the average distance among the nodes which have already been placed is as large as possible. Numerical results for four typical traffic matrices show that either of the proposed algorithms has better performance than the conventional algorithms for each matrix.

AB - The shuffle-like network (SL-Net) is known as a logical topology for WDM-based multihop packet-switched networks. We propose two heuristic node placement algorithms for the SL-Net to decrease the average end-to-end packet transmission delay for a given traffic matrix. The principal idea is to prevent too many traffic flows from overlapping on any link. To attain this objective, one algorithm selects nodes one by one in decreasing order of the sums of their sending and receiving traffic requirements, and places them so that the maximum traffic in the links is minimal. The other selects nodes in the same way, and places then so that the average distance among the nodes which have already been placed is as large as possible. Numerical results for four typical traffic matrices show that either of the proposed algorithms has better performance than the conventional algorithms for each matrix.

KW - Logical topology

KW - Node placement

KW - Shuffle-like network

KW - Wavelength assignment

KW - Wavelength-division multiplexing

UR - http://www.scopus.com/inward/record.url?scp=7044249334&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=7044249334&partnerID=8YFLogxK

U2 - 10.1002/ecja.10184

DO - 10.1002/ecja.10184

M3 - Article

VL - 88

SP - 72

EP - 81

JO - Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)

JF - Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)

SN - 8756-6621

IS - 1

ER -