Decentralized task allocation mechanism applied to QoS routing in home network

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

Abstract

We present in this paper a task allocation mechanism constrained by a distributed, complex environment namely in our case a home network. Thus, added to multi agent systems constraints, we have restrictions in terms of communication (available throughput) and resource (bandwidth). We have a multi agent system with a knowledge base, and we have to ensure a proper quality of service in home Network adjusting the routing in real time by applying alternative route to the main ones. Our approach uses the first price sealed bid type auction: when an agent does not have an alternative route, it launches an auction. The agent offering the best price will be the next hop of the route. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ghedira, E., Molinier, L., & Pujolle, G. (2011). Decentralized task allocation mechanism applied to QoS routing in home network. In Lecture Notes in Business Information Processing (Vol. 78 LNBIP, pp. 146–157). Springer Verlag. https://doi.org/10.1007/978-3-642-20862-1_10

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