• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Thinning Protocols for Routing h-Relations Over Shared Media

Anssi Kautonen, Ville Leppänen, Martti Penttonen, Thinning Protocols for Routing h-Relations Over Shared Media. Journal of Parallel and Distributed Computing 70(8), 783–789, 2010.

Abstract:

Various shared media support several channels and provide extensive
connectivity enabling nodes of such media simultaneously communicate
with each other. Especially, optical communication offers huge
bandwidth and makes it possible to build communication networks of
very high bandwidth. However, contention of shared channels may be
challenging.

In this paper we examine the problem setup called $h$-relation routing
on complete networks under so-called OCPC or 1-collision assumption.
We present some simple and robust communication algorithms and
study their efficiency, analytically and experimentally. The analyses
and experiments show that if there is enough parallel slackness,
then routing is work-optimal, and the amortized routing cost per packet
is a small constant.

BibTeX entry:

@ARTICLE{jKaLePe10a,
  title = {Thinning Protocols for Routing h-Relations Over Shared Media},
  author = {Kautonen, Anssi and Leppänen, Ville and Penttonen, Martti},
  journal = {Journal of Parallel and Distributed Computing},
  volume = {70},
  number = {8},
  pages = {783–789},
  year = {2010},
  keywords = {routing, shared media, h-relation, work-optimal},
}

Belongs to TUCS Research Unit(s): Algorithmics and Computational Intelligence Group (ACI)

Publication Forum rating of this publication: level 2

Edit publication