Improved reinforcement computing to implement AntNet-based routing using general NPs for ubiquitous environments

Hyuntae Park; Byung In Moon; Sungho Kang

doi:10.1007/978-3-540-71789-8_25

Improved reinforcement computing to implement AntNet-based routing using general NPs for ubiquitous environments

Hyuntae Park, Byung In Moon, Sungho Kang

Department of Electrical and Electronic Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In the ubiquitous convergence era, the traffic managements and quality of services will be made much of a role. Because traditional routing mechanisms are lacking scalability and adaptability, a kind of adaptive routing algorithm called AntNet has attracted the attention. AntNet is an adaptive agent-based routing algorithm that imitates the activities of the social insect. In AntNet, there are implementation constraints due to complex arithmetic calculations for determining a reinforcement value. Besides, a housekeeping core in network processors will be overwhelmed by increasing routing workload for a processing of agents. In this paper, we propose a new reinforcement computing algorithm to overcome these problems. This can be implemented efficiently on packet forwarding engines of conventional network processors. The simulation results show that the proposed AntNet is more adaptive and effective in the performance of the implementation than the original AntNet.

Original language	English
Title of host publication	Ubiquitous Convergence Technology - First International Conference, ICUCT 2006, Revised Selected Papers
Publisher	Springer Verlag
Pages	242-251
Number of pages	10
ISBN (Print)	9783540717881
DOIs	https://doi.org/10.1007/978-3-540-71789-8_25
Publication status	Published - 2007
Event	1st International Conference on Ubiquitous Convergence Technology, ICUCT 2006 - Jeju Island, Korea, Republic of Duration: 2006 Dec 5 → 2006 Dec 6

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4412 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	1st International Conference on Ubiquitous Convergence Technology, ICUCT 2006
Country	Korea, Republic of
City	Jeju Island
Period	06/12/5 → 06/12/6

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-71789-8_25

Fingerprint Dive into the research topics of 'Improved reinforcement computing to implement AntNet-based routing using general NPs for ubiquitous environments'. Together they form a unique fingerprint.

Cite this

Park, H., Moon, B. I., & Kang, S. (2007). Improved reinforcement computing to implement AntNet-based routing using general NPs for ubiquitous environments. In Ubiquitous Convergence Technology - First International Conference, ICUCT 2006, Revised Selected Papers (pp. 242-251). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4412 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-71789-8_25

Park, Hyuntae ; Moon, Byung In ; Kang, Sungho. / Improved reinforcement computing to implement AntNet-based routing using general NPs for ubiquitous environments. Ubiquitous Convergence Technology - First International Conference, ICUCT 2006, Revised Selected Papers. Springer Verlag, 2007. pp. 242-251 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{9817c412623b4bb39918fdb751bd3ab9,

title = "Improved reinforcement computing to implement AntNet-based routing using general NPs for ubiquitous environments",

abstract = "In the ubiquitous convergence era, the traffic managements and quality of services will be made much of a role. Because traditional routing mechanisms are lacking scalability and adaptability, a kind of adaptive routing algorithm called AntNet has attracted the attention. AntNet is an adaptive agent-based routing algorithm that imitates the activities of the social insect. In AntNet, there are implementation constraints due to complex arithmetic calculations for determining a reinforcement value. Besides, a housekeeping core in network processors will be overwhelmed by increasing routing workload for a processing of agents. In this paper, we propose a new reinforcement computing algorithm to overcome these problems. This can be implemented efficiently on packet forwarding engines of conventional network processors. The simulation results show that the proposed AntNet is more adaptive and effective in the performance of the implementation than the original AntNet.",

author = "Hyuntae Park and Moon, {Byung In} and Sungho Kang",

year = "2007",

doi = "10.1007/978-3-540-71789-8_25",

language = "English",

isbn = "9783540717881",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "242--251",

booktitle = "Ubiquitous Convergence Technology - First International Conference, ICUCT 2006, Revised Selected Papers",

address = "Germany",

note = "1st International Conference on Ubiquitous Convergence Technology, ICUCT 2006 ; Conference date: 05-12-2006 Through 06-12-2006",

}

Park, H, Moon, BI & Kang, S 2007, Improved reinforcement computing to implement AntNet-based routing using general NPs for ubiquitous environments. in Ubiquitous Convergence Technology - First International Conference, ICUCT 2006, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4412 LNCS, Springer Verlag, pp. 242-251, 1st International Conference on Ubiquitous Convergence Technology, ICUCT 2006, Jeju Island, Korea, Republic of, 06/12/5. https://doi.org/10.1007/978-3-540-71789-8_25

Improved reinforcement computing to implement AntNet-based routing using general NPs for ubiquitous environments. / Park, Hyuntae; Moon, Byung In; Kang, Sungho.

Ubiquitous Convergence Technology - First International Conference, ICUCT 2006, Revised Selected Papers. Springer Verlag, 2007. p. 242-251 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4412 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Improved reinforcement computing to implement AntNet-based routing using general NPs for ubiquitous environments

AU - Park, Hyuntae

AU - Moon, Byung In

AU - Kang, Sungho

PY - 2007

Y1 - 2007

N2 - In the ubiquitous convergence era, the traffic managements and quality of services will be made much of a role. Because traditional routing mechanisms are lacking scalability and adaptability, a kind of adaptive routing algorithm called AntNet has attracted the attention. AntNet is an adaptive agent-based routing algorithm that imitates the activities of the social insect. In AntNet, there are implementation constraints due to complex arithmetic calculations for determining a reinforcement value. Besides, a housekeeping core in network processors will be overwhelmed by increasing routing workload for a processing of agents. In this paper, we propose a new reinforcement computing algorithm to overcome these problems. This can be implemented efficiently on packet forwarding engines of conventional network processors. The simulation results show that the proposed AntNet is more adaptive and effective in the performance of the implementation than the original AntNet.

AB - In the ubiquitous convergence era, the traffic managements and quality of services will be made much of a role. Because traditional routing mechanisms are lacking scalability and adaptability, a kind of adaptive routing algorithm called AntNet has attracted the attention. AntNet is an adaptive agent-based routing algorithm that imitates the activities of the social insect. In AntNet, there are implementation constraints due to complex arithmetic calculations for determining a reinforcement value. Besides, a housekeeping core in network processors will be overwhelmed by increasing routing workload for a processing of agents. In this paper, we propose a new reinforcement computing algorithm to overcome these problems. This can be implemented efficiently on packet forwarding engines of conventional network processors. The simulation results show that the proposed AntNet is more adaptive and effective in the performance of the implementation than the original AntNet.

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

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

U2 - 10.1007/978-3-540-71789-8_25

DO - 10.1007/978-3-540-71789-8_25

M3 - Conference contribution

AN - SCOPUS:38049138982

SN - 9783540717881

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 242

EP - 251

BT - Ubiquitous Convergence Technology - First International Conference, ICUCT 2006, Revised Selected Papers

PB - Springer Verlag

T2 - 1st International Conference on Ubiquitous Convergence Technology, ICUCT 2006

Y2 - 5 December 2006 through 6 December 2006

ER -

Park H, Moon BI, Kang S. Improved reinforcement computing to implement AntNet-based routing using general NPs for ubiquitous environments. In Ubiquitous Convergence Technology - First International Conference, ICUCT 2006, Revised Selected Papers. Springer Verlag. 2007. p. 242-251. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-71789-8_25