24 Search Results for "Plattner, Bernhard"

Document
DOI: 10.4230/LIPIcs.ESA.2025.10
Connected Partitions via Connected Dominating Sets

Authors: Aikaterini Niklanovits, Kirill Simonov, Shaily Verma, and Ziena Zeif

Published in: LIPIcs, Volume 351, 33rd Annual European Symposium on Algorithms (ESA 2025)

Abstract
The classical theorem due to Győri and Lovász states that any k-connected graph G admits a partition into k connected subgraphs, where each subgraph has a prescribed size and contains a prescribed vertex, as long as the total size of target subgraphs is equal to the size of G. However, this result is notoriously evasive in terms of efficient constructions, and it is still unknown whether such a partition can be computed in polynomial time, even for k = 5. We make progress towards an efficient constructive version of the Győri-Lovász theorem by considering a natural strengthening of the k-connectivity requirement. Specifically, we show that the desired connected partition can be found in polynomial time, if G contains k disjoint connected dominating sets. As a consequence of this result, we give several efficient approximate and exact constructive versions of the original Győri-Lovász theorem: - On general graphs, a Győri-Lovász partition with k parts can be computed in polynomial time when the input graph has connectivity Ω(k ⋅ log² n); - On convex bipartite graphs, connectivity of 4k is sufficient; - On biconvex graphs and interval graphs, connectivity of k is sufficient, meaning that our algorithm gives a "true" constructive version of the theorem on these graph classes.
Cite as

Aikaterini Niklanovits, Kirill Simonov, Shaily Verma, and Ziena Zeif. Connected Partitions via Connected Dominating Sets. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{niklanovits_et_al:LIPIcs.ESA.2025.10,
  author =	{Niklanovits, Aikaterini and Simonov, Kirill and Verma, Shaily and Zeif, Ziena},
  title =	{{Connected Partitions via Connected Dominating Sets}},
  booktitle =	{33rd Annual European Symposium on Algorithms (ESA 2025)},
  pages =	{10:1--10:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-395-9},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{351},
  editor =	{Benoit, Anne and Kaplan, Haim and Wild, Sebastian and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.10},
  URN =		{urn:nbn:de:0030-drops-244785},
  doi =		{10.4230/LIPIcs.ESA.2025.10},
  annote =	{Keywords: Gy\H{o}ri-Lov\'{a}sz theorem, connected dominating sets, graph classes}
}
Document
Vision
DOI: 10.4230/TGDK.1.1.10
Multilingual Knowledge Graphs and Low-Resource Languages: A Review

Authors: Lucie-Aimée Kaffee, Russa Biswas, C. Maria Keet, Edlira Kalemi Vakaj, and Gerard de Melo

Published in: TGDK, Volume 1, Issue 1 (2023): Special Issue on Trends in Graph Data and Knowledge. Transactions on Graph Data and Knowledge, Volume 1, Issue 1

Abstract
There is a lack of multilingual data to support applications in a large number of languages, especially for low-resource languages. Knowledge graphs (KG) could contribute to closing the gap of language support by providing easily accessible, machine-readable, multilingual linked data, which can be reused across applications. In this paper, we provide an overview of work in the domain of multilingual KGs with a focus on low-resource languages. We review the current state of multilingual KGs along with the different aspects that are crucial for creating KGs with language coverage in mind. Special consideration is given to challenges particular to low-resource languages in KGs. We further provide an overview of applications that yield multilingual KG information as well as downstream applications reusing such multilingual data. Finally, we explore open problems regarding multilingual KGs with a focus on low-resource languages.
Cite as

Lucie-Aimée Kaffee, Russa Biswas, C. Maria Keet, Edlira Kalemi Vakaj, and Gerard de Melo. Multilingual Knowledge Graphs and Low-Resource Languages: A Review. In Special Issue on Trends in Graph Data and Knowledge. Transactions on Graph Data and Knowledge (TGDK), Volume 1, Issue 1, pp. 10:1-10:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{kaffee_et_al:TGDK.1.1.10,
  author =	{Kaffee, Lucie-Aim\'{e}e and Biswas, Russa and Keet, C. Maria and Vakaj, Edlira Kalemi and de Melo, Gerard},
  title =	{{Multilingual Knowledge Graphs and Low-Resource Languages: A Review}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{10:1--10:19},
  ISSN =	{2942-7517},
  year =	{2023},
  volume =	{1},
  number =	{1},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.1.1.10},
  URN =		{urn:nbn:de:0030-drops-194845},
  doi =		{10.4230/TGDK.1.1.10},
  annote =	{Keywords: knowledge graphs, multilingual, low-resource languages, review}
}
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

Published in: Dagstuhl Seminar Proceedings, Volume 4411, Service Management and Self-Organization in IP-based Networks (2005)

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.21
Some lessons from an experience with active video flow regulation

Authors: Ken Chen and Rim Hammi

Published in: Dagstuhl Seminar Proceedings, Volume 4411, Service Management and Self-Organization in IP-based Networks (2005)

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.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

Published in: Dagstuhl Seminar Proceedings, Volume 4411, Service Management and Self-Organization in IP-based Networks (2005)

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

Published in: Dagstuhl Seminar Proceedings, Volume 4411, Service Management and Self-Organization in IP-based Networks (2005)

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

Published in: Dagstuhl Seminar Proceedings, Volume 4411, Service Management and Self-Organization in IP-based Networks (2005)

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

Published in: Dagstuhl Seminar Proceedings, Volume 4411, Service Management and Self-Organization in IP-based Networks (2005)

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

Published in: Dagstuhl Seminar Proceedings, Volume 4411, Service Management and Self-Organization in IP-based Networks (2005)

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

Published in: Dagstuhl Seminar Proceedings, Volume 4411, Service Management and Self-Organization in IP-based Networks (2005)

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

Published in: Dagstuhl Seminar Proceedings, Volume 4411, Service Management and Self-Organization in IP-based Networks (2005)

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

Published in: Dagstuhl Seminar Proceedings, Volume 4411, Service Management and Self-Organization in IP-based Networks (2005)

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

Published in: Dagstuhl Seminar Proceedings, Volume 4411, Service Management and Self-Organization in IP-based Networks (2005)

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

Published in: Dagstuhl Seminar Proceedings, Volume 4411, Service Management and Self-Organization in IP-based Networks (2005)

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

Published in: Dagstuhl Seminar Proceedings, Volume 4411, Service Management and Self-Organization in IP-based Networks (2005)

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}
}
  • Refine by Type
  • 24 Document/PDF
  • 2 Document/HTML

  • Refine by Publication Year
  • 1 2025
  • 1 2023
  • 22 2005

  • Refine by Author
  • 4 Meer, Hermann de
  • 4 Plattner, Bernhard
  • 3 Hutchison, David
  • 2 Bossardt, Matthias
  • 2 Carle, Georg
  • Show More...

  • Refine by Series/Journal
  • 1 LIPIcs
  • 1 TGDK
  • 22 DagSemProc

  • Refine by Classification
  • 1 Computing methodologies → Natural language processing
  • 1 Computing methodologies → Semantic networks
  • 1 Theory of computation → Graph algorithms analysis

  • Refine by Keyword
  • 5 self-organization
  • 4 peer-to-peer
  • 2 Service management
  • 2 active network
  • 2 bio-inspired networking
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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