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
Adaptive management for networked systems
KTH, School of Electrical Engineering (EES).
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: urn:nbn:se:kth:diva-4022OAI: oai:DiVA.org:kth-4022DiVA: diva2:10438
Presentation
2006-06-07, 10:00
Note
QC 20101115Available from: 2006-06-01 Created: 2006-06-01 Last updated: 2010-11-15Bibliographically approved
List of papers
1. Design and Implementation of Performance Policies for SMS Systems
Open this publication in new window or tab >>Design and Implementation of Performance Policies for SMS Systems
2005 (English)In: AMBIENT NETWORKS, Berlin: Springer Verlag , 2005, 169-180 p.Conference paper, Published paper (Refereed)
Abstract [en]

We present a design for policy-based performance management of SMS Systems. The design takes as input the operator's performance goals, which are expressed as policies that can be adjusted at run-time. In our specific design, an SMS administrator can specify the maximum delay for a message and the maximum percentage of messages that can be postponed during periods of congestion. The system attempts to maximize the overall throughput while adhering to the performance policies. It does so by periodically solving a linear optimization problem that takes as input the policies and traffic statistics and computes a new configuration. We show that the computational cost for solving this problem is low, even for large system configurations. We have evaluated the design through extensive simulations in various scenarios. It has proved effective in achieving the administrator's performance goals and fast in adapting to changing network conditions. A prototype has been developed on a commercial SMS platform, which proves the validity of our design.

Place, publisher, year, edition, pages
Berlin: Springer Verlag, 2005
Series
LECTURE NOTES IN COMPUTER SCIENCE, ISSN 0302-9743 ; 3775
Keyword
Administrative data processing, Costs, Mobile telecommunication systems, Optimization, Problem solving, Public policy, Software prototyping
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-5904 (URN)000233789600015 ()2-s2.0-33646741222 (Scopus ID)3-540-29388-4 (ISBN)
Conference
16th IFIP/IEEE International Workshop on Distributed Systems - Operations and Management (DSOM), Barcelona, SPAIN, OCT 24-26, 2005
Note
QC 20101115. Uppdaterad från Manuskript till Artikel (20101115).Available from: 2006-06-01 Created: 2006-06-01 Last updated: 2011-10-12Bibliographically approved
2. Distributed real-time monitoring with accuracy objectives
Open this publication in new window or tab >>Distributed real-time monitoring with accuracy objectives
2006 (English)In: NETWORKING 2006: NETWORKING TECHNOLOGIES, SERVICES, AND PROTOCOLS; PERFORMANCE OF COMPUTER AND COMMUNICATION NETWORKS; MOBILE AND WIRELESS COMMUNICATIONS SYSTEMS    / [ed] Boavida F, Plagemann T, Stiller B, Westphal C, Monteiro E, Berlin: Springer Verlag , 2006, 1246-1251 p.Conference paper, Published paper (Refereed)
Abstract [en]

We introduce A-GAP, a protocol for 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. In A-GAP, the accuracy is expressed in terms of the average error and is controlled by dynamically configuring filters in the management nodes. 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 provide some results from evaluating the protocol for an ISP topology (Abovenet) in several scenarios through simulation. The results show that we can effectively control the fundamental trade-off between accuracy and overhead. The protocol overhead can be reduced significantly by allowing only small error objectives.

Place, publisher, year, edition, pages
Berlin: Springer Verlag, 2006
Series
LECTURE NOTES IN COMPUTER SCIENCE, ISSN 0302-9743 ; 3976
Keyword
Control system analysis, Distributed computer systems, Function evaluation, Network protocols, Robustness (control systems), Topology, Trees (mathematics)
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-5905 (URN)000238114800116 ()2-s2.0-33745925268 (Scopus ID)3-540-34192-7 (ISBN)
Conference
5th International IFIP-TC6 Networking Conference Coimbra, PORTUGAL, MAY 15-19, 2006
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
3. Scalable policy distribution for ambient networks
Open this publication in new window or tab >>Scalable policy distribution for ambient networks
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.

National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-5906 (URN)
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

Open Access in DiVA

fulltext(441 kB)427 downloads
File information
File name FULLTEXT01.pdfFile size 441 kBChecksum MD5
679203b9309e4ceed107afaa511ee21de622bc958c6f045d6b4038f89b67efa939306bf3
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Gonzalez Prieto, Alberto
By organisation
School of Electrical Engineering (EES)
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 427 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

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