By Topic

Orderly broadcasting in a 2D torus

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Harutyunyan, H.A. ; Dept. of Comput. Sci., Concordia Univ., Montreal, Que., Canada ; Taslakian, P.

We describe an ordering of the vertices of a 2-dimensional torus and study the upper bound on the orderly broadcast time. Along with messy broadcasting, orderly broadcasting is another model where the nodes of the network have limited knowledge about their local neighborhood. However, while messy broadcasting explores the worst-case performance of broadcast schemes, orderly broadcasting, like the classical broadcast model, is concerned with finding a fixed ordering of the vertices of a graph that will minimize the overall broadcast time.

Published in:

Information Visualisation, 2004. IV 2004. Proceedings. Eighth International Conference on

Date of Conference:

14-16 July 2004