Journal article Open Access

Lightweight Capacity Measurements For Mobile Networks

Michelinakis, Foivos; Bui, Nicola; Fioravantti, Guido; Widmer, Joerg; Kaup, Fabian; Hausheer, David


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">Mobile capacity</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">measurement</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">Packet dispersion</subfield>
  </datafield>
  <controlfield tag="005">20200120174304.0</controlfield>
  <controlfield tag="001">51784</controlfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">IMDEA Networks Institute, Universidad Carlos III de Madrid</subfield>
    <subfield code="a">Bui, Nicola</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">CartoDB Inc.</subfield>
    <subfield code="a">Fioravantti, Guido</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">IMDEA Networks Institute</subfield>
    <subfield code="a">Widmer, Joerg</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">P2P Systems Engineering, Technische Universitat Darmstadt</subfield>
    <subfield code="a">Kaup, Fabian</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">P2P Systems Engineering, Technische Universitat Darmstadt</subfield>
    <subfield code="a">Hausheer, David</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">2273224</subfield>
    <subfield code="z">md5:cc07935a091f3ed65fdab4c67134bff9</subfield>
    <subfield code="u">https://zenodo.org/record/51784/files/Lightweight_Capacity_Measurements_Mobile_Networks_2016_EN.pdf</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2016-02-01</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="p">user-h2020_monroe</subfield>
    <subfield code="o">oai:zenodo.org:51784</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">IMDEA Networks Institute, Universidad Carlos III de Madrid</subfield>
    <subfield code="a">Michelinakis, Foivos</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Lightweight Capacity Measurements For Mobile Networks</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-h2020_monroe</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">https://opensource.org/licenses/afl-3.0</subfield>
    <subfield code="a">Academic Free License v3.0</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;Mobile data traffic is increasing rapidly and wireless spectrum is becoming a more and more scarce resource. This makes it highly important to operate mobile networks efficiently. In this paper we are proposing a novel lightweight measurement technique that can be used as a basis for advanced resource optimization algorithms to be run on mobile phones. Our main idea leverages an original packet dispersion based technique to estimate per user capacity. This allows passive measurements by just sampling the existing mobile traffic. Our technique is able to efficiently filter outliers introduced by mobile network schedulers and phone hardware. In order to asses and verify our measurement technique, we apply it to a diverse dataset generated by both extensive simulations and a week-long measurement campaign spanning two cities in two countries, different radio technologies, and covering all times of the day. The results demonstrate that our technique is effective even if it is provided only with a small fraction of the exchanged packets of a flow. The only requirement for the input data is that it should consist of a few consecutive packets that are gathered periodically. This makes the measurement algorithm a good candidate for inclusion in OS libraries to allow for advanced resource optimization and application-level traffic scheduling, based on current and predicted future user capacity.&lt;/p&gt;</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1016/j.comcom.2016.02.005</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
</record>
103
27
views
downloads
Views 103
Downloads 27
Data volume 61.4 MB
Unique views 103
Unique downloads 27

Share

Cite as