A beehive algorithm based QoS unicast routing scheme with ABC supported

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, a QoS unicast routing scheme with ABC supported is proposed based on beehive algorithm. It deals with inaccurate network status information and imprecise user QoS requirement, introduces edge bandwidth pricing, edge evaluation and path evaluation, and tries to find a QoS unicast path with Pareto optimum under Nash equilibrium on both the network provider utility and the user utility achieved or approached. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Wang, X., Liang, G., & Huang, M. (2007). A beehive algorithm based QoS unicast routing scheme with ABC supported. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4847 LNCS, pp. 450–459). Springer Verlag. https://doi.org/10.1007/978-3-540-76837-1_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free