Analysis of AntNet routing scheme by using queueing model

Kyungmin Park, Young Yong Kim

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We analyzed the AntNet routing scheme's performance by using the network queueing model, and derived the optimal routing strategies to minimize the average time and variance of the end-to-end packet delay. In contrast to existing research, this paper provides the theoretical analytic methods for the AntNet scheme. Moreover we added the link failure case for AntNet to the queueing model. At first, by adapting the AntNet queueing model to a simple two paths network, we showed the performance of AntNet routing scheme to minimize the average time and variance of the end-to-end packet delay. Then we extended it to the large network, and compared the AntNet routing scheme to the shortest path routing scheme and the optimal routing strategies. The AntNet scheme's load-balancing effect gives it a smaller delay than the shortest path routing scheme in high intensity network environments, which have heavy traffic. However, the AntNet scheme does not match the performance of the routing strategy that minimize the end-to-end delay. Moreover although the AntNet scheme provides the minimum delay variance at a simple two paths network, it does not guarantee that in the large sized network.

Original languageEnglish
Pages (from-to)2951-2958
Number of pages8
JournalComputer Communications
Volume31
Issue number13
DOIs
Publication statusPublished - 2008 Aug 15

Fingerprint

Queueing networks
Resource allocation

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{9448c0c22d8d473284a74cdca02ac81e,
title = "Analysis of AntNet routing scheme by using queueing model",
abstract = "We analyzed the AntNet routing scheme's performance by using the network queueing model, and derived the optimal routing strategies to minimize the average time and variance of the end-to-end packet delay. In contrast to existing research, this paper provides the theoretical analytic methods for the AntNet scheme. Moreover we added the link failure case for AntNet to the queueing model. At first, by adapting the AntNet queueing model to a simple two paths network, we showed the performance of AntNet routing scheme to minimize the average time and variance of the end-to-end packet delay. Then we extended it to the large network, and compared the AntNet routing scheme to the shortest path routing scheme and the optimal routing strategies. The AntNet scheme's load-balancing effect gives it a smaller delay than the shortest path routing scheme in high intensity network environments, which have heavy traffic. However, the AntNet scheme does not match the performance of the routing strategy that minimize the end-to-end delay. Moreover although the AntNet scheme provides the minimum delay variance at a simple two paths network, it does not guarantee that in the large sized network.",
author = "Kyungmin Park and Kim, {Young Yong}",
year = "2008",
month = "8",
day = "15",
doi = "10.1016/j.comcom.2008.04.003",
language = "English",
volume = "31",
pages = "2951--2958",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "13",

}

Analysis of AntNet routing scheme by using queueing model. / Park, Kyungmin; Kim, Young Yong.

In: Computer Communications, Vol. 31, No. 13, 15.08.2008, p. 2951-2958.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Analysis of AntNet routing scheme by using queueing model

AU - Park, Kyungmin

AU - Kim, Young Yong

PY - 2008/8/15

Y1 - 2008/8/15

N2 - We analyzed the AntNet routing scheme's performance by using the network queueing model, and derived the optimal routing strategies to minimize the average time and variance of the end-to-end packet delay. In contrast to existing research, this paper provides the theoretical analytic methods for the AntNet scheme. Moreover we added the link failure case for AntNet to the queueing model. At first, by adapting the AntNet queueing model to a simple two paths network, we showed the performance of AntNet routing scheme to minimize the average time and variance of the end-to-end packet delay. Then we extended it to the large network, and compared the AntNet routing scheme to the shortest path routing scheme and the optimal routing strategies. The AntNet scheme's load-balancing effect gives it a smaller delay than the shortest path routing scheme in high intensity network environments, which have heavy traffic. However, the AntNet scheme does not match the performance of the routing strategy that minimize the end-to-end delay. Moreover although the AntNet scheme provides the minimum delay variance at a simple two paths network, it does not guarantee that in the large sized network.

AB - We analyzed the AntNet routing scheme's performance by using the network queueing model, and derived the optimal routing strategies to minimize the average time and variance of the end-to-end packet delay. In contrast to existing research, this paper provides the theoretical analytic methods for the AntNet scheme. Moreover we added the link failure case for AntNet to the queueing model. At first, by adapting the AntNet queueing model to a simple two paths network, we showed the performance of AntNet routing scheme to minimize the average time and variance of the end-to-end packet delay. Then we extended it to the large network, and compared the AntNet routing scheme to the shortest path routing scheme and the optimal routing strategies. The AntNet scheme's load-balancing effect gives it a smaller delay than the shortest path routing scheme in high intensity network environments, which have heavy traffic. However, the AntNet scheme does not match the performance of the routing strategy that minimize the end-to-end delay. Moreover although the AntNet scheme provides the minimum delay variance at a simple two paths network, it does not guarantee that in the large sized network.

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

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

U2 - 10.1016/j.comcom.2008.04.003

DO - 10.1016/j.comcom.2008.04.003

M3 - Article

AN - SCOPUS:48049103023

VL - 31

SP - 2951

EP - 2958

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 13

ER -