32 Hits in 0.45 sec

Integrated Service Deployment for Active Networks [chapter]

Matthias Bossardt, Takashi Egawa, Hideki Otsuki, Bernhard Plattner
2002 Lecture Notes in Computer Science  
A key feature of active networks is the capability to dynamically deploy services. In this paper, we present a scheme to classify service deployment mechanisms of existing or future active network architectures. Distributed algorithms (services), as being implemented in active networks, can be described based on active packets or as distributed programs running on active nodes. Although both programming models are basically equivalent, some services are more naturally implemented in either way.
more » ... This paper proposes an active node architecture that supports the implementation and deployment of services according to both programming models. We point out that a combination of in-band and out-of-band service deployment is needed to dynamically deploy services implemented in either model. Furthermore, we argue that composing services from service logic implemented in either programming model is beneficial for the design of efficient and flexible services. We reason that a service abstraction in the form of a service description language is necessary to cope with real world scenarios.
doi:10.1007/3-540-36199-5_6 fatcat:rl4jajzrzfgqdd6qyydsxyyxie

Component-Based Deployment and Management of Services in Active Networks [chapter]

Marcin Solarski, Matthias Bossardt, Thomas Becker
2002 Lecture Notes in Computer Science  
This paper 1 describes a holistic approach towards the deployment and runtime management of services on active network nodes taken by the FAIN project. Both the underlying service model and the architectures supporting deployment and management are component oriented. The separation of service meta-information and implementation code allows for a very flexible way of service deployment management as it facilitates selective code distribution, finegrained installation and instantiation. Active
more » ... rvices are composed from a set of service components that can be selected on demand at deployment time and installed in any combination of the data, control, and management planes which enables realisation of arbitrary active services.
doi:10.1007/3-540-36199-5_7 fatcat:ickqao7k5nh7xirbpbyw5kicvy

Chameleon: Realizing Automatic Service Composition for Extensible Active Routers [chapter]

Matthias Bossardt, Roman Hoog Antink, Andreas Moser, Bernhard Plattner
2004 Lecture Notes in Computer Science  
Complex network services can be constructed by composing simpler service components in a well defined way. To benefit most from such an approach, service components should be reusable for different services. Furthermore the composition must be performed automatically and customized to the service execution platform. In this paper, we focus on node local aspects of service composition. We contribute design and implementation details of Chameleon, a system targeted at automatic service
more » ... . Our system is based on (1) service descriptors containing meta-information about service components and (2) a service creation engine composing and installing services in a platform specific and automatic way. Target platforms are modeled as active nodes featuring Execution Environments (EEs) to serve as runtime environments for service components. To validate our concepts, we implemented an active node. It features two different EEs, an EE based on Click router technology, which is suitable for forwarding plane services, as well as a general purpose Java-based EE. A demonstration service, which performs traffic shaping, is briefly presented to illustrate the concepts and their applicability. ⋆ This work is partly funded by ETH Zürich and Swiss Bundesamt für Bildung und Wissenschaft (BBW) under grant number 99.0533. A subset of it is part of ETH's contribution and work as a partner in the European project IST-FAIN (IST-1999-10561).
doi:10.1007/978-3-540-24715-9_15 fatcat:oolydvlyorg7zn37a2ydlxnvqi

Automated Pattern-Based Service Deployment in Programmable Networks

Daniela Brauckhoff, Matthias Bossardt, Bernhard Plattner
2006 Journal of Network and Systems Management  
Matthias Bossardt received a Master of Electrical Engineering from the Swiss Federal Institute of Technology, Lausanne (EPFL) in 1998 and was awarded the ABB Switzerland Research Prize.  ... 
doi:10.1007/s10922-005-9014-5 fatcat:x35hyt6nv5hw3ejjm66c5drsfy

A Service Deployment Architecture for Heterogenous Active Networks Nodes [chapter]

Matthias Bossardt, Lukas Ruf, Bernhard Plattner, Rolf Stadler
2002 IFIP Advances in Information and Communication Technology  
In order to realise service deployment on high-performance active nodes, the problem of installing and configuring software components in complex, heterogeneous node environments must be addressed. The paper presents our approach to this problem, called Chameleon. The service specification is kept independent of any particular node architecture. During the service deployment phase, the service specification is resolved recursively on each node offering the service and is driven by node-specific
more » ... parameters. The result of this resolution is a tree of service components, which can differ among different types ofnodes. Our solution allows a service to take full advantage of specific node features, such as those related to performance or security. The design is illustrated using a video scaling service.
doi:10.1007/978-0-387-35584-9_3 fatcat:wx2b6trpgffuranjhyo64metr4

Validating Inter-domain SLAs with a Programmable Traffic Control System [chapter]

Elisa Boschi, Matthias Bossardt, Thomas Dübendorfer
2009 Lecture Notes in Computer Science  
For network users and service providers it is important to validate the compliance of network services to the guarantees given in Service Level Agreements (SLAs). This is particularly challenging in inter-domain environments. In this paper, we propose a novel solution for inter-domain SLA validation, based on programmable traffic processing devices that are attached to routers and located in several autonomous systems. Using our service management infrastructure, the measurement logic is
more » ... d on the traffic processing devices in a flexible and secure way. We safely delegate partial network management capability from network operators to network users, which are enabled to configure service logic on the traffic processing devices. At the same time, the management infrastructure guarantees against negative influence of the network user's configuration on network stability or other user's traffic. Via the flexible configuration of service logic, our system gives network users powerful means to observe quality of service parameters agreed upon in SLAs. We present a detailed scenario of the SLA validation service and its deployment across several administrative domains. Keywords: inter-domain measurement, programmable networks, SLA validation, network service, management delegation customers that stipulate SLAs with one single ISPs have concerns that the agreed Quality of Service has been met, and are therefore interested in end-to-end, inter-domain measurements. Classical measurement architectures determine end-to-end, or edge-to-edge performance, comparing ingress and egress reports from two measurement devices located at the end points of a flow. These architectures though, are not sufficient to determine performance of specific path portions, or to determine which segments failed to provide the expected Quality of Service (QoS) in case the end-to-end guarantees are not met. If for instance the delay is higher than agreed in the SLA, it is not possible to determine in which administrative domain the higher delay occurred (or in other words: which ISP is responsible for not meeting the requirements). Another problem with such architectures is that they require to configure two edge devices and retrieve information from them. This configuration is difficult in case the devices are not located in the same administrative domain, since ISPs have major security related concerns in delegating any management function to third parties. These concerns are based on the risk that third party configurations may negatively affect network stability or other user's network traffic. In this paper, we present a novel solution for inter-domain SLA validation that allows deploying measurement logic on distributed devices in a flexible and secure way. The system is flexible in that it allows the deployment of almost arbitrary service logic with just a few restrictions that we specify later in this paper. These restrictions, together with the concept of traffic ownership [9, 5] are used in our system to address the ISPs' security concerns. The goal of our architecture is to configure on demand several measurement devices along a flow path in a multi domain environment, and to process the raw measurement data, in order to determine the QoS experienced by the flow on several nodes of its path. With these kind of measures, an end user, or a monitoring application, could determine not only the end-to-end QoS, but also the QoS provided on different path segments even if belonging to different administrative domains. This paper is organized as follows. Section 2 discusses the state of the art in interdomain measurements. Section 3 discusses our distributed architecture for end-to-end SLA validation, describing the underlying traffic control system and how it can be used for effective, flexible and secure inter-domain measurements. A detailed scenario is presented in Section 4. Finally, we draw our conclusions in Section 5.
doi:10.1007/978-3-642-00972-3_1 fatcat:bqumaxdvyvgy7drarkfmt3hv2a

Automated pattern-based service deployment in programmable networks

Daniela Brauckhoff, Matthias Bossardt, Bernhard Plattner
This paper presents a flexible service deployment architecture for the automated, ondemand deployment of distributed services in programmable networks. The novelty of our approach is (a) the customization of the deployment protocol by utilizing modular building blocks, namely navigation patterns, aggregation patterns, and capability functions, and (b) the definition of a corresponding service descriptor. A customizable deployment protocol has several important advantages: It supports a
more » ... of services, and it allows for an ad hoc optimization of the protocol according to the specific needs of a service and the current network conditions. Moreover, our architecture provides an environment for studying new patterns which aim at reducing deployment latency and bandwidth for certain services. We demonstrate how the developed architecture can be used to setup a virtual private network, and we present measurements conducted with our prototype in the PlanetLab test network. Furthermore, a comparison of a distributed pattern with a centralized pattern illustrates the performance trade-off for different deployment strategies.
doi:10.3929/ethz-b-000024743 fatcat:3wmf3xc43vc7fhgevjpgyyef3q

Self-Organization in Peer-to-Peer Systems

Hermann de Meer, Matthias Bossardt, Georg Carle, D. Hutchison, Bernhard Plattner
Peer-to-Peer Systems are about community-based cooperations. The peers share responsibilities and benefits by cooperating in a distributed and decentralized environment. To carry out tasks sensibly, however, a more or less rigid order is required for efficiency and reliability reasons. This order can be partially imposed from the outside, for example within so-called "structed" Peer-to-Peer systems. A common approach here is the use of Distributed Hash Tables. Alternatively, Peer-to-Peer
more » ... can be "unstructured" in the sense that an useful order emerges from own internal processes. Unstructured and structured Peer-to-Peer systems rely both on a more or less decentralized overlay management. Self-organization, therefore, is a key to the success of Peer-to-Peer systems in various forms. This presentation gives an overview of the role of self-organization in Peer-to-Peer systems.
doi:10.4230/dagsemproc.04411.17 fatcat:sqfta3rx4jfxfkga2evosnaz44

Self-Healing Protocol Implementations

Christian Tschudin, Lidia Yamamoto, Matthias Bossardt, Georg Carle, D. Hutchison, Hermann de Meer, Bernhard Plattner
Current studies on self-configuring and adaptive networks aim at developing specific and fixed protocols which are able to optimize their configuration in a variable network environment. In this talk we study the problem where the protocols need to cope with a defective execution, including the lossy execution or the injection of foreign code. One guiding question will be the creation of robust execution circuits which can distribute over a network and which continue their service despite parts
more » ... of the implementation being knocked out. The ultimate goal is to enable protocol implementations to detect by themselves that they are malfunctioning and to let them correct their own operation mode and code base. As a show case, we present a protocol implementation which is robust against deletion (knock-out) of any single instruction, regardless whether this deletion affects the core protocol functionality or the resilience logic. The technique used in this first of its kind example is the self-modification of the running program, which can be naturally situated in an active networking context. Ultimately, a self-correcting protocol implementation has to constantly rewrite itself according to the (self-)observed performance. In this talk we will also point to related fields like self-correcting software, fault tolerant quantum computing and self-healing properties of biological systems. This is joint work with Lidia Yamamoto, Hitachi Europe.
doi:10.4230/dagsemproc.04411.16 fatcat:sh6xxnbmqzevtcpzfhci5duvci

Composite Protocols and Networking Services

Gary Minden, Matthias Bossardt, Georg Carle, D. Hutchison, Hermann de Meer, Bernhard Plattner
Active Networking is concerned with the rapid definition and deployment of innovative, but reliable and robust, networking services. Towards this end we have developed a composite protocol and networking services architecture that encourages re-use of protocol functions, is well defined, and facilitates automatic checking of interfaces and protocol component properties. The architecture has been used to implement common Internet protocols and services. We will report on this work at the workshop.
doi:10.4230/dagsemproc.04411.8 fatcat:vyabu2ip6zhevooevdt35akgpq

From Active Networks to Cognitive Networks

Manolis Sifalakis, David Hutchison, Matthias Bossardt, Georg Carle, D. Hutchison, Hermann de Meer, Bernhard Plattner
Future networks need to be autonomic self-managed and provide resilient servicing, even when the hardware fails. To achieve this goal, two fundamental requirements need to be satisfied: (i) the service management and provisioning must be independent and decoupled of the infrastructure management, and (ii) a certain degree of cognitive behaviour needs to be achieved at the service management level. In achieving the first goal, which in turn will enable the pursuing of the second goal, active and
more » ... programmable networks will play an important role. A problem though arises when we try to build and use actual active networks, as most research so far has focused at the node level and has left us with a unbridged diversity of platforms and execution environments, which are largely uninteroperable with each other. We introduce a toolkit that provides a set of mechanisms aiming to bridge this diversity and provide a set of functionalities and abstractions for uniform installation and deployment of services over active and programmable networks.
doi:10.4230/dagsemproc.04411.12 fatcat:3tadcot4bjc5tkgtkemacdpcdm

Service Provisioning Framework for Self-Organized Networks

Karoly Farkas, Lukas Ruf, Bernhard Plattner, Matthias Bossardt, Georg Carle, D. Hutchison, Hermann de Meer
Mobile ad hoc networking, as a typical example of self-organized networks, is an emerging and promising communication paradigm. Not only the variety of devices but also the diversity of services is continuously increasing. Such services must be provisioned in a flexible and distributed way without central infrastructure. Thus, service deployment and management for such mobile devices are extremely difficult since a provisioning framework must cope with the high level of heterogeneity, degree of
more » ... mobility, and take limited device resources into account. In this talk, we introduce SIRAMON, a generic, decentralized service provisioning framework for self-organized networks. SIRAMON integrates the required functions to deal with the full life- cycle of services. SIRAMON offers sufficient capabilities to specify, deploy, instantiate and manage not only trivial but also complex services like mobile ad hoc group applications.
doi:10.4230/dagsemproc.04411.18 fatcat:ok67u6kp6naotps6yguucp4diq

Project Venezia-Gondola (A Framework for P-Commerce)

Raymond Gao, Matthias Bossardt, Georg Carle, D. Hutchison, Hermann de Meer, Bernhard Plattner
A novel project named Venezia-Gondola (Project V-G) was presented, which describes an application platform that enables the activities of Peer-to-Peer commerce (P-Commerce). A new pattern called the Inverted Model-View-Controller (IMVC) pattern was claimed that is suitable for P-Commerce. The author also explains the principles of the Project V-G and possible architecture for future development.
doi:10.4230/dagsemproc.04411.15 fatcat:m6gzppjlhrcrvhkxcargqddame

Bio-inspired mechanisms for efficient and adaptive network security mechanisms

Falko Dressler, Matthias Bossardt, Georg Carle, D. Hutchison, Hermann de Meer, Bernhard Plattner
In recent years, many efforts have been made in developing algorithms and methodologies for building efficient network security mechanisms. The primary requirements are efficiency, adaptability, and scalability. Network security mechanisms are composed of several components. First, high-performance network monitoring entities are required allowing the analysis of transmitted data even in high-speed backbone networks. Secondly, algorithms to detect various kinds of threats have to be developed.
more » ... ased on the monitored data, statistical anomaly detection methods and policy-based filters can be employed. Finally, the control loop must be closed by involving firewall devices against ongoing attacks. Organic computing is attempting to build high-scalable architectures, which are self-organizing, self-maintaining, and self-healing. We try to study the processes in computer networks using mechanisms known from molecular biology as the key paradigm. This novel approach shows many similarities between computer networking and cellular mechanisms. Based on the knowledge about cellular metabolism, new concepts for the behavior patterns of routers, monitor systems, and firewalls can be deduced and the efficiency of individual sub-systems can be increased. This work focuses on the area of network security as one research area with high demand for high-scalable mechanisms providing the needed functionality. We see the proposed mechanism as a generic approach for self-organizing, i.e. self-configuring, self-managing, self-healing, and adaptive solutions in computer networking.
doi:10.4230/dagsemproc.04411.5 fatcat:l4hdtsj6cfb5ncbpculue3v7au

Toward a More General Network Layer

Ken Calvert, Leonid Poutievski, Jim Griffioen, Matthias Bossardt, Georg Carle, D. Hutchison, Hermann de Meer, Bernhard Plattner
We are developing an integrated network layer capable of supporting unicast, multicast, and publish-subscribe services on any given topology using a single mechanism. Such a service would subsume many of the special-purpose approaches (e.g. overlays) currently proposed and used, and would support novel applications and mobility in a more unified and direct way. A major challenge is to design enrollment, routing,and forwarding algorithms in such a way that the system can scale up to support
more » ... rks much larger than the current Internet, and to achieve this with overall performance, administrative, and operational overhead comparable to existing approaches. Our approach is based on the use of predicates carried in packets to identify packet destinations. That is, the network defines a set of predicates over end systems; each packet carries a predicate from this set, suitably encoded, and the job of the network is to deliver the packet (on a best-effort basis) to all end systems that satisfy its destination predicate, and to as few others as possible. The current Internet is a restricted instance of this model, in which (unicast) addresses correspond to predicates that are satisfied by at most one node. A key consideration in designing such a system is the relationship between the set of predicates and the topology. Scalability requires the ability to characterize the nodes in a particular region of the network with an efficiently-representable predicate. Supporting mobility or publish-subscribe services, however, may make this difficult. A quantitative notion of "locality" is needed to characterize the relevant tradeoffs. This talk will discuss a preliminary routing and forwarding design, focusing on the ability of the network to self-organize without pre-assigned addresses on nodes.
doi:10.4230/dagsemproc.04411.22 fatcat:k7wlonw6x5a3tokbx4yoa6rnme
« Previous Showing results 1 — 15 out of 32 results