Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/55646
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Nguyen, H. | - |
dc.contributor.author | Thiran, P. | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | IEEE 26th IEEE International Conference on Computer Communications, 2007: pp.2117-2125 | - |
dc.identifier.isbn | 1424410479 | - |
dc.identifier.isbn | 9781424410477 | - |
dc.identifier.issn | 0743-166X | - |
dc.identifier.uri | http://hdl.handle.net/2440/55646 | - |
dc.description.abstract | We develop an economic model for networks offering tiered services and we formulate the problem of selecting the service tiers from three perspectives: one that considers the users’ interests only, one that considers only the service provider’s interests, and one that considers both simultaneously, i.e., the interests of society as a whole. We also present dynamic programming algorithms that solve these problems optimally. Our work provides a theoretical framework for reasoning about Internet tiered services, as well as a practical toolset for network providers to develop customized menus of service offerings. | - |
dc.description.statementofresponsibility | Qian Lv and George N. Rouskas | - |
dc.language.iso | en | - |
dc.publisher | IEEE | - |
dc.source.uri | http://dx.doi.org/10.1109/infcom.2007.245 | - |
dc.title | The boolean solution to the congested IP link location problem: theory and practice | - |
dc.type | Conference paper | - |
dc.contributor.conference | Annual Joint Conference of the IEEE Computer and Communications Societies (26th : 2007 : Anchorage, Alaska) | - |
dc.identifier.doi | 10.1109/INFCOM.2007.245 | - |
dc.publisher.place | Online | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Nguyen, H. [0000-0003-1028-920X] | - |
Appears in Collections: | Aurora harvest Mathematical Sciences publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.