11 Search Results for "Fall, Kevin"

Document
DOI: 10.4230/OASIcs.ICPEC.2025.8
RAGent: A Self-Learning RAG Agent for Adaptive Data Science Education

Authors: Mariia Vetluzhskikh and Fardina Fathmiul Alam

Published in: OASIcs, Volume 133, 6th International Computer Programming Education Conference (ICPEC 2025)

Abstract
Undergraduate data science education faces a scalability challenge: addressing a high volume of diverse student questions stemming from varying levels of prior knowledge, technical skills, and learning styles - while ensuring timely and accurate responses. Traditional solutions like manual replies or generic chatbots often fall short in terms of contextual relevance, speed, and efficiency. To tackle this, we introduce RAGent, a Retrieval-Augmented Generation (RAG) agent tailored for a university-level data science course at the University of Maryland. RAGent integrates course-specific materials - lecture notes, assignments, and syllabi - to deliver fast, context-aware answers while maintaining low computational overhead. A central innovation of RAGent is its query classification system, which categorizes student questions into: (i) directly answerable, (ii) relevant but unresolved (requiring instructor input), and (iii) irrelevant or out-of-scope. This system uses semantic similarity, keyword relevance, and dynamic thresholds to drive a targeted prompting strategy, enhancing response accuracy. Another key feature is RAGent’s self-learning loop, which continuously improves performance by integrating resolved queries into its knowledge base and flagging unresolved ones for review and retraining. This dual mechanism ensures both immediate adaptability and long-term scalability. We evaluate RAGent using standard NLP metrics (accuracy, precision, recall, F1-score) and report strong performance in filtering and answering student queries. In a user study with 125 students, over 94% expressed a desire to keep RAGent in the course, citing improved clarity and helpfulness. These results suggest that RAGent significantly enhances support in data science education by providing accurate, contextual responses and reducing instructor workload - offering a scalable, adaptive alternative to conventional support methods. Future work will explore deployment across additional courses and institutions to further validate the RAGent’s adaptability.
Cite as

Mariia Vetluzhskikh and Fardina Fathmiul Alam. RAGent: A Self-Learning RAG Agent for Adaptive Data Science Education. In 6th International Computer Programming Education Conference (ICPEC 2025). Open Access Series in Informatics (OASIcs), Volume 133, pp. 8:1-8:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{vetluzhskikh_et_al:OASIcs.ICPEC.2025.8,
  author =	{Vetluzhskikh, Mariia and Alam, Fardina Fathmiul},
  title =	{{RAGent: A Self-Learning RAG Agent for Adaptive Data Science Education}},
  booktitle =	{6th International Computer Programming Education Conference (ICPEC 2025)},
  pages =	{8:1--8:10},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-393-5},
  ISSN =	{2190-6807},
  year =	{2025},
  volume =	{133},
  editor =	{Queir\'{o}s, Ricardo and Pinto, M\'{a}rio and Portela, Filipe and Sim\~{o}es, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2025.8},
  URN =		{urn:nbn:de:0030-drops-240387},
  doi =		{10.4230/OASIcs.ICPEC.2025.8},
  annote =	{Keywords: RAG, Agent, Chatbot, Data Science, Education, Query Classification, Information Retrieval, LLM}
}
Document
Invited Talk
DOI: 10.4230/LIPIcs.ICALP.2025.2
Let’s Try to Be More Tolerant: On Tolerant Property Testing and Distance Approximation (Invited Talk)

Authors: Dana Ron

Published in: LIPIcs, Volume 334, 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025)

Abstract
This short paper accompanies an invited talk given at ICALP2025. It is an informal, high-level presentation of tolerant testing and distance approximation. It includes some general results as well as a few specific ones, with the aim of providing a taste of this research direction within the area of sublinear algorithms.
Cite as

Dana Ron. Let’s Try to Be More Tolerant: On Tolerant Property Testing and Distance Approximation (Invited Talk). In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 2:1-2:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{ron:LIPIcs.ICALP.2025.2,
  author =	{Ron, Dana},
  title =	{{Let’s Try to Be More Tolerant: On Tolerant Property Testing and Distance Approximation}},
  booktitle =	{52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025)},
  pages =	{2:1--2:10},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-372-0},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{334},
  editor =	{Censor-Hillel, Keren and Grandoni, Fabrizio and Ouaknine, Jo\"{e}l and Puppis, Gabriele},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.2},
  URN =		{urn:nbn:de:0030-drops-233798},
  doi =		{10.4230/LIPIcs.ICALP.2025.2},
  annote =	{Keywords: Sublinear Algorithms, Tolerant Property Testing, Distance Approximation}
}
Document
DOI: 10.4230/LIPIcs.SoCG.2024.1
A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves

Authors: Zachary Abel, Hugo A. Akitaya, Scott Duke Kominers, Matias Korman, and Frederick Stock

Published in: LIPIcs, Volume 293, 40th International Symposium on Computational Geometry (SoCG 2024)

Abstract
In the modular robot reconfiguration problem, we are given n cube-shaped modules (or robots) as well as two configurations, i.e., placements of the n modules so that their union is face-connected. The goal is to find a sequence of moves that reconfigures the modules from one configuration to the other using "sliding moves," in which a module slides over the face or edge of a neighboring module, maintaining connectivity of the configuration at all times. For many years it has been known that certain module configurations in this model require at least Ω(n²) moves to reconfigure between them. In this paper, we introduce the first universal reconfiguration algorithm - i.e., we show that any n-module configuration can reconfigure itself into any specified n-module configuration using just sliding moves. Our algorithm achieves reconfiguration in O(n²) moves, making it asymptotically tight. We also present a variation that reconfigures in-place, it ensures that throughout the reconfiguration process, all modules, except for one, will be contained in the union of the bounding boxes of the start and end configuration.
Cite as

Zachary Abel, Hugo A. Akitaya, Scott Duke Kominers, Matias Korman, and Frederick Stock. A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves. In 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 293, pp. 1:1-1:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{abel_et_al:LIPIcs.SoCG.2024.1,
  author =	{Abel, Zachary and A. Akitaya, Hugo and Kominers, Scott Duke and Korman, Matias and Stock, Frederick},
  title =	{{A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{1:1--1:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.1},
  URN =		{urn:nbn:de:0030-drops-199468},
  doi =		{10.4230/LIPIcs.SoCG.2024.1},
  annote =	{Keywords: modular reconfigurable robots, sliding cube model, reconfiguration}
}
Document
Vision
DOI: 10.4230/TGDK.1.1.6
Towards Ordinal Data Science

Authors: Gerd Stumme, Dominik Dürrschnabel, and Tom Hanika

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
Order is one of the main instruments to measure the relationship between objects in (empirical) data. However, compared to methods that use numerical properties of objects, the amount of ordinal methods developed is rather small. One reason for this is the limited availability of computational resources in the last century that would have been required for ordinal computations. Another reason - particularly important for this line of research - is that order-based methods are often seen as too mathematically rigorous for applying them to real-world data. In this paper, we will therefore discuss different means for measuring and ‘calculating’ with ordinal structures - a specific class of directed graphs - and show how to infer knowledge from them. Our aim is to establish Ordinal Data Science as a fundamentally new research agenda. Besides cross-fertilization with other cornerstone machine learning and knowledge representation methods, a broad range of disciplines will benefit from this endeavor, including, psychology, sociology, economics, web science, knowledge engineering, scientometrics.
Cite as

Gerd Stumme, Dominik Dürrschnabel, and Tom Hanika. Towards Ordinal Data Science. In Special Issue on Trends in Graph Data and Knowledge. Transactions on Graph Data and Knowledge (TGDK), Volume 1, Issue 1, pp. 6:1-6:39, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{stumme_et_al:TGDK.1.1.6,
  author =	{Stumme, Gerd and D\"{u}rrschnabel, Dominik and Hanika, Tom},
  title =	{{Towards Ordinal Data Science}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{6:1--6:39},
  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.6},
  URN =		{urn:nbn:de:0030-drops-194801},
  doi =		{10.4230/TGDK.1.1.6},
  annote =	{Keywords: Order relation, data science, relational theory of measurement, metric learning, general algebra, lattices, factorization, approximations and heuristics, factor analysis, visualization, browsing, explainability}
}
Document
DOI: 10.4230/DagSemProc.09071.1
09071 Abstracts Collection – Delay and Disruption-Tolerant Networking (DTN) II

Authors: Kevin Fall, Cecilia Mascolo, Jörg Ott, and Lars Wolf

Published in: Dagstuhl Seminar Proceedings, Volume 9071, Delay and Disruption-Tolerant Networking (DTN) II (2009)

Abstract
From 08.02. to 11.02.2009, the Dagstuhl Seminar 09071 ``Delay and Disruption-Tolerant Networking (DTN) II '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. 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

Kevin Fall, Cecilia Mascolo, Jörg Ott, and Lars Wolf. 09071 Abstracts Collection – Delay and Disruption-Tolerant Networking (DTN) II. In Delay and Disruption-Tolerant Networking (DTN) II. Dagstuhl Seminar Proceedings, Volume 9071, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{fall_et_al:DagSemProc.09071.1,
  author =	{Fall, Kevin and Mascolo, Cecilia and Ott, J\"{o}rg and Wolf, Lars},
  title =	{{09071 Abstracts Collection – Delay and Disruption-Tolerant Networking (DTN) II}},
  booktitle =	{Delay and Disruption-Tolerant Networking (DTN) II},
  pages =	{1--8},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9071},
  editor =	{Kevin Fall and Cecilia Mascolo and J\"{o}rg Ott and Lars Wolf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09071.1},
  URN =		{urn:nbn:de:0030-drops-23603},
  doi =		{10.4230/DagSemProc.09071.1},
  annote =	{Keywords: DTN, simulations, mobility, MANET, delay-tolerant networking, ad-hoc networking, routing}
}
Document
DOI: 10.4230/DagSemProc.09071.2
09071 Executive Summary – Delay and Disruption-Tolerant Networking (DTN) II

Authors: Kevin Fall, Cecilia Mascolo, Jörg Ott, and Lars Wolf

Published in: Dagstuhl Seminar Proceedings, Volume 9071, Delay and Disruption-Tolerant Networking (DTN) II (2009)

Abstract
Today's Internet architecture and protocols, while perfectly suitable for well- connected users, may easily experience serious performance degradation and entirely stop working in more challenged networking environments. These correspondong scenarios all share two commonalities: that an end-to-end path between two communicating nodes may not exist at any single point in time and that communication delay may be significant. With the continued expansion of the Internet into new areas, these environments become commonplace and are no longer restricted to exotic sensing applications but are quickly becoming relevant to consumers in everyday life. Many attempts over recent years of incrementally fixing the Internet protocols in a bottom up fashion have only achieved partial successes, and a more fundamental approach is needed to address networking environments in which delays and disconnections may last for significant periods of time, and are the rule rather than the exception. Delay-tolerant Networking (DTN) has taken a more encompassing approach to dealing with virtually all types of connectivity challenges, from bit rate to errors to delays to disruptions. By providing a novel communication abstraction that relies exclusively on asynchronous hop-by-hop message passing with no need for instant end-to-end connectivity, DTN concepts enable communications even under adverse conditions. This comes, however, at the cost of interactivity of communications, rendering any kind state synchronization or validation more difficult and raising new challenges. These include routing protocols – that need to operate under often unknown future conditions, security mechanisms – that can no longer carry out instant key derivation or validation even if a security infrastructure was in place, and applica- tion protocols and paradigms – that can no longer rely on simple lower layer abstrac- tions promising (mostly) instant and reliable interactions.
Cite as

Kevin Fall, Cecilia Mascolo, Jörg Ott, and Lars Wolf. 09071 Executive Summary – Delay and Disruption-Tolerant Networking (DTN) II. In Delay and Disruption-Tolerant Networking (DTN) II. Dagstuhl Seminar Proceedings, Volume 9071, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{fall_et_al:DagSemProc.09071.2,
  author =	{Fall, Kevin and Mascolo, Cecilia and Ott, J\"{o}rg and Wolf, Lars},
  title =	{{09071 Executive Summary – Delay and Disruption-Tolerant Networking (DTN) II}},
  booktitle =	{Delay and Disruption-Tolerant Networking (DTN) II},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9071},
  editor =	{Kevin Fall and Cecilia Mascolo and J\"{o}rg Ott and Lars Wolf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09071.2},
  URN =		{urn:nbn:de:0030-drops-23574},
  doi =		{10.4230/DagSemProc.09071.2},
  annote =	{Keywords: DTN, simulations, mobility, MANET, delay-tolerant networking, ad-hoc networking, routing}
}
Document
DOI: 10.4230/DagSemProc.09071.3
On the Performance of Pedestrian Content Distribution

Authors: Gunnar Karlsson, Olafur Ragnar Helgason, and Vladimir Vukadinovic

Published in: Dagstuhl Seminar Proceedings, Volume 9071, Delay and Disruption-Tolerant Networking (DTN) II (2009)

Abstract
Mobile communication devices may be used for spreading multimedia data without support of an infrastructure. Such a scheme, where the data is carried by people walking around and relayed from device to device by means of short range radio, could potentially form a public content distribution system that spans vast urban areas. There are basically only three system parameters that can be determined in the design: the transmission range of the nodes, the setup time when nodes make a contact, and their storage capacity. The transport mechanism is the flow of people and it can be studied but not engineered. The question addressed in this paper is how well pedestrian content distribution may work. We answer this question by modeling the mobility of people moving around in a city, constrained by a given topology. The model is supplemented by simulation of similar or related scenarios for validation and extension. Our conclusion is that contents spread well with pedestrian speeds already at low arrival rates into a studied region. Our contributions are both the results on the feasibility of pedestrian content distribution and the queuing analytic model that captures the flow of people.
Cite as

Gunnar Karlsson, Olafur Ragnar Helgason, and Vladimir Vukadinovic. On the Performance of Pedestrian Content Distribution. In Delay and Disruption-Tolerant Networking (DTN) II. Dagstuhl Seminar Proceedings, Volume 9071, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{karlsson_et_al:DagSemProc.09071.3,
  author =	{Karlsson, Gunnar and Helgason, Olafur Ragnar and Vukadinovic, Vladimir},
  title =	{{On the Performance of Pedestrian Content Distribution}},
  booktitle =	{Delay and Disruption-Tolerant Networking (DTN) II},
  pages =	{1--23},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9071},
  editor =	{Kevin Fall and Cecilia Mascolo and J\"{o}rg Ott and Lars Wolf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09071.3},
  URN =		{urn:nbn:de:0030-drops-23597},
  doi =		{10.4230/DagSemProc.09071.3},
  annote =	{Keywords: Content distribution, mobile peer-to-peer, ad hoc network, wireless network, mobile communication}
}
Document
DOI: 10.4230/DagSemProc.09071.4
Wireless Epidemic Spread in Dynamic Human Networks

Authors: Eiko Yoneki, Pan Hui, and Jon Crowcroft

Published in: Dagstuhl Seminar Proceedings, Volume 9071, Delay and Disruption-Tolerant Networking (DTN) II (2009)

Abstract
The emergence of Delay Tolerant Networks (DTNs) has culminated in a new generation of wireless networking. New communication paradigms, which use dynamic interconnectedness as people encounter each other opportunistically, lead towards a world where digital traffic flows more easily. We focus on humanto- human communication in environments that exhibit the characteristics of social networks. This paper describes our study of information flow during epidemic spread in such dynamic human networks, a topic which shares many issues with network-based epidemiology. We explore hub nodes extracted from real world connectivity traces and show their influence on the epidemic to demonstrate the characteristics of information propagation.
Cite as

Eiko Yoneki, Pan Hui, and Jon Crowcroft. Wireless Epidemic Spread in Dynamic Human Networks. In Delay and Disruption-Tolerant Networking (DTN) II. Dagstuhl Seminar Proceedings, Volume 9071, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{yoneki_et_al:DagSemProc.09071.4,
  author =	{Yoneki, Eiko and Hui, Pan and Crowcroft, Jon},
  title =	{{Wireless Epidemic Spread in Dynamic Human Networks}},
  booktitle =	{Delay and Disruption-Tolerant Networking (DTN) II},
  pages =	{1--16},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9071},
  editor =	{Kevin Fall and Cecilia Mascolo and J\"{o}rg Ott and Lars Wolf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09071.4},
  URN =		{urn:nbn:de:0030-drops-23585},
  doi =		{10.4230/DagSemProc.09071.4},
  annote =	{Keywords: Time Dependent Networks, Connectivity Modelling and Analysis, Network Measurement, Delay Tolerant Networks, Social Networks}
}
Document
DOI: 10.4230/DagSemProc.05142.1
05142 Abstracts Collection – Disruption Tolerant Networking

Authors: Marcus Brunner, Lars Eggert, Kevin Fall, Jörg Ott, and Lars Wolf

Published in: Dagstuhl Seminar Proceedings, Volume 5142, Disruption Tolerant Networking (2005)

Abstract
From 03.04.05 to 06.04.05, the Dagstuhl Seminar 05142 ``Disruption Tolerant Networking'' 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

Marcus Brunner, Lars Eggert, Kevin Fall, Jörg Ott, and Lars Wolf. 05142 Abstracts Collection – Disruption Tolerant Networking. In Disruption Tolerant Networking. Dagstuhl Seminar Proceedings, Volume 5142, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{brunner_et_al:DagSemProc.05142.1,
  author =	{Brunner, Marcus and Eggert, Lars and Fall, Kevin and Ott, J\"{o}rg and Wolf, Lars},
  title =	{{05142 Abstracts Collection – Disruption Tolerant Networking}},
  booktitle =	{Disruption Tolerant Networking},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5142},
  editor =	{Marcus Brunner and Lars Eggert and Kevin Fall and J\"{o}rg Ott and Lars Wolf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05142.1},
  URN =		{urn:nbn:de:0030-drops-3524},
  doi =		{10.4230/DagSemProc.05142.1},
  annote =	{Keywords: Mobile networking, disconnected operation, delay-tolerant networking, internet protocols, transport protocols, ad-hoc networking, intermittent connectivity}
}
Document
DOI: 10.4230/DagSemProc.05142.2
05142 Executive Summary – Disruption Tolerant Networking

Authors: Marcus Brunner, Lars Eggert, Kevin Fall, Jörg Ott, and Lars Wolf

Published in: Dagstuhl Seminar Proceedings, Volume 5142, Disruption Tolerant Networking (2005)

Abstract
Disruption Tolerant Networking (DTN) is a new area of research to improve network communication when connectivity is periodic, intermittent, and/or prone to disruptions. A seminar on DTN was held at at Schloß Dagstuhl, Germany, from 3 to 6 April 2005. Researchers from different fields discussed their approaches to dealing with delays, intermittent connectivity, and the potential non-existence of an end-to-end path in a number of different environments. The two major areas identified were: (1) dealing with delay and disruption in the present Internet in the context of wireless, mobile, and nomadic communications, supporting existing applications and (2) addressing new applications with a focus on exploiting discontinuous connectivity and opportunistic contacts for asynchronous communications. This article briefly reviews the seminar presentations and discussions.
Cite as

Marcus Brunner, Lars Eggert, Kevin Fall, Jörg Ott, and Lars Wolf. 05142 Executive Summary – Disruption Tolerant Networking. In Disruption Tolerant Networking. Dagstuhl Seminar Proceedings, Volume 5142, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{brunner_et_al:DagSemProc.05142.2,
  author =	{Brunner, Marcus and Eggert, Lars and Fall, Kevin and Ott, J\"{o}rg and Wolf, Lars},
  title =	{{05142 Executive Summary – Disruption Tolerant Networking}},
  booktitle =	{Disruption Tolerant Networking},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5142},
  editor =	{Marcus Brunner and Lars Eggert and Kevin Fall and J\"{o}rg Ott and Lars Wolf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05142.2},
  URN =		{urn:nbn:de:0030-drops-3506},
  doi =		{10.4230/DagSemProc.05142.2},
  annote =	{Keywords: Delay-tolerant networking, disconnected operation, mobility, ad-hoc networks, sensor networks, interplanetary Internet}
}
Document
DOI: 10.4230/DagSemProc.05142.3
An Architecture for Tetherless Communication

Authors: Aaditeshwar Seth, Patrick Darragh, Suihong Liang, Yunfeng Lin, and Srinivasan Keshav

Published in: Dagstuhl Seminar Proceedings, Volume 5142, Disruption Tolerant Networking (2005)

Abstract
In the emerging paradigm of tetherless computing, client applications running on small, inexpensive, and smart mobile devices maintain opportunistic wireless connectivity with back-end services running on centralized computers, enabling novel classes of applications. These applications require a communications infrastrastructure that is mobility-aware, disconnection-resilient and provides support for an opportunistic style of communiction. It should even be able to function across network partitions that may arise when end-to-end communication is not possible. We outline, design, and evaluate the implementation of an architecture that provides this functionality. we shot that it is possible for next-generation mobile devices to obtain up to 80-fold improvement over conventional mechanisms by exploiting opportunistic WiFi links, and that this benefit can be delivered as an overlay that is compatible with the current Internet.
Cite as

Aaditeshwar Seth, Patrick Darragh, Suihong Liang, Yunfeng Lin, and Srinivasan Keshav. An Architecture for Tetherless Communication. In Disruption Tolerant Networking. Dagstuhl Seminar Proceedings, Volume 5142, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{seth_et_al:DagSemProc.05142.3,
  author =	{Seth, Aaditeshwar and Darragh, Patrick and Liang, Suihong and Lin, Yunfeng and Keshav, Srinivasan},
  title =	{{An Architecture for Tetherless Communication}},
  booktitle =	{Disruption Tolerant Networking},
  pages =	{1--13},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5142},
  editor =	{Marcus Brunner and Lars Eggert and Kevin Fall and J\"{o}rg Ott and Lars Wolf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05142.3},
  URN =		{urn:nbn:de:0030-drops-3519},
  doi =		{10.4230/DagSemProc.05142.3},
  annote =	{Keywords: Delay tolerant networks, Opportunistic communication, Tetherless computing, Wireless, Mobile}
}
  • Refine by Type
  • 11 Document/PDF
  • 3 Document/HTML

  • Refine by Publication Year
  • 2 2025
  • 1 2024
  • 1 2023
  • 4 2009
  • 3 2005

  • Refine by Author
  • 4 Fall, Kevin
  • 4 Ott, Jörg
  • 4 Wolf, Lars
  • 2 Brunner, Marcus
  • 2 Eggert, Lars
  • Show More...

  • Refine by Series/Journal
  • 2 LIPIcs
  • 1 OASIcs
  • 1 TGDK
  • 7 DagSemProc

  • Refine by Classification
  • 1 Applied computing → Education
  • 1 Computing methodologies → Algebraic algorithms
  • 1 Computing methodologies → Artificial intelligence
  • 1 Computing methodologies → Boolean algebra algorithms
  • 1 Computing methodologies → Inductive logic learning
  • Show More...

  • Refine by Keyword
  • 3 ad-hoc networking
  • 3 delay-tolerant networking
  • 3 mobility
  • 2 DTN
  • 2 MANET
  • 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