3 Search Results for "Keshav, Srinivasan"

Document
DOI: 10.4230/LIPIcs.SEA.2024.5
Buffered Streaming Edge Partitioning

Authors: Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz, and Daniel Seemaier

Published in: LIPIcs, Volume 301, 22nd International Symposium on Experimental Algorithms (SEA 2024)

Abstract
Addressing the challenges of processing massive graphs, which are prevalent in diverse fields such as social, biological, and technical networks, we introduce HeiStreamE and FreightE, two innovative (buffered) streaming algorithms designed for efficient edge partitioning of large-scale graphs. HeiStreamE utilizes an adapted Split-and-Connect graph model and a Fennel-based multilevel partitioning scheme, while FreightE partitions a hypergraph representation of the input graph. Besides ensuring superior solution quality, these approaches also overcome the limitations of existing algorithms by maintaining linear dependency on the graph size in both time and memory complexity with no dependence on the number of blocks of partition. Our comprehensive experimental analysis demonstrates that HeiStreamE outperforms current streaming algorithms and the re-streaming algorithm 2PS in partitioning quality (replication factor), and is more memory-efficient for real-world networks where the number of edges is far greater than the number of vertices. Further, FreightE is shown to produce fast and efficient partitions, particularly for higher numbers of partition blocks.
Cite as

Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz, and Daniel Seemaier. Buffered Streaming Edge Partitioning. In 22nd International Symposium on Experimental Algorithms (SEA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 301, pp. 5:1-5:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{chhabra_et_al:LIPIcs.SEA.2024.5,
  author =	{Chhabra, Adil and Fonseca Faraj, Marcelo and Schulz, Christian and Seemaier, Daniel},
  title =	{{Buffered Streaming Edge Partitioning}},
  booktitle =	{22nd International Symposium on Experimental Algorithms (SEA 2024)},
  pages =	{5:1--5:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-325-6},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{301},
  editor =	{Liberti, Leo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.5},
  URN =		{urn:nbn:de:0030-drops-203701},
  doi =		{10.4230/LIPIcs.SEA.2024.5},
  annote =	{Keywords: graph partitioning, edge partitioning, streaming, online, buffered partitioning}
}
Document
DOI: 10.4230/DagRep.11.6.14
Towards Climate-Friendly Internet Research (Dagstuhl Seminar 21272)

Authors: Vaibhav Bajpai, Oliver Hohlfeld, Jon Crowcroft, and Srinivasan Keshav

Published in: Dagstuhl Reports, Volume 11, Issue 6 (2021)

Abstract
This report presents guidelines for deciding when virtual or hybrid conferences are suitable and how to design them. The report is the output from a Dagstuhl seminar where the goal was to review the current status of virtual conferences and to develop best practices for hybrid conferences. The participants provided input on the state-of-the-art of virtual conferences: what works, what does not, and what needs improvement. From this discussion, the participants discussed the requirements, implications, and guidelines for designing hybrid conferences. The participants felt that in the future, small research meetings will move entirely online whereas larger ones will be held as hybrid events.
Cite as

Vaibhav Bajpai, Oliver Hohlfeld, Jon Crowcroft, and Srinivasan Keshav. Towards Climate-Friendly Internet Research (Dagstuhl Seminar 21272). In Dagstuhl Reports, Volume 11, Issue 6, pp. 14-37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@Article{bajpai_et_al:DagRep.11.6.14,
  author =	{Bajpai, Vaibhav and Hohlfeld, Oliver and Crowcroft, Jon and Keshav, Srinivasan},
  title =	{{Towards Climate-Friendly Internet Research (Dagstuhl Seminar 21272)}},
  pages =	{14--37},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{6},
  editor =	{Bajpai, Vaibhav and Hohlfeld, Oliver and Crowcroft, Jon and Keshav, Srinivasan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.6.14},
  URN =		{urn:nbn:de:0030-drops-155780},
  doi =		{10.4230/DagRep.11.6.14},
  annote =	{Keywords: Carbon Footprint, Energy Efficient Networking, Climate Change}
}
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 Author
  • 2 Keshav, Srinivasan
  • 1 Bajpai, Vaibhav
  • 1 Chhabra, Adil
  • 1 Crowcroft, Jon
  • 1 Darragh, Patrick
  • Show More...

  • Refine by Classification
  • 1 Networks
  • 1 Social and professional topics
  • 1 Theory of computation → Graph algorithms analysis
  • 1 Theory of computation → Streaming, sublinear and near linear time algorithms

  • Refine by Keyword
  • 1 Carbon Footprint
  • 1 Climate Change
  • 1 Delay tolerant networks
  • 1 Energy Efficient Networking
  • 1 Mobile
  • Show More...

  • Refine by Type
  • 3 document

  • Refine by Publication Year
  • 1 2005
  • 1 2021
  • 1 2024

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