Volume

Dagstuhl Seminar Proceedings, Volume 4411

Publication Details

  • published at: 2005-03-24
  • Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Access Numbers

Documents

No documents found matching your filter selection.
Document
DOI: 10.4230/DagSemProc.04411.1
04411 Abtracts Collection – Service Management and Self-Organization in IP-based Networks

Authors: Matthias Bossardt, Georg Carle, David Hutchison, Hermann de Meer, and Bernhard Plattner

Abstract
From 03.10.04 to 06.10.04, the Dagstuhl Seminar 04411 ``Service Management and Self-Organization in IP-based Networks'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Matthias Bossardt, Georg Carle, David Hutchison, Hermann de Meer, and Bernhard Plattner. 04411 Abtracts Collection – Service Management and Self-Organization in IP-based Networks. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{bossardt_et_al:DagSemProc.04411.1,
  author =	{Bossardt, Matthias and Carle, Georg and Hutchison, David and Meer, Hermann de and Plattner, Bernhard},
  title =	{{04411 Abtracts Collection – Service Management and Self-Organization in IP-based Networks}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--18},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.1},
  URN =		{urn:nbn:de:0030-drops-1141},
  doi =		{10.4230/DagSemProc.04411.1},
  annote =	{Keywords: Service management , network service , self-organization , network management , programmable network , active network , peer-to-peer network ad-hoc network}
}
Document
DOI: 10.4230/DagSemProc.04411.2
04411 Preface – Service Management and Self-Organization in IP-based Networks

Authors: Matthias Bossardt, Georg Carle, David Hutchison, Hermann de Meer, and Bernhard Plattner

Abstract
Preface to the online proceedings of Dagstuhl Seminar 04411
Cite as

Matthias Bossardt, Georg Carle, David Hutchison, Hermann de Meer, and Bernhard Plattner. 04411 Preface – Service Management and Self-Organization in IP-based Networks. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{bossardt_et_al:DagSemProc.04411.2,
  author =	{Bossardt, Matthias and Carle, Georg and Hutchison, David and Meer, Hermann de and Plattner, Bernhard},
  title =	{{04411 Preface – Service Management and Self-Organization in IP-based Networks}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.2},
  URN =		{urn:nbn:de:0030-drops-827},
  doi =		{10.4230/DagSemProc.04411.2},
  annote =	{Keywords: Service management , self-organization , network management}
}
Document
DOI: 10.4230/DagSemProc.04411.3
A dynamically adaptive, unstructured multicast overlay

Authors: Matei Ripeanu, Ian Foster, Adriana Iamnitchi, and Anne Rogers

Abstract
The simplicity of multicast as a communication primitive belies its broad utility as a building block for distributed applications. Nevertheless, creating and maintaining multicast structures can be challenging, particularly when networks are transient and/or dynamic. We introduce a new unstructured multi-source multicast (UMM) overlay approach that we argue is less complex than, but as efficient as, current state-of-the-art solutions based either on structured overlays or on running full routing protocols at the overlay level. UMM builds a base overlay independently from the routing mechanisms employed to route messages. On top of this base overlay, it selects distribution trees for each multicast source by first flooding the base overlay and then using the implicit information contained in duplicated messages to select and filter out redundant tunnels. Simple heuristics are used to maintain and evolve both the base overlay and the multicast distribution trees in response to changes in the set of overlay participants or in underlying network conditions. We experiment on a 65-node PlanetLab deployment and on ModelNet emulated distributed platforms to quantify the overheads associated with UMM operation and to explore its performance and adaptability to changes in the underlying network conditions.
Cite as

Matei Ripeanu, Ian Foster, Adriana Iamnitchi, and Anne Rogers. A dynamically adaptive, unstructured multicast overlay. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{ripeanu_et_al:DagSemProc.04411.3,
  author =	{Ripeanu, Matei and Foster, Ian and Iamnitchi, Adriana and Rogers, Anne},
  title =	{{A dynamically adaptive, unstructured multicast overlay}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--1},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.3},
  URN =		{urn:nbn:de:0030-drops-938},
  doi =		{10.4230/DagSemProc.04411.3},
  annote =	{Keywords: multicast overlay , self-organization}
}
Document
DOI: 10.4230/DagSemProc.04411.4
A flexible router platform for next generation network services

Authors: Lukas Ruf, Arno Wagner, Karoly Farkas, and Bernhard Plattner

Abstract
Autonomous services need a flexible router platform that provides the mechanisms to install, modify and remove services at run-time of the node without interfering with others. Instantiated services must have the ability to re-configure and to exchange service functionality themselves. Envisioned router platforms must be able to run multiple services in parallel and are required to scale with the number of network-interfaces while they need to provide a straightforward to use service programming interface. In this talk, we present the PromethOS NP router platform together with a service architecture to counteract distributed denial of service attacks in an autonomous way. PromethOS NP manages and controls a processor-hierarchy composed of host processors and network processors embedded in network interface cards. It provides a dynamically code-extensible router platform of which all processor tiers are at run-time programmable following a unified component programming model. The service architecture illustrates the capabilities of the router platform and its applicability to autonomous network services.
Cite as

Lukas Ruf, Arno Wagner, Karoly Farkas, and Bernhard Plattner. A flexible router platform for next generation network services. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{ruf_et_al:DagSemProc.04411.4,
  author =	{Ruf, Lukas and Wagner, Arno and Farkas, Karoly and Plattner, Bernhard},
  title =	{{A flexible router platform for next generation network services}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.4},
  URN =		{urn:nbn:de:0030-drops-949},
  doi =		{10.4230/DagSemProc.04411.4},
  annote =	{Keywords: Extensible Router Platform , Service Architecture , Network Processor , Host Processor , Processor Hierarchy}
}
Document
DOI: 10.4230/DagSemProc.04411.5
Bio-inspired mechanisms for efficient and adaptive network security mechanisms

Authors: Falko Dressler

Abstract
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. Based 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.
Cite as

Falko Dressler. Bio-inspired mechanisms for efficient and adaptive network security mechanisms. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{dressler:DagSemProc.04411.5,
  author =	{Dressler, Falko},
  title =	{{Bio-inspired mechanisms for efficient and adaptive network security mechanisms}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.5},
  URN =		{urn:nbn:de:0030-drops-870},
  doi =		{10.4230/DagSemProc.04411.5},
  annote =	{Keywords: bio-inspired networking , self-organization , network security , organic computing}
}
Document
DOI: 10.4230/DagSemProc.04411.6
Bridging today's Internet Heterogeneity with a Content-oriented Approach

Authors: Klaus Wehrle

Abstract
Despite the success of Internet technology and protocols, their deficiencies become apparent with growing and emerging applications like 3G mobile devices or pervasive environments. In these fields, there is a growing demand for additional support of mobility, multi- or anycast communication, or service composition. ...
Cite as

Klaus Wehrle. Bridging today's Internet Heterogeneity with a Content-oriented Approach. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{wehrle:DagSemProc.04411.6,
  author =	{Wehrle, Klaus},
  title =	{{Bridging today's Internet Heterogeneity with a Content-oriented Approach}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.6},
  URN =		{urn:nbn:de:0030-drops-1004},
  doi =		{10.4230/DagSemProc.04411.6},
  annote =	{Keywords: Peer-to-Peer , Overlay , Communication Form , Bridging Heterogeneity}
}
Document
DOI: 10.4230/DagSemProc.04411.7
Charging Service Compositions in a Service-Oriented Peer-to-Peer Network

Authors: Jan Gerke

Abstract
Today, peer-to-peer (P2P) networks, e.g., filesharing networks like Gnutella, are specialised towards specific purposes. This shortcoming is addressed by introducing a new middleware for P2P networks. The middleware supports the deployment and use of services inside a P2P network. The middleware can be adapted through plug-ins. It includes service negotiation mechanisms which support the creation of legally enforceable service level agreements (SLAs) by using strong identities. This allows to reliably compose services into new value-added services. The business model of service composers has been investigated. The question of how to charge for such service compositions is addressed by introducing an event-based charging model. The events are to be applied in a service consumer's utility function as well as service composers' and service providers' tariff functions. Finally, the relation of these functions determines the profits of a service composer.
Cite as

Jan Gerke. Charging Service Compositions in a Service-Oriented Peer-to-Peer Network. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{gerke:DagSemProc.04411.7,
  author =	{Gerke, Jan},
  title =	{{Charging Service Compositions in a Service-Oriented Peer-to-Peer Network}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--1},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.7},
  URN =		{urn:nbn:de:0030-drops-906},
  doi =		{10.4230/DagSemProc.04411.7},
  annote =	{Keywords: peer-to-peer middleware service negotiation , service level agreements , service composition , service charging}
}
Document
DOI: 10.4230/DagSemProc.04411.8
Composite Protocols and Networking Services

Authors: Gary Minden

Abstract
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.
Cite as

Gary Minden. Composite Protocols and Networking Services. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{minden:DagSemProc.04411.8,
  author =	{Minden, Gary},
  title =	{{Composite Protocols and Networking Services}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--1},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.8},
  URN =		{urn:nbn:de:0030-drops-924},
  doi =		{10.4230/DagSemProc.04411.8},
  annote =	{Keywords: Active Networking , Composite Protocols , Composite Network Services}
}
Document
DOI: 10.4230/DagSemProc.04411.9
DotSlash - Creating Content Distribution Networks on Demand

Authors: Weibin Zhao and Henning Schulzrinne

Abstract
Traditional content distribution networks, such as Akamai, are well-suited for static web services that routinely experience large traffic volumes. They are unsuited for active content, i.e., content generated by scripts from databases, and web sites that are unlikely to receive significant number of requests. However, a few such sites will invariably experience their "fifteen minutes of fame", typically by being mentioned on a high-volume news site such as SlashDot or CNN. Such flashcrowds or "slashdot effect" will routinely cause single-server websites to collapse. We have designed and prototyped an autonomic web replication system, called DotSlash, that drafts rescue servers fully automatically, without user intervention. The system discovers suitable rescue servers via wide-area service location, either among peer servers or from a dedicated pool of rescue servers, allocates them for temporary use and redirects requests to them. The system is completely transparent to clients and does not require URL rewriting or other client modifications. We have designed two versions. The first, an Apache extension, deals only with static content, e.g., HTML pages or media objects. The second version can also replicate and execute scripts remotely. We have prototyped the system for the common LAMP (Linux, Apache, MySQL and PHP) configuration and shown that a common benchmark for bulletin boards can be replicated without code changes, yielding capacity increases bounded only by the database server. Since many such systems, including most blogs, are bottlenecked by the web server, our system can significantly increase capacity and works even for extremely rapid load increases. We are currently investigating how such systems can be further extended by increasing the database capacity of read-mostly systems with loose consistency constraints.
Cite as

Weibin Zhao and Henning Schulzrinne. DotSlash - Creating Content Distribution Networks on Demand. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{zhao_et_al:DagSemProc.04411.9,
  author =	{Zhao, Weibin and Schulzrinne, Henning},
  title =	{{DotSlash - Creating Content Distribution Networks on Demand}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--1},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.9},
  URN =		{urn:nbn:de:0030-drops-953},
  doi =		{10.4230/DagSemProc.04411.9},
  annote =	{Keywords: CDN , web replication , flash crowd , Slashdot effect , autonomic system , PHP , LAMP , active content}
}
Document
DOI: 10.4230/DagSemProc.04411.10
Enriched Classification and Dynamic Tunneling as Elementary Internet Mechanisms

Authors: Gisli Hjalmtysson and Björn Brynjulfsson

Abstract
We make the case that mechanisms for enriched classification and dynamic tunneling with a common elementary protocol is both necessary and sufficient for facilitating mobile IP services in highly environments. Moreover, we claim that device initiated handoffs simplify the network infrastructure and are in general more suitable in highly mobile and heterogeneous environments. We discuss our preliminary work to validate these claims based both on simulation models and experimental prototyping.
Cite as

Gisli Hjalmtysson and Björn Brynjulfsson. Enriched Classification and Dynamic Tunneling as Elementary Internet Mechanisms. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{hjalmtysson_et_al:DagSemProc.04411.10,
  author =	{Hjalmtysson, Gisli and Brynjulfsson, Bj\"{o}rn},
  title =	{{Enriched Classification and Dynamic Tunneling as Elementary Internet Mechanisms}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.10},
  URN =		{urn:nbn:de:0030-drops-914},
  doi =		{10.4230/DagSemProc.04411.10},
  annote =	{Keywords: Protocol design , Tunneling , Classification}
}
Document
DOI: 10.4230/DagSemProc.04411.11
Epidemic Dissemination in Ad Hoc Networks

Authors: Lidia Yamamoto

Abstract
Peer-to-Peer (P2P) and ad hoc networks have many points in common: both represent a decentralized self-organizing network structure. However few existing P2P algorithms are specifically designed to operate efficiently over ad hoc networks. And few ad hoc networks are designed to benefit from P2P infrastructures. We have worked on an epidemic dissemination protocol to maintain soft-state in a decentralized, peer-to-peer fashion, in ad hoc networks. This protocol is an enhancement of Passive Distributed Indexing (PDI) method proposed by Lindemann and Waldhorst. PDI is a method for distributing information in a P2P structure which is particularly suited to ad hoc networks, and does not involve an overlay topology. It makes use of broadcast messages to spread information via passive epidemic dissemination. We have enhanced PDI in order to reduce the number of broadcast messages when the search for an item may span several hops. Three enhancements are proposed: 1) Lazy query propagation to delay the propagation of query messages such that local responses can inhibit unnecessary search. 2) Quench waves to stop an already initiated query propagation when still possible. A decision algorithm determines whether to start a quench wave or not based solely on local information. 3) The use of Multi-Point Relay (MPR) or similar protocol and algorithm, to reduce redundant broadcast messages. This talk will present the current state of this research, and discuss several open aspects with the purpose of stimulating debate. The talk will also include an overview of related work such as epidemic models from biology, other epidemic protocols for P2P overlays and MANETs, including gossip (active) and promiscuous (passive) dissemination modes. Such protocols could be used for many different purposes, roughly any task requiring distributed soft-state maintenance in the ad hoc network, including DNS and identifier mappings, network monitoring and configuration, and so on. During the talk we will also exploit the possibility of using the protocol to disseminate service information for on-demand service deployment, and further, to assist in self-composing protocol structures.
Cite as

Lidia Yamamoto. Epidemic Dissemination in Ad Hoc Networks. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{yamamoto:DagSemProc.04411.11,
  author =	{Yamamoto, Lidia},
  title =	{{Epidemic Dissemination in Ad Hoc Networks}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--8},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.11},
  URN =		{urn:nbn:de:0030-drops-1013},
  doi =		{10.4230/DagSemProc.04411.11},
  annote =	{Keywords: ad hoc networks , epidemic dissemination , peer-to-peer}
}
Document
DOI: 10.4230/DagSemProc.04411.12
From Active Networks to Cognitive Networks

Authors: Manolis Sifalakis and David Hutchison

Abstract
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 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.
Cite as

Manolis Sifalakis and David Hutchison. From Active Networks to Cognitive Networks. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{sifalakis_et_al:DagSemProc.04411.12,
  author =	{Sifalakis, Manolis and Hutchison, David},
  title =	{{From Active Networks to Cognitive Networks}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.12},
  URN =		{urn:nbn:de:0030-drops-967},
  doi =		{10.4230/DagSemProc.04411.12},
  annote =	{Keywords: Active networks , self organisation , service mobility , dynamic service deployment}
}
Document
DOI: 10.4230/DagSemProc.04411.13
Gossip-based self-managing services for large scale dynamic networks

Authors: Ozalp Babaoglu, Mark Jelasity, and Alberto Montresor

Abstract
Modern IP networks are dynamic, large-scale and heterogeneous. This implies that they are more unpredictable and difficult to maintain and build upon. Implementation and management of decentralized applications that exploit these networks can be enabled only through a set of special middleware services that shield the application from the scale, dynamism and heterogeneity of the environment. Among others, these services have to provide communication services (routing, multicasting, etc.) and global information like network size, load distribution, etc. The goal is not to provide abstractions that hide the distributedness of the system, but rather, to hide the unpleasant features of the system, such as dynamism, scale and heterogeneity. Most importantly, these services have to be self-managing: they have to be able to maintain certain properties in the face of extreme dynamism of the network. In this manner, such services can serve as the lowest layer that makes possible building more complex applications, or simply as a plugin to enhance existing systems, for example, GRID environments. Apart from self-management, we require that the services be simple and lightweight, to allow easy implementation and incur low cost. Our approach to achieving these goals is based on the gossip communication model. Gossip protocols are simple, robust and scalable, besides, they can be applied to implement not only information dissemination, but several other functions, as we will show. So far, we have designed gossip-based protocols for maintaining random overlays, which define group membership. Based on this random overlay, we have designed gossip-based protocols to calculate aggregate values such as maxima, average, sum, variance, etc. We have also developed protocols to build several structured overlays in this framework, including superpeer, torus, ring, binary tree, etc. These protocols build on the random overlay and also on aggregate values. The gossip-based model is well suited to dynamic and large networks. Our protocols are extremely simple to implement while being robust and adaptive without adding any extra components or control loops. Our approach also support composition at a local level. At each node in the network, the same services are available: for example, data aggregation uses the random overlay (peer sampling service) and superpeer topology construction applies aggregate values, such as maximal and average capacity. In fact, protocols that implement the different services are heavily interconnected and form a modular system within this lighweight self-managing service layer. While this presentation focuses on the self-managing systems services, it is clear that other application-level services can also be built at higher layers. These services can be proactive, like load balancing, that can make use of the target (average) load and overlays for optimization of load transfer, or reactive, like broadcasting or search, that can be performed on top of an appropriate overlay network (eg spanning tree or superpeer network), maintained by the lighweight self-managing systems services.
Cite as

Ozalp Babaoglu, Mark Jelasity, and Alberto Montresor. Gossip-based self-managing services for large scale dynamic networks. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{babaoglu_et_al:DagSemProc.04411.13,
  author =	{Babaoglu, Ozalp and Jelasity, Mark and Montresor, Alberto},
  title =	{{Gossip-based self-managing services for large scale dynamic networks}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.13},
  URN =		{urn:nbn:de:0030-drops-815},
  doi =		{10.4230/DagSemProc.04411.13},
  annote =	{Keywords: Autonomic computing , self management , middleware , aggregation , topology management.}
}
Document
DOI: 10.4230/DagSemProc.04411.14
Peer-to-Peer vs. the Internet: A Discussion on the Proper and Practical Location of Functionality

Authors: James P.G. Sterbenz

Abstract
Peer-to-peer information sharing has become one of the dominant Internet applications, measured not only in the number of users, but also in the network bandwidth consumed. Thus, it is reasonable to examine the location of support functionality such as self-organisation, resource discovery, multipoint-to-multipoint group communication, forwarding, and routing, to provide the needed service to applications while optimising resource usage in the network. This position paper is intended to stimulate discussion in two related areas: First, where {\em should} functionality to support peer-to-peer applications be located: in the network, or as an application overlay among end systems. Second, where {\em can} functionality be located, given the practical constraints of the modern Internet including closed systems and middleboxes, as well as administrative, legal, and social issues. We will discuss the performance implications of these decisions, including whether low latency bounds for delay sensitive peer-to-peer applications (such as distributed network computing) can ever be achieved in this environment.
Cite as

James P.G. Sterbenz. Peer-to-Peer vs. the Internet: A Discussion on the Proper and Practical Location of Functionality. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{sterbenz:DagSemProc.04411.14,
  author =	{Sterbenz, James P.G.},
  title =	{{Peer-to-Peer vs. the Internet: A Discussion on the Proper and Practical Location of Functionality}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.14},
  URN =		{urn:nbn:de:0030-drops-1156},
  doi =		{10.4230/DagSemProc.04411.14},
  annote =	{Keywords: network architecture , peer-to-peer , client/server , nd-to-end arguments , protocol layering , policy , ussle}
}
Document
DOI: 10.4230/DagSemProc.04411.15
Project Venezia-Gondola (A Framework for P-Commerce)

Authors: Raymond Gao

Abstract
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.
Cite as

Raymond Gao. Project Venezia-Gondola (A Framework for P-Commerce). In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{gao:DagSemProc.04411.15,
  author =	{Gao, Raymond},
  title =	{{Project Venezia-Gondola (A Framework for P-Commerce)}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--11},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.15},
  URN =		{urn:nbn:de:0030-drops-897},
  doi =		{10.4230/DagSemProc.04411.15},
  annote =	{Keywords: Peer-to-Peer Commerce , Ad-Hoc Transaction , JXTA, XML , Design Patterns}
}
Document
DOI: 10.4230/DagSemProc.04411.16
Self-Healing Protocol Implementations

Authors: Christian Tschudin and Lidia Yamamoto

Abstract
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 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.
Cite as

Christian Tschudin and Lidia Yamamoto. Self-Healing Protocol Implementations. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{tschudin_et_al:DagSemProc.04411.16,
  author =	{Tschudin, Christian and Yamamoto, Lidia},
  title =	{{Self-Healing Protocol Implementations}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.16},
  URN =		{urn:nbn:de:0030-drops-986},
  doi =		{10.4230/DagSemProc.04411.16},
  annote =	{Keywords: resilient protocol implementations , autonomic communication systems , active networking , bio-inspired networking}
}
Document
DOI: 10.4230/DagSemProc.04411.17
Self-Organization in Peer-to-Peer Systems

Authors: Hermann de Meer

Abstract
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 systems 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.
Cite as

Hermann de Meer. Self-Organization in Peer-to-Peer Systems. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{meer:DagSemProc.04411.17,
  author =	{Meer, Hermann de},
  title =	{{Self-Organization in Peer-to-Peer Systems}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.17},
  URN =		{urn:nbn:de:0030-drops-860},
  doi =		{10.4230/DagSemProc.04411.17},
  annote =	{Keywords: self-organization , peer-to-peer}
}
Document
DOI: 10.4230/DagSemProc.04411.18
Service Provisioning Framework for Self-Organized Networks

Authors: Karoly Farkas, Lukas Ruf, and Bernhard Plattner

Abstract
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 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.
Cite as

Karoly Farkas, Lukas Ruf, and Bernhard Plattner. Service Provisioning Framework for Self-Organized Networks. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{farkas_et_al:DagSemProc.04411.18,
  author =	{Farkas, Karoly and Ruf, Lukas and Plattner, Bernhard},
  title =	{{Service Provisioning Framework for Self-Organized Networks}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.18},
  URN =		{urn:nbn:de:0030-drops-883},
  doi =		{10.4230/DagSemProc.04411.18},
  annote =	{Keywords: Service Provisioning , SIRAMON , Ad Hoc Networks , Self-Organization}
}
Document
DOI: 10.4230/DagSemProc.04411.19
Service Specific Overlay Networks Setup and Maintenance using Pattern-based Management

Authors: Eskindir Asmare, Stefan Schmid, and Marcus Brunner

Abstract
Service specific overlays are overlay networks build and setup for a single service. Since different services need different types of overlays the setup process is pretty different. Current approaches normal allow to send in a overlay specification into the overlay provisioning system (mainly centralized). In our approach, we use pattern-based management in order to run the process completely distributed but still having a basic communication pattern to be reused for other overlays with different requirement. In this talk, we present the concept and a first implementation on the Simpson pattern simulator of KTH.
Cite as

Eskindir Asmare, Stefan Schmid, and Marcus Brunner. Service Specific Overlay Networks Setup and Maintenance using Pattern-based Management. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{asmare_et_al:DagSemProc.04411.19,
  author =	{Asmare, Eskindir and Schmid, Stefan and Brunner, Marcus},
  title =	{{Service Specific Overlay Networks Setup and Maintenance using Pattern-based Management}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.19},
  URN =		{urn:nbn:de:0030-drops-838},
  doi =		{10.4230/DagSemProc.04411.19},
  annote =	{Keywords: overlay networks , management/provisioning of overlays}
}
Document
DOI: 10.4230/DagSemProc.04411.20
Simulative Performance Evaluation of a Mobile Peer-to-Peer File-Sharing System

Authors: Kurt Tutschku, Tobias Hoßfeld, Hermann de Meer, Jens Oberender, and Frank-Uwe Andersen

Abstract
Peer-to-Peer (P2P) file-sharing has become the killer application in the wired Internet and might also be highly attractive for mobile networks. In particular since UMTS operators are searching for new applications which do both: a) exploit the potential of the UMTS technology and b) motivate the user to adopt the new technology. In this work we are investigating the performance of an eDonkey-based mobile P2P file-sharing system by means of time-dynamic simulation. Mobile networks differ from wireline networks by the limited capacity of the radio link and the mobility of the users. P2P networks, in contrast, are overlays which consider the transport network in an abstract way. In a mobile environment, the question arises, whether the abstraction can be maintained and what will be the performance impact if there is any. We will show in detail how the mobile access technology (GPRS or UMTS), the churn behavior of mobile users, the file size of mobile specific content, and special infrastructure entities, such as a cache peer, influences the performance of the suggested mobile P2P file-sharing service.
Cite as

Kurt Tutschku, Tobias Hoßfeld, Hermann de Meer, Jens Oberender, and Frank-Uwe Andersen. Simulative Performance Evaluation of a Mobile Peer-to-Peer File-Sharing System. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{tutschku_et_al:DagSemProc.04411.20,
  author =	{Tutschku, Kurt and Ho{\ss}feld, Tobias and Meer, Hermann de and Oberender, Jens and Andersen, Frank-Uwe},
  title =	{{Simulative Performance Evaluation of a Mobile Peer-to-Peer File-Sharing System}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.20},
  URN =		{urn:nbn:de:0030-drops-999},
  doi =		{10.4230/DagSemProc.04411.20},
  annote =	{Keywords: peer-to-peer , UMTS , performance evaluation , file-sharing}
}
Document
DOI: 10.4230/DagSemProc.04411.21
Some lessons from an experience with active video flow regulation

Authors: Ken Chen and Rim Hammi

Abstract
People are paying more and more attention to network infrastructures which are capable of dynamic code deployment and reconfiguration, in order to deal with the increase of network complexity both on scale and on heterogeneity. The concept of "active network" has been one of the pioneer ideas. As a starting point, we present an experience we got through the design and implementation of an active network technology based mechanism for video flow regulation. This mechanism makes use of several typical active networking features to perform real-time video flows analysis and provide consequently responsive feedback control to video codec. The main goal here is to adapt quickly the video stream bitrate to the current available bandwidth. From the end-user's view point, the effect of adaptation is to spread the bitrate reduction (relatively) uniformly to all the stream, avoiding in this way abrupt image deterioration (mosaics) due to packet loss. Tests show visible improvements obtained by our mechanism vs the classical RTCP-based control scheme. This work has been jointly done with Rim Hammi. We then discuss some extensions of our mechanism, which is in fact a generic network observer and decision maker. A more fundamental issue that we identified from this experience is related to the setting of the criteria for code acceptation. This is in fact a rather generic problem, and one can address it in various way. For instance, one can decide to accept a code based on some authentication rule. We are particularly interested by the issue of resources consummation. Indeed, as an example, the network observer module we designed can be configured to get a more or less fine time granularity, and consequently consume more or less CPU. So, one question is how to prevent abusive (either erroneous or malicious) resource consummation. There is few tentative which try to deal with the resource requirement (bandwidth, CPU, memory, etc.) of a code. The problem is rather complex and hard. It should at least include the monitoring of resource consummation. It requires also a kind of virtual resource model for coding purpose. This issue is, in our opinion, very important. Indeed, we do need a control framework to guarantee not only the correct functionality but also the adequate resource consummation of various codes, in order to be able to deal with future's flexible and/or autonomic networks in a secure and trustable way. Our current research effort on this issue is carried on within the french RNRT/Amarillo project.
Cite as

Ken Chen and Rim Hammi. Some lessons from an experience with active video flow regulation. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{chen_et_al:DagSemProc.04411.21,
  author =	{Chen, Ken and Hammi, Rim},
  title =	{{Some lessons from an experience with active video flow regulation}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  pages =	{1--1},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.21},
  URN =		{urn:nbn:de:0030-drops-859},
  doi =		{10.4230/DagSemProc.04411.21},
  annote =	{Keywords: active network , video streaming , resource control , responsive control}
}
Document
DOI: 10.4230/DagSemProc.04411.22
Toward a More General Network Layer

Authors: Ken Calvert, Leonid Poutievski, and Jim Griffioen

Abstract
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 networks 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.
Cite as

Ken Calvert, Leonid Poutievski, and Jim Griffioen. Toward a More General Network Layer. In Service Management and Self-Organization in IP-based Networks. Dagstuhl Seminar Proceedings, Volume 4411, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{calvert_et_al:DagSemProc.04411.22,
  author =	{Calvert, Ken and Poutievski, Leonid and Griffioen, Jim},
  title =	{{Toward a More General Network Layer}},
  booktitle =	{Service Management and Self-Organization in IP-based Networks},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4411},
  editor =	{Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04411.22},
  URN =		{urn:nbn:de:0030-drops-841},
  doi =		{10.4230/DagSemProc.04411.22},
  annote =	{Keywords: routing , forwarding}
}

Filters

  • Authors
  • A
  • Andersen, Frank-Uwe
  • Asmare, Eskindir
  • B
  • Babaoglu, Ozalp
  • Bossardt, Matthias
  • Brunner, Marcus
  • Brynjulfsson, Björn
  • C
  • Calvert, Ken
  • Carle, Georg
  • Chen, Ken
  • D
  • Dressler, Falko
  • F
  • Farkas, Karoly
  • Foster, Ian
  • G
  • Gao, Raymond
  • Gerke, Jan
  • Griffioen, Jim
  • H
  • Hammi, Rim
  • Hjalmtysson, Gisli
  • Hoßfeld, Tobias
  • Hutchison, David
  • I
  • Iamnitchi, Adriana
  • J
  • Jelasity, Mark
  • M
  • Meer, Hermann de
  • Minden, Gary
  • Montresor, Alberto
  • O
  • Oberender, Jens
  • P
  • Plattner, Bernhard
  • Poutievski, Leonid
  • R
  • Ripeanu, Matei
  • Rogers, Anne
  • Ruf, Lukas
  • S
  • Schmid, Stefan
  • Schulzrinne, Henning
  • Sifalakis, Manolis
  • Sterbenz, James P.G.
  • T
  • Tschudin, Christian
  • Tutschku, Kurt
  • W
  • Wagner, Arno
  • Wehrle, Klaus
  • Y
  • Yamamoto, Lidia
  • Z
  • Zhao, Weibin

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact