hkr.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Load transients in pooled cellular core network nodes
Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap. Ericsson AB.
Uppsala University.
2015 (English)In: Performance evaluation (Print), ISSN 0166-5316, Vol. 90, 18-35 p.Article in journal (Refereed) Published
Abstract [en]

The coverage areas of cellular networks are logically subdivided into service areas. Each service area has a local anchor node which “hides” the mobility inside the area and the entire network has a global anchor node which “hides” the mobility between areas.

The concept of unique local anchor nodes per service area was invented to simplify routing but has been found to complicate expansion. The rapidly growing demand for cellular access has therefore prompted for alternative solutions with pools of local anchor nodes per service area. Such pools are now deployed by several operators all over the world.

Users in pooled service areas are mapped to specific pool members according to a load distribution policy, but the mapping can change as a result of node failures or operator interventions. Such changes take a certain time to implement and cause additional load on the anchor nodes. We study these processes in detail and derive closed form expressions which allow operators to control the trade-off between rapid changes and acceptable loads.

Finally we show that the key assumptions of our model are in agreement with measured data and demonstrate how the model can be applied to investigate the effects of different network settings (timers) under different user behaviour (traffic and mobility).

Contrary to current solutions to this problem, which typically are slow and/or inaccurate, our results enable fast and accurate analysis of different scenarios thereby enabling operators to maximise utilisation of the existing investments and at the same time avoid potentially dangerous situations of overload.

Place, publisher, year, edition, pages
2015. Vol. 90, 18-35 p.
Keyword [en]
Iu-flex, S1-flex, pool, node failure, user redistribution
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:hkr:diva-13938DOI: 10.1016/j.peva.2015.04.001ISI: 000358092200002OAI: oai:DiVA.org:hkr-13938DiVA: diva2:813939
Available from: 2015-05-25 Created: 2015-05-25 Last updated: 2015-09-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Arvidsson, Åke
By organisation
Avdelningen för Design och datavetenskap
In the same journal
Performance evaluation (Print)
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 94 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf