One-Hop Path Routing Based on Heuristic-K Method Using ACO

Zheng He; Fan Wei; Xiao Hong Huang; Yan Ma

doi:10.4028/www.scientific.net/AMR.601.312

Paper Titles

Support Vector Regression Based Nonlinear Model Reference Adaptive Control
p.289

Investigation of Performance of Scramjet Combustion Used Kerosene with Clean Air
p.294

An Authentication Structure across Trust Domains
p.301

Research on Delegation Authorization Model Based on TRBAC and Attribute
p.307

One-Hop Path Routing Based on Heuristic-K Method Using ACO
p.312

SSR-CDPS: A Novel Continuous Data Protection System Supporting Service Recovery
p.318

Towards Web Service Discovery Based on Context-Aware
p.325

Contribution to the Mapping of the Landslide of Ain El Hammam (Algeria)
p.332

Research on Data Recovery of Oracle Database in Linux
p.337

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 601One-Hop Path Routing Based on Heuristic-K Method...

One-Hop Path Routing Based on Heuristic-K Method Using ACO

Abstract:

Overlay networks have emerged as a promising paradigm for providing customizable and reliable services at the application layer, such as fault-resilient routing, multicast, and content delivery. Among the overlay network architecture, overlay routing is an important aspect of the overlay network design. In this paper, we develop a one-hop source routing, called heuristic-K algorithm using Ant Colony Optimization, to allow individual nodes to optimize route selection based on specific metrics like delay, loss rate, or throughput. Moreover, due to the selfish operating manner of overlay routing, we also take the traffic engineering element into consideration in the design process of our proposal. The experimental results demonstrate the effectiveness of the routing algorithm.

You might also be interested in these eBooks

Management, Manufacturing and Materials Engineering II

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 601)

Pages:

312-317

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.601.312

Citation:

Cite this paper

Online since:

December 2012

Authors:

Zheng He, Fan Wei, Xiao Hong Huang, Yan Ma

Keywords:

ACO, Component, Heuristic-K, Overlay Routing

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Y. T. Hou, Z. Duan, and Z. Zhang, Service overlay networks: SLA, QoS and bandwidth provisioning, " Proc. IEEE ICNP, 02, November (2002).

DOI: 10.1109/icnp.2002.1181420

Google Scholar

[2] L. Subramanian, I. Stoica, H. Balakrishnan, and R. Katz, OverQoS: Offering QoS using Overlays, Proc. HotNets-I, October (2002).

DOI: 10.1145/774763.774764

Google Scholar

[3] L. Zhi and P. Mohapatra, QRON: QoS-aware routing in overlay networks, IEEE J. Select. Areas Commun., vol. 22, pp.29-40, Jan. (2004).

DOI: 10.1109/jsac.2003.818782

Google Scholar

[4] D. Anderson, H. Balakrishnan, F. Kaashoek, and R. Morris, Resilient overlay networks, in Proceedings of 18th ACM Symposium on Operating Systems Principles, (2001).

DOI: 10.1145/502034.502048

Google Scholar

[5] A. Collins, The Detour framework for packet rerouting, M.S. thesis, University of Washington, (1998).

Google Scholar

[6] K. P. Gummadi, H. V. Madhyastha, S. D. Gribble, H. M. Levy, and D. Wetherall, Improving the reliability of Internet paths with one-hop source routing, in Proceedings of the 7th Symposium on Operating Systems Design and Implementation, (2004).

Google Scholar

[7] H. Zhang, L. Tang, J. Li, Impact of overlay routing on end-to-end delay, in: Proceedings of 15th International Conference on Computer Communications and Networks, (2006).

DOI: 10.1109/icccn.2006.286315

Google Scholar

[8] D. Andersen, H. Balakrishnan, F. Kaashoek, R. Morris, Resilient overlay networks, ACM SIGOPS Operating Systems Review 35 (5) (2001) 131–145.

DOI: 10.1145/502059.502048

Google Scholar