Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
ATZ-Fachkongress

Chassis.tech plus 2024


4 Kongresse in einer Veranstaltung

Treffen Sie in München die Fachleute von Chassis, Lenkung, Bremsen sowie Reifen/Räder.
Erweiterte Suche
Anmelden
nach oben

2009 | Buch

Validating Inter-domain SLAs with a Programmable Traffic Control System Kapitel lesen Erstes Kapitel lesen

Active and Programmable Networks

IFIP TC6 7th International Working Conference, IWAN 2005, Sophia Antipolis, France, November 21-23, 2005. Revised Papers

herausgegeben von: David Hutchison, Spyros Denazis, Laurent Lefevre, Gary J. Minden

Verlag: Springer Berlin Heidelberg

Buchreihe : Lecture Notes in Computer Science

Enthalten in: Springer Professional "Wirtschaft+Technik" , Springer Professional "Technik" , Springer Professional "Wirtschaft"

Einloggen, um Zugang zu erhalten
insite
SUCHEN

Über dieses Buch

This volume contains the proceedings of the 7th International Working Conference on Active and Programmable Networks (IWAN 2005) that was held during November 21–23, 2005, in Sophia Antipolis, Cote d’ Azur, France, jointly organized by Hitachi Europe and INRIA. IWAN 2005 took place against a backdrop of questions about the viability and - cessity of a conference that deals with an area perceived by many as having run its full course. The Organizing Committee, during the preparations of the conference, took these concerns seriously and reflected them in the theme of this year’s event, entitled “Re-incarnating Active Networking Research,” and expanding the scope of past calls for papers into topics that have emerged from active and programmable networks. The result was a success because we received 72 submissions, a number that - ceeded our expectations and in fact is one of the highest in the history of the conf- ence. The distinguished Technical Program Committee set high standards for the final program; each one of the submitted papers received three peer reviews with detailed comments and suggestions for the authors. In total, 13 papers were accepted for the main program sessions with 9 papers accepted unconditionally and the remaining 4 papers being conditionally accepted with shepherding by selected Program Committee members.

Inhaltsverzeichnis

Frontmatter

Programmable Networks and Heterogeneity

Validating Inter-domain SLAs with a Programmable Traffic Control System
Abstract
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 deployed 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.
Elisa Boschi, Matthias Bossardt, Thomas Dübendorfer
Cross-Layer Peer-to-Peer Traffic Identification and Optimization Based on Active Networking
Abstract
P2P applications appear to emerge as ultimate killer applications due to their ability to construct highly dynamic overlay topologies with rapidly-varying and unpredictable traffic dynamics, which can constitute a serious challenge even for significantly over-provisioned IP networks. As a result, ISPs are facing new, severe network management problems that are not guaranteed to be addressed by statically deployed network engineering mechanisms. As a first step to a more complete solution to these problems, this paper proposes a P2P measurement, identification and optimisation architecture, designed to cope with the dynamicity and unpredictability of existing, well-known and future, unknown P2P systems. The purpose of this architecture is to provide to the ISPs an effective and scalable approach to control and optimise the traffic produced by P2P applications in their networks. This can be achieved through a combination of different application and network-level programmable techniques, leading to a cross-layer identification and optimisation process. These techniques can be applied using Active Networking platforms, which are able to quickly and easily deploy architectural components on demand. This flexibility of the optimisation architecture is essential to address the rapid development of new P2P protocols and the variation of known protocols.
I. Dedinski, H. De Meer, L. Han, L. Mathy, D. P. Pezaros, J. S. Sventek, X. Y. Zhan
Towards Effective Portability of Packet Handling Applications across Heterogeneous Hardware Platforms
Abstract
This paper presents the Network Virtual Machine (NetVM), a virtual network processor optimized for implementation and execution of packet handling applications. As a Java Virtual Machine virtualizes a CPU, the NetVM virtualizes a network processor. The NetVM is expected to provide a unified layer for networking tasks (e.g., packet filtering, packet counting, string matching) performed by various network applications (firewalls, network monitors, intrusion detectors) so that they can be executed on any network device, ranging from high-end routers to small appliances. Moreover, the NetVM will provide efficient mapping of the elementary functionalities used to realize the above mentioned networking tasks onto specific hardware functional units (e.g., ASICs, FPGAs, and network processing elements) included in special purpose hardware systems possibly deployed to implement network devices.
Mario Baldi, Fulvio Risso

Architectural Frameworks

Architecture for an Active Network Infrastructure Grid – The iSEGrid
Abstract
Although the net processing power in the network is increasing steadily, it is heterogeneous. Hence the immense compute-power may be underutilized at certain points while it remains inadequate at others. This paper proposes an active network-based framework that views the entire network as a single-entity to effectively utilize the network resources. The single-entity model is enabled by establishing an infrastructure grid at the network layer. Such a grid has the advantage of supporting a wide range of application-layer services in the network. Network processors and Active Network technology work in tandem to facilitate this. The network processors with their deep-packet-processing capabilities allow offloading of application-level processing into the network. Active Network technology allows this to take place on-demand. We present the design and architecture of the infrastructure grid, called iSEGrid, and illustrate its use for streaming services. We provide experimental results to indicate the potential and scope of the concept.
T. K. S. LakshmiPriya, Ranjani Parthasarathi
Network Services on Service Extensible Routers
Abstract
Service creation on extensible routers requires a concise specification of component-based network services to be deployed and extended at node run-time. The specification method needs to cover the data-flow oriented nature of network services with service-internal control relations. Hence, it needs to provide the concept of functional service composition that hides the complexity of a distributed, dynamically code-extensible system.
We propose the PromethOS NP service model and its Service Programming Language to answer this challenge. They provide the concepts and methods to specify a network service as a graph of service chains with service components, and service-internal control relations. In this paper, we present the concepts of our service model, the syntax and semantics of its Service Programming Language, and demonstrate their applicability by an exemplary service specification.
Lukas Ruf, Károly Farkas, Hanspeter Hug, Bernhard Plattner
A Network-Based Response Framework and Implementation
Abstract
As the number of network-based attacks increase, and system administrators become overwhelmed with Intrusion Detection System (IDS) alerts, systems that respond to these attacks are rapidly becoming a key area of research. Current response solutions are either localized to individual hosts, or focus on a refined set of possible attacks or resources, which emulate many features of low level IDS sensors.
In this paper, we describe a modular network-based response framework that can incorporate existing response solutions and IDS sensors. This framework combines these components by uniting models that represent: events that affect the state of the system, the detection capabilities of sensors, the response capabilities of response agents, and the conditions that represent system policy. Linking these models provides a foundation for generating responses that can best satisfy policy, given the perceived system state and the capabilities of sensors and response agents.
Marcus Tylutki, Karl Levitt
Towards Resilient Networks Using Programmable Networking Technologies
Abstract
Resilience is arguably the most important property of a networked system, one of the three quality of service (QoS) characteristics along with security and performance. Now that computer networks are supporting many of the applications crucial to the success of the emerging Information Society – including business, health care, education, science, and government – it is particularly important to ensure that the underlying network infrastructure is resilient to events and attacks that will inevitably occur. Included in these challenges are flash crowd events, in which servers cannot cope with a very large onset of valid traffic, and denial of service attacks which aim to damage networked system with malicious traffic. In this paper, we outline the case for mechanisms to deal with such events and attacks, and we propose programmable networking techniques as the best way ahead, illustrated by a flash crowd example.
Linlin Xie, Paul Smith, Mark Banfield, Helmut Leopold, James P. G. Sterbenz, David Hutchison

Node Architectures

Towards the Design of an Industrial Autonomic Network Node
Abstract
Programmable and active networks allow specified classes of users to deploy dynamic network services adapted to data streams requirements. Currently most of researches performed on active networks are conducted in research laboratories. In this paper, we explore the design of IAN 2 an Industrial Autonomic Network Node able to be deployed in industrial context. Performance, dynamic programmability and fault-tolerance issues of software and hardware components have been prospected. First experimental evaluations on local platforms are presented.
Martine Chaudier, Jean-Patrick Gelas, Laurent Lefèvre
A Web Service- and ForCES-Based Programmable Router Architecture
Abstract
Programmable networks have accentuated the need for a clear separation of the control and forwarding planes. The IETF ForCES protocol allows control elements to be connected to logically separated forwarding elements. The FlexiNET IST project relies on dynamic service deployment, which requires router programmability in the control and/or forwarding planes. Moreover, to shorten the implementation and deployment time of control elements, there is a need for simple higher-level APIs that shield such elements from ForCES protocol and model details. This paper proposes a ForCES CE Gateway (ForCEG) architecture that fulfills these requirements and maps Web Service interfaces to ForCES messages while checking the validity of commands to ensure consistency of the router state.
Evangelos Haleplidis, Robert Haas, Spyros Denazis, Odysseas Koufopavlou
An Extension to Packet Filtering of Programmable Networks
Abstract
Several projects proposed to use active or programmable networks to implement attack detection systems for detecting distributed denial of service attacks or worm propagation. In order to distinguish legal traffic from the attack traffic bypassing packets need to be inspected deeply which is resource consuming. Such an inspection can be realized either with additional and expensive special hardware or in software. But due to resource limitations inspection of all bypassing packets in software is not feasible if the packet rate is high. Therefore we propose to add packet selection mechanisms to the NodeOS reference architecture for programmable networks. A packet selector reduces the rate of packets which are inspected. In this paper we detail on various packet selectors and evaluate their suitability for an attack detection system. The results of our implementation show significant advantages by using packet sampling methods compared to packet filtering.
Marcus Schöller, Thomas Gamer, Roland Bless, Martina Zitterbart

Services

SAND: A Scalable, Distributed and Dynamic Active Networks Directory Service
Abstract
In the past a significant amount of work has been invested on architecting active node platforms that solve problems in various application areas by means of programmability. Yet, much less attention has been paid to the deployment aspects of these platforms in real networks. An open issue in particular is how active resources can be discovered and deployed. In this paper we present SAND, a scalable distributed and dynamic architecture that enables the discovery of active resources along and alongside a given network path. One of the main strengths of SAND is its customizability which renders it suitable to a multitude of network environments. As an active service, SAND does not have dependencies on any active platform and at the same time enables an active node to become part of a global infrastructure of discoverable active resources.
M. Sifalakis, A. Mauthe, David Hutchison
A Programmable Structured Peer-to-Peer Overlay
Abstract
Structured peer-to-peer (P2P) overlay are scalable, robust and self-organizing in nature, and provide a promising platform for a range of large-scale distributed applications. Applications proposed to date utilize a similar key-based routing service but “re-invent the wheel” by deploying their own dedicated structured P2P overlay network. This is highly inefficient and results in a significant duplication of work in terms of development, deployment and maintenance of the overlays. To address this problem, we propose a PROgrammable STructured P2P infrastructure (PROST), which allows the dynamic and incremental deployment of multiple applications over a single structured P2P overlay. In this paper, we outline the PROST architecture and discuss the implementation of our prototype.
Marius Portmann, Sébastien Ardon, Patrick Sénac
Interpreted Active Packets for Ephemeral State Processing Routers
Abstract
We propose WASP (lightweight and World-friendly Active packets for ephemeral State Processing), a new active platform based on Ephemeral State designed to allow bytecode interpretation on programmable datapath elements. We designed WASP to be a good compromise between flexibility (e.g. offering solutions in quality-adaptive multimedia flows, service discovery or mobility support) and safety (i.e. protection of router and network resource).
Sylvain Martin, Guy Leduc

Short Papers

A Secure Code Deployment Scheme for Active Networks
Abstract
Active Networking is an innovative technology which can open the network and make it more flexible. But introducing active codes within the network increases the network vulnerability from the security point of view. The security is always considered as a separated layer from the other layers of the active network architecture. In this paper, we develop a global security architecture for a safe code distribution. A three level mechanism is defined to provide a unique identification, authentication, and classification of a code, according to its developer and its users.
Leïla Kloul, Amdjed Mokhtari
Securing AODV Routing Protocol in Mobile Ad-Hoc Networks
Abstract
In this paper, we have proposed a security schema for Ad-hoc On-Demand Distance Vector (AODV) routing protocol. In this schema, each node in a network has a list of its neighbor nodes including a shared secret key which is obtained by executing a key agreement when joining a network. One key principle in our schema is that before executing route discovery steps in AODV protocol, each node executes message authentication process with the sender to guarantee the integrity and non-repudiation of routing messages and therefore, could prevent attacks from malicious nodes. Comparing with other recently proposed security routing protocols, our security schema needs less computation power in routing transactions and does not need any centralized element in mobile ad-hoc networks.
Phung Huu Phu, Myeongjae Yi, Myung-Kyun Kim
Extensible Network Configuration and Communication Framework
Abstract
The effort to manage network security systems has increased in complexity over the past years. Network security for a company, university, or government agency can no longer be provided using a single Internet firewall or Intrusion Prevention System (IPS). Today, network administrators must deploy multiple intrusion detection and prevention nodes, traffic shapers, and firewalls in order to effectively protect their network. As the number of devices increases, maintaining a secure environment becomes difficult. This paper presents an infrastructure for control, configuration, and communication between heterogeneous network devices. The approach presented uses a Publish/Subscribe model built on top of a peer-to-peer overlay network in order to distribute information between network intrusion detection and prevention devices.
Todd Sproull, John Lockwood
A Model for Scalable and Autonomic Network Management
Abstract
Current telecommunication network management systems rely extensively on human intervention. They are also prone to fundamental changes as the managed network evolves. These two attributes, combined with the growing complexity of networks and services, make the cost of network management very high. In recent years, we have witnessed the emergence of artificial intelligence applications. Some are aimed at the creation of autonomic network management systems. This paper offers a novel approach to the design of a network management system that incorporates intelligent agents. As a benchmark to this model, we use two approaches most widely in use in network management systems today. The focus of this paper is on synchronization issues, service discovery and policy enforcement.
Amir Eyal, Robin Braun
Intelligibility Evaluation of a VoIP Multi-flow Block Interleaver
Abstract
This work contributes to demonstrate what perceptual benefits can be expected by adding some processing capabilities to the network nodes for the class of interactive audio streaming applications. In particular, we propose a new voice stream multi-flow block interleaver and we show that it provides an intelligibility performance very close to the reference end-to-end interleaver, even under conditions where the end-to-end interleaving is unfeasible.
Juan J. Ramos-Muñoz, Ángel M. Gómez, Juan M. Lopez-Soler
A Web-Services Based Architecture for Dynamic-Service Deployment
Abstract
Due to the increase in both heterogeneity and complexity in today’s networking systems, there arises a demand for an architecture for network-based services, that gives flexibility and efficiency in the definition, deployment and execution of the services and at the same time, takes care of the adaptability and evolution of such services. In this paper we present an approach that applies a component model to GT4, a Web-service based Grid environment, which enables the provision of parallel applications as QoS-aware (Grid) services, whose performance characteristics may be dynamically negotiated between a client application and service providers. Our component model allows context dependencies to be explicitly expressed and dynamically managed with respect to the hosting environment, computational resources, as well as dependencies on other components. Our work can be seen as a first step towards a component-based programming-model for service–oriented infrastructures utilizing standard Web services technologies.
Christos Chrysoulas, Evangelos Haleplidis, Robert Haas, Spyros Denazis, Odysseas Koufopavlou
The Active Embedded Ubiquitous Web Service Framework
Abstract
We develop an active embedded middleware framework, called the EUWS (Embedded Ubiquitous Web Service), in WinCE.NET. The EUWS seamlessly integrates home network services and the Web Services on the Internet and provides a management framework for ubiquitous web services. As the initial stage of our project, our current focus has been on designing and implementing a prototype of the EUWS in WinCE.NET. The architecture of the EUWS prototype system includes an extensible and reconfigurable Embedded Ubiquitous Web Service(EUWS) framework and an UPnP2WS processing module that seamlessly integrates the UPnP standard with the Web Service standard.
Dugki Min, Junggyum Lee, Eunmi Choi
Framework of an Application-Aware Adaptation Scheme for Disconnected Operations
Abstract
The complex software development scenarios for mobile/ hand-held devices operating in wireless environments require adaptation to the variations in the environment (such as fluctuating bandwidth). This translates to maintenance of service availability in preferably all circumstances. In this paper we propose that a mobile computing system (for hand-held, wireless devices) must be based on the combination of reflection, remote evaluation and code mobility mechanisms such that the communication framework allows developers to design disconnection-aware applications which maintain service availability in case of varying circumstances by automatically redeploying essential components to appropriate locations. This not only allows the application to continue executing in varying conditions, but also in entirely disconnected modes.
Umar Kalim, Hassan Jameel, Ali Sajjad, Sang Man Han, Sungyoung Lee, Young-Koo Lee
Kinetic Multipoint Relaying: Improvements Using Mobility Predictions
Abstract
Multipoint Relaying (MPR) is a technique to reduce the number of redundant retransmissions while diffusing a broadcast message in the network, where only a subset of nodes are allowed to forward packets. The selection is based on instantaneous nodes’ degrees, and is periodically refreshed. We propose in this chapter a novel heuristic to select kinetic multipoint relays based on nodes’ overall predicted degree, which is solely updated on a per-event basis. We illustrate that this approach significantly reduces the number of messages needed to operate the protocol, yet with similar broadcast properties that the regular MPR, such as network coverage, number of multipoint relays, or flooding capacity.
Jérôme Härri, Fethi Filali, Christian Bonnet
The Three-Level Approaches for Differentiated Service in Clustering Web Server
Abstract
This paper presents three-level approaches for the differentiated Web Qos. A kernel-level approach adds a realtime scheduler to the operating system kernel to keep the priority of the user requests determined by the scheduler in the Web server. An application-level approach which uses IP-level masquerading and tunneling technology improves the reliability and response speed of the Web services. A dynamic load-balancing approach uses the parameters related to the MIB-II of SNMPand the parameters related to the load of the system resources such as memory and CPU to perform load balancing dynamically. These approaches proposed in this paper are implemented using a Linux kernel 2.4.7 and tested in three different situations. The result of tests shows that the approaches support the differentiated services in clustering web server environment.
Myung-Sub Lee, Chang-Hyeon Park
On the Manipulation of JPEG2000, In-Flight, Using Active Components on Next Generation Satellites
Abstract
This paper describes two approaches to manipulating JPEG2000 frames with programmable and active networks. The first approach is the use of transcoding and the second is intelligent dropping. These two approaches where considered, in particular, for possible deployment with space based platforms; specifically, communication satellites which are not only IP enabled but may host active components. Each approach offers different possibilities and may be suitable for solving overlapping but different problems.
L. Sacks, H. K. Sellappan, S. Zachariadis, S. Bhatti, P. Kirstein, W. Fritsche, G. Gessler, K. Mayer
TAON: A Topology-Oriented Active Overlay Network Protocol
Abstract
Built upon overlay topologies, Peer-to-Peer (P2P) networks behave in an ad-hoc way, conduct application-layer routing, enable user-customized decentralized resources sharing, and thus can be taken as an emerging representative of Active Networks. An important problem in current unstructured P2P networks is that, however, existing searching mechanisms do not scale well because they are either based on the idea of flooding the network with queries or because they know very little about the nature of the network topology. In this paper, we propose the Topology-oriented Active Overlay Network (TAON) which is an efficient, scalable yet simple protocol for improving decentralized resources sharing in P2P networks. TAON consists of three novel components: a Desirable Topology Construction and Adaptation algorithm to guide the evolution of the overlay topology towards a small-world-like graph, a Semantic-based Neighbor Selection Scheme to conduct an online neighbor ranking, and a Topology-aware Intelligent Search mechanism to forward incoming queries to deliberately selected neighbors. We deploy and compare TAON with a number of other distributed search techniques over static and dynamic environments, and the results indicate that TAON outperforms its competitors by achieving higher recall rate while using much less network resources, in both of the above environments.
Xinli Huang, Fanyuan Ma, Wenju Zhang
A Biologically Inspired Service Architecture in Ubiquitous Computing Environments
Abstract
This paper describes the design of a scalable bio-mimetic framework in the management domain of complex Ubiquitous Service-Oriented Networks. An autonomous network service management platform - SwarmingNet is proposed. In this SwarmingNet architecture, the required network service processes are implemented by a group of highly diverse and autonomic objects. These objects are called TeleService Solons as elements of TeleService Holons, analogue to individual insects as particles of the whole colony. A group of TSSs have the capabilities of fulfilling the complex tasks relating to service discovery and service activation. We simulate a service configuration process for Multimedia Messaging Service, and a performance comparison is made between the bio-agents scheme and normal multi-agents scheme.
Frank Chiang, Robin Braun
Erratum to: Active and Programmable Networks
Abstract
Erratum to: D. Hutchison et al. (Eds.) Active and Programmable Networks DOI: 10.​1007/​978-3-642-00972-3
The book was inadvertently published with an incorrect name of the copyright holder. The name of the copyright holder for this book is: © IFIP International Federation for Information Processing. The book has been updated with the changes.
David Hutchison, Spyros Denazis, Laurent Lefevre, Gary J. Minden
Backmatter
Metadaten
Titel
Active and Programmable Networks
herausgegeben von
David Hutchison
Spyros Denazis
Laurent Lefevre
Gary J. Minden
Copyright-Jahr
2009
Verlag
Springer Berlin Heidelberg
Electronic ISBN
978-3-642-00972-3
Print ISBN
978-3-642-00971-6
DOI
https://doi.org/10.1007/978-3-642-00972-3

Premium Partner

    Bildnachweise