Policy interoperability and network autonomics

Magrath, S; Braun, R; Cuervo, F

Policy interoperability and network autonomics

Magrath, S Braun, R

Cuervo, F

Permalink

Publication Type:: Journal Article
Citation:: Lecture Notes in Computer Science, 2005, 3457 pp. 25 - 43
Issue Date:: 2005-09-19

Closed Access

	Filename	Description	Size
	2005000779.pdf		773.03 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Magrath, S	en_US
dc.contributor.author	Braun, R https://orcid.org/0000-0002-4153-8769	en_US
dc.contributor.author	Cuervo, F	en_US
dc.date.issued	2005-09-19	en_US
dc.identifier.citation	Lecture Notes in Computer Science, 2005, 3457 pp. 25 - 43	en_US
dc.identifier.issn	0302-9743	en_US
dc.identifier.uri	http://hdl.handle.net/10453/4997
dc.description.abstract	Autonomic behaviours in network operations will alleviate much of the labour intensive and error prone interventions of today's complex networks. The Service Provider must be able to manage the infrastructure and services at an abstract level, focusing on what the desired behaviour should be rather than how it might be specifically achieved. Policy-Based Network Management (PBNM) appears as one of the leading mechanisms to describe desired behaviours and abstract the programmability of an autonomic network infrastructure to the Service Provider. For massive-scale and complex networks, the current understanding of the Higher Level to Lower Level (HL→LL) refinement process commonly used in PBNM today is not completely effective. One problem encountered is the need to provide a bind mechanism between Higher Level and Lower Level policy specifications such that cross-layer policy requests in the policy continuum can be made by lower policy layers in a dynamic policy refinement cycle (LL→HL→LL). In this paper, we illustrate the problem with a policy-based simple admission control (SAC) application. We then show that policy specifications with a join operator (times sign closed) simplify the SAC specification. We also investigate the performance considerations of this enhancement in Internet size applications. Our future goal is to provide a policy inference engine that can support complex specifications appropriate for PBNM systems that support autonomic behaviours in large networks, made of Network elements with realistic memory and processing constraints. © IFIP International Federation for Information Processing 2005.	en_US
dc.relation.ispartof	Lecture Notes in Computer Science	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	Policy interoperability and network autonomics	en_US
dc.type	Journal Article
utslib.citation.volume	3457	en_US
utslib.for	0803 Computer Software	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	3457	en_US

Abstract:

Autonomic behaviours in network operations will alleviate much of the labour intensive and error prone interventions of today's complex networks. The Service Provider must be able to manage the infrastructure and services at an abstract level, focusing on what the desired behaviour should be rather than how it might be specifically achieved. Policy-Based Network Management (PBNM) appears as one of the leading mechanisms to describe desired behaviours and abstract the programmability of an autonomic network infrastructure to the Service Provider. For massive-scale and complex networks, the current understanding of the Higher Level to Lower Level (HL→LL) refinement process commonly used in PBNM today is not completely effective. One problem encountered is the need to provide a bind mechanism between Higher Level and Lower Level policy specifications such that cross-layer policy requests in the policy continuum can be made by lower policy layers in a dynamic policy refinement cycle (LL→HL→LL). In this paper, we illustrate the problem with a policy-based simple admission control (SAC) application. We then show that policy specifications with a join operator (times sign closed) simplify the SAC specification. We also investigate the performance considerations of this enhancement in Internet size applications. Our future goal is to provide a policy inference engine that can support complex specifications appropriate for PBNM systems that support autonomic behaviours in large networks, made of Network elements with realistic memory and processing constraints. © IFIP International Federation for Information Processing 2005.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/4997