HEAL DSpace

Adaptive QoS provisioning by pricing incentive QoS routing for next generation networks

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Cheng, G en
dc.contributor.author Ansari, N en
dc.contributor.author Papavassiliou, S en
dc.date.accessioned 2014-03-01T01:27:49Z
dc.date.available 2014-03-01T01:27:49Z
dc.date.issued 2008 en
dc.identifier.issn 0140-3664 en
dc.identifier.uri http://hdl.handle.net/123456789/18596
dc.subject Pricing en
dc.subject QoS routing en
dc.subject Service vector en
dc.subject Utility function en
dc.subject.classification Computer Science, Information Systems en
dc.subject.classification Engineering, Electrical & Electronic en
dc.subject.classification Telecommunications en
dc.subject.other Information analysis en
dc.subject.other Mathematical models en
dc.subject.other Network routing en
dc.subject.other Resource allocation en
dc.subject.other QoS routing en
dc.subject.other Service vector en
dc.subject.other Utility function en
dc.subject.other Quality of service en
dc.title Adaptive QoS provisioning by pricing incentive QoS routing for next generation networks en
heal.type journalArticle en
heal.identifier.primary 10.1016/j.comcom.2008.02.019 en
heal.identifier.secondary http://dx.doi.org/10.1016/j.comcom.2008.02.019 en
heal.language English en
heal.publicationDate 2008 en
heal.abstract In this paper, we present an integrated solution for enabling the next generation Internet to achieve the differentiated service and availability guarantee. In particular, we utilize a recent proposed service architecture, referred to as Service Vector (SV), to enhance the QoS granularity and flexibility offered in the Diffserv network model and improve both the network resource utilization and user benefits. In order to efficiently and effectively use network resources, we investigate the issue of integrating pricing into QoS routing and propose a PRicing InCEntive QoS Routing (PRICER) mechanism. PRICER consists of two components: a novel routing-oriented state update (ROSE) scheme and an efficient Pricing Incentive Routing Algorithm (PIRA). ROSE performs the task of exchanging link state information throughout the network, and PIRA is a routing algorithm used to find paths meeting the QoS requirements of applications. By theoretical analysis and extensive simulations, we show that ROSE greatly outperforms the state of the arts in terms of both protocol overhead and the accuracy of link state information, and PIRA can guarantee finding the QoS constrained path with fairly low average computational complexity. The most distinguished property of PIRA is its progressive property, which is very useful in practice: it can self-adaptively minimize its computational complexity without sacrificing its performance, Another contribution of this paper is the introduction of a method to numerically evaluate the staleness of link state information. (C) 2008 Elsevier B.V. All rights reserved. en
heal.publisher ELSEVIER SCIENCE BV en
heal.journalName Computer Communications en
dc.identifier.doi 10.1016/j.comcom.2008.02.019 en
dc.identifier.isi ISI:000258035900042 en
dc.identifier.volume 31 en
dc.identifier.issue 10 en
dc.identifier.spage 2308 en
dc.identifier.epage 2318 en


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record