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
Scalable policy distribution for ambient networks
KTH, School of Electrical Engineering (EES).
KTH, School of Electrical Engineering (EES).
2005 (English)In: Proceedings of the 14th IST Mobile and Wireless Communication Summit, 2005Conference paper, Published paper (Refereed)
Abstract [en]

 The characteristics of policy-based management make it an interesting candidate for managing Ambient Networks, which are characterized for being highly dynamic and heterogeneous. However, current policy-based approaches are not scalable, which is a must for such dynamic scenarios. A key aspect for developing scalable systems is policy distribution, the mechanism that provides the right policies at the right locations in the network when they are needed. In this paper, we present a scalable framework for policy distribution for Ambient Networks. The framework is based on aggregating the addresses of the policies and applying multipoint communication techniques. The aggregation is based on grouping the managed elements by the role they play in the network and distributing policies that apply to all the elements in a group. We show the validity of the framework by applying it to a study case.

Place, publisher, year, edition, pages
2005.
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-5906OAI: oai:DiVA.org:kth-5906DiVA: diva2:10437
Conference
14th IST Mobile and Wireless Communication Summit, Dresden, Germany, June 19-23, 2005
Note
QC 20101115. Uppdaterad från Manuskript till Artikel (20101115).Available from: 2006-06-01 Created: 2006-06-01 Last updated: 2011-02-22Bibliographically approved
In thesis
1. Adaptive management for networked systems
Open this publication in new window or tab >>Adaptive management for networked systems
2006 (English)Licentiate thesis, comprehensive summary (Other scientific)
Abstract [en]

As networked systems grow in size and dynamicity, management systems must become adaptive to changing networking conditions. The focus of the work presented in this thesis is on developing engineering principles for adaptive management systems. We investigate three problems in the context of adaptive management for networked systems.

First, we address the control of the performance of an SMS system. We present a design for policy-based performance management of such systems. The design takes as input the operator's performance goals, which are expressed as policies that can be adjusted at run-time. The system attempts to achieve the given goals by periodically solving an optimization problem that takes as input the policies and traffic statistics and computes a new configuration. We have evaluated the design through extensive simulations in various scenarios and compared it with an ideal system. A prototype has been developed on a commercial SMS platform, which proves the validity of our design.

Second, we address the problem of decentralized continuous monitoring of network state variables with configurable accuracy. Network state variables are computed from device counters using aggregation functions, such as SUM, AVERAGE and MAX. We present A-GAP, a protocol that aims at minimizing the management overhead for a configurable average error of the estimation of the global aggregate. The protocol follows the push approach to monitoring and uses the concept of incremental aggregation on a self-stabilizing spanning tree. A-GAP is decentralized and asynchronous to achieve robustness and scalability. We evaluate the protocol through simulation in several scenarios. The results show that we can effectively control the fundamental trade-off in monitoring between accuracy and overhead.

Third, we aim at improving the performance of the policy distribution task: the mechanism that provides the right policies at the right locations in the network when they are needed. Policy distribution is a key aspect for developing policy-based systems that scale, which is a must for dynamic scenarios. We present a scalable framework for policy distribution. The framework is based on aggregating the addresses of the policies and applying multipoint communication techniques. We show the validity of the framework in a case study.

Place, publisher, year, edition, pages
Stockholm: KTH, 2006. 35 p.
Series
Trita-EE, ISSN 1653-5146 ; 2006:018
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-4022 (URN)
Presentation
2006-06-07, 10:00
Note
QC 20101115Available from: 2006-06-01 Created: 2006-06-01 Last updated: 2010-11-15Bibliographically approved

Open Access in DiVA

No full text

Other links

Eurosip.org

Search in DiVA

By author/editor
Gonzales Prieto, AlbertoStadler, Rolf
By organisation
School of Electrical Engineering (EES)
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 58 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