Conference paper Open Access
Bui, Nicola; Malanchini, Ilaria; Widmer, Joerg
<?xml version='1.0' encoding='utf-8'?> <rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:adms="http://www.w3.org/ns/adms#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dct="http://purl.org/dc/terms/" xmlns:dctype="http://purl.org/dc/dcmitype/" xmlns:dcat="http://www.w3.org/ns/dcat#" xmlns:duv="http://www.w3.org/ns/duv#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:frapo="http://purl.org/cerif/frapo/" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:gsp="http://www.opengis.net/ont/geosparql#" xmlns:locn="http://www.w3.org/ns/locn#" xmlns:org="http://www.w3.org/ns/org#" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:prov="http://www.w3.org/ns/prov#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:schema="http://schema.org/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:vcard="http://www.w3.org/2006/vcard/ns#" xmlns:wdrs="http://www.w3.org/2007/05/powder-s#"> <rdf:Description rdf:about="https://zenodo.org/record/51786"> <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">https://zenodo.org/record/51786</dct:identifier> <foaf:page rdf:resource="https://zenodo.org/record/51786"/> <dct:creator> <rdf:Description> <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/> <foaf:name>Bui, Nicola</foaf:name> <foaf:givenName>Nicola</foaf:givenName> <foaf:familyName>Bui</foaf:familyName> <org:memberOf> <foaf:Organization> <foaf:name>IMDEA Networks Institute, UC3M, Leganes</foaf:name> </foaf:Organization> </org:memberOf> </rdf:Description> </dct:creator> <dct:creator> <rdf:Description> <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/> <foaf:name>Malanchini, Ilaria</foaf:name> <foaf:givenName>Ilaria</foaf:givenName> <foaf:familyName>Malanchini</foaf:familyName> <org:memberOf> <foaf:Organization> <foaf:name>Bell Labs, Alcatel-Lucent</foaf:name> </foaf:Organization> </org:memberOf> </rdf:Description> </dct:creator> <dct:creator> <rdf:Description> <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/> <foaf:name>Widmer, Joerg</foaf:name> <foaf:givenName>Joerg</foaf:givenName> <foaf:familyName>Widmer</foaf:familyName> <org:memberOf> <foaf:Organization> <foaf:name>IMDEA Networks Institute</foaf:name> </foaf:Organization> </org:memberOf> </rdf:Description> </dct:creator> <dct:title>Anticipatory Admission Control and Resource Allocation for Media Streaming in Mobile Networks</dct:title> <dct:publisher> <foaf:Agent> <foaf:name>Zenodo</foaf:name> </foaf:Agent> </dct:publisher> <dct:issued rdf:datatype="http://www.w3.org/2001/XMLSchema#gYear">2015</dct:issued> <dcat:keyword>Prediction, Resource Allocation</dcat:keyword> <dcat:keyword>Admission Control</dcat:keyword> <dcat:keyword>Mobile Networks</dcat:keyword> <dct:issued rdf:datatype="http://www.w3.org/2001/XMLSchema#date">2015-11-06</dct:issued> <owl:sameAs rdf:resource="https://zenodo.org/record/51786"/> <adms:identifier> <adms:Identifier> <skos:notation rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">https://zenodo.org/record/51786</skos:notation> <adms:schemeAgency>url</adms:schemeAgency> </adms:Identifier> </adms:identifier> <owl:sameAs rdf:resource="https://doi.org/10.1145/2811587.2811604"/> <dct:isPartOf rdf:resource="https://zenodo.org/communities/h2020_monroe"/> <dct:description><p>The exponential growth of media streaming traffic will have a strong impact on the bandwidth consumption of the future wireless infrastructure. One key challenge is to deliverservices taking into account the stringent requirements of mobile video streaming, e.g., the users&rsquo; expected Quality-of-Service. Admission control and resource allocation can strongly benefit from the use of anticipatory information such as the prediction of future user&rsquo;s demand and expected channel gain. In this paper, we use this information to formulate an optimal admission control scheme that maximizes the number of accepted users into the system with the constraint that not only the current but also the expected demand of all users must be satisfied. Together with the optimal set of accepted users, the optimal resource scheduling is derived. In order to have a solution that can be computed in a reasonable time, we propose a low complexity heuristic. Numerical results show the performance of the proposed scheme with respect to the state of the art.</p></dct:description> <dct:accessRights rdf:resource="http://publications.europa.eu/resource/authority/access-right/PUBLIC"/> <dct:accessRights> <dct:RightsStatement rdf:about="info:eu-repo/semantics/openAccess"> <rdfs:label>Open Access</rdfs:label> </dct:RightsStatement> </dct:accessRights> <dct:rights> <dct:RightsStatement rdf:about="https://opensource.org/licenses/afl-3.0"> <rdfs:label>Academic Free License v3.0</rdfs:label> </dct:RightsStatement> </dct:rights> <dcat:distribution> <dcat:Distribution> <dcat:accessURL rdf:resource="https://doi.org/10.1145/2811587.2811604"/> <dcat:byteSize>857764</dcat:byteSize> <dcat:downloadURL rdf:resource="https://zenodo.org/record/51786/files/Anticipatory_Admission_Control_Resource_Allocation_2015_EN.pdf"/> <dcat:mediaType>application/pdf</dcat:mediaType> </dcat:Distribution> </dcat:distribution> </rdf:Description> </rdf:RDF>
Views | 122 |
Downloads | 112 |
Data volume | 96.1 MB |
Unique views | 121 |
Unique downloads | 111 |