kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
SIP-based context distribution: Does aggregation pay off?
KTH, School of Information and Communication Technology (ICT).
2010 (English)In: SIGCOMM'10 - Proceedings of the SIGCOMM 2010 Conference, 2010, p. 36-46Conference paper, Published paper (Refereed)
Abstract [en]

Context-aware applications need quickly access to current context information, in order to adapt their behavior before this context changes. To achieve this, the context distribution mechanism has to timely discover context sources that can provide a particular context type, then acquire and distribute context information from these sources to the applications that requested this type of information. This paper reviews the state-of-the-art context distribution mechanisms according to identified requirements, then introduces a resource list-based subscription/notification mechanism for context sharing. This SIP-based mechanism enables subscriptions to a resource list containing URIs of multiple context sources that can provide the same context type and delivery of aggregated notifications containing context updates from each of these sources. Aggregation of context is thought to be important as it reduces the network traffic between entities involved in context distribution. However, it introduces an additional delay due to waiting for context updates and their aggregation. To investigate if this aggregation actually pays off, we measured and compared the time needed by an application to receive context updates after subscribing to a particular resource list (using RLS) versus after subscribing to each of the individual context sources (using SIMPLE) for different numbers of context sources. Our results show that RLS aggregation outperforms the SIMPLE presence mechanism with 3 or more context sources, regardless of their context updates size. Database performance was identified as a major bottleneck during aggregation, hence we used in-memory tables & prepared statements, leading to up to 57% database time improvement, resulting in a reduction of the aggregation time by up to 34%. With this reduction and an increase in context size, we pushed the aggregation payoff threshold closer to 2 context sources.

Place, publisher, year, edition, pages
2010. p. 36-46
Keywords [en]
Aggregation, Context distribution, RLS, SIMPLE, XCAP, Context aware applications, Context information, Context sharing, Database performance, Multiple contexts, Network traffic, Prepared statement, Agglomeration, Semantics, Internet protocols
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-304970Scopus ID: 2-s2.0-84872049342ISBN: 9781450302012 (print)OAI: oai:DiVA.org:kth-304970DiVA, id: diva2:1612322
Conference
7th International Conference on Autonomic Computing SIGCOMM 2010, New Delhi, India, Aug 30-3 Sept, 2010
Note

Not duplicate with DiVA 738082.QC 20211117

Available from: 2021-11-17 Created: 2021-11-17 Last updated: 2022-06-25Bibliographically approved

Open Access in DiVA

No full text in DiVA

Scopus

Authority records

Devlic, Alisa

Search in DiVA

By author/editor
Devlic, Alisa
By organisation
School of Information and Communication Technology (ICT)
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 13 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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