Profit-oriented resource allocation using online scheduling in flexible heterogeneous networks
dc.contributor.author | Xu, Peng | en_US |
dc.contributor.author | Michailidis, George | en_US |
dc.contributor.author | Devetsikiotis, Michael | en_US |
dc.date.accessioned | 2006-09-11T19:37:59Z | |
dc.date.available | 2006-09-11T19:37:59Z | |
dc.date.issued | 2006-03 | en_US |
dc.identifier.citation | Xu, Peng; Michailidis, George; Devetsikiotis, Michael; (2006). "Profit-oriented resource allocation using online scheduling in flexible heterogeneous networks." Telecommunication Systems 31 (2-3): 289-303. <http://hdl.handle.net/2027.42/47990> | en_US |
dc.identifier.issn | 1018-4864 | en_US |
dc.identifier.issn | 1572-9451 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/47990 | |
dc.description.abstract | In this paper, we discuss a generalized measurement-based adaptive scheduling framework for dynamic resource allocation in flexible heterogeneous networks, in order to ensure efficient service level performance under inherently variable traffic conditions. We formulate our generalized optimization model based on the notion of a “profit center” with an arbitrary number of service classes, nonlinear revenue and cost functions and general performance constraints. Subsequently, and under the assumption of a linear pricing model and average queue delay requirements, we develop a fast, low complexity algorithm for online dynamic resource allocation, and examine its properties. Finally, the proposed scheme is validated through an extensive simulation study. | en_US |
dc.format.extent | 404737 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers; Springer Science + Business Media, LLC | en_US |
dc.subject.other | Economics / Management Science | en_US |
dc.subject.other | Computer Communication Networks | en_US |
dc.subject.other | Artificial Intelligence (Incl. Robotics) | en_US |
dc.subject.other | Probability Theory and Stochastic Processes | en_US |
dc.subject.other | Business Information Systems | en_US |
dc.subject.other | Resource Allocation | en_US |
dc.subject.other | On Line Scheduling | en_US |
dc.subject.other | Profit Center | en_US |
dc.title | Profit-oriented resource allocation using online scheduling in flexible heterogeneous networks | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Information and Library Science | en_US |
dc.subject.hlbsecondlevel | Electrical Engineering | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.subject.hlbtoplevel | Social Sciences | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Statistics, The University of Michigan, Ann Arbor, MI, 48109, USA | en_US |
dc.contributor.affiliationother | Dept. of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, 27695-7911, USA | en_US |
dc.contributor.affiliationother | Dept. of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, 27695-7911, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/47990/1/11235_2006_Article_6525.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/s11235-006-6525-7 | en_US |
dc.identifier.source | Telecommunication Systems | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.