Browse Prior Art Database

Simple SUPBRAM and JC-Optimized SUPBRAM

IP.com Disclosure Number: IPCOM000128562D
Original Publication Date: 1979-Dec-31
Included in the Prior Art Database: 2005-Sep-16
Document File: 16 page(s) / 46K

Publishing Venue

Software Patent Institute

Related People

Imrich Chlamtac: AUTHOR [+4]

Abstract

SUPBRAM is a protocol designed for use in networks with an arbitrary distribution of hidden nodes. The protocol is based on a scheduling function to schedule channel access; the notion of supervising nodes, whereby nodes relay scheduling information to other nodes; and the split transmission principle, whereby a picket is broadcast as two pieces, with an appropriate delay between the two transmissions. In thi paper we review these concepts and formally present the SUPBRAM protocol. We then develop an analytic model of SUPBRAM which yields throughput and (average) delay performance measures, both of which are given in terms of network parameters. Measures for several networks are given and, where possible, compared with those produced by other protocols. Finally we develop a procedure called "k-optimization" which allows us to choose the split-picket delay, given by R, which minimizes expected delay as a function of channel throughput. Since SUPBRAM delay performance is superior to measures exhibited by other methods, and since R,-optimized delay is superior to SUPBRAM, we may conclude that the performance of Q-optimized delay is much superior to that exhibited by other methods.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 9% of the total text.

Page 1 of 16

THIS DOCUMENT IS AN APPROXIMATE REPRESENTATION OF THE ORIGINAL.

Simple SUPBRAM and JC-Optimized SUPBRAM

by

Imrich Chlamtac and W. R. Franca

Computer Science Department

136 Lind Hall

Institute of Technology

University of Minnesota

Minneapolis, Minnesota 55455 SUPBRAM Performance Analysis:

Technical Report 79-4

February 1979

Cover design courtesy of Ruth and Jay Leavitt SUPBRAM Performance Analysis: Simple SUPBRAM and k-Optimized SUPBRAM

by Imrich Chlamtac and W. R. Franta

Abstract

SUPBRAM is a protocol designed for use in networks with an arbitrary distribution of hidden nodes. The protocol is based on a scheduling function to schedule channel access; the notion of supervising nodes, whereby nodes relay scheduling information to other nodes; and the split transmission principle, whereby a picket is broadcast as two pieces, with an appropriate delay between the two transmissions. In thi paper we review these concepts and formally present the SUPBRAM protocol. We then develop an analytic model of SUPBRAM which yields throughput and (average) delay performance measures, both of which are given in terms of network parameters. Measures for several networks are given and, where possible, compared with those produced by other protocols. Finally we develop a procedure called "k-optimization" which allows us to choose the split-picket delay, given by R, which minimizes expected delay as a function of channel throughput. Since SUPBRAM delay performance is superior to measures exhibited by other methods, and since R,-optimized delay is superior to SUPBRAM, we may conclude that the performance of Q-optimized delay is much superior to that exhibited by other methods.

1. Introduction

SUPBRAM is a random access protocol designed for use in networks of arbitrary topology and dispersion of hidden nodes. In this paper we con-centrate primarily on the theoretical consideration of SUPBRAM performance issues rather than on implementation issues. We are

University of Minnesota Page 1 Dec 31, 1979

Page 2 of 16

Simple SUPBRAM and JC-Optimized SUPBRAM

not aware, however, of any requirements that:SUPBRAM imposes which can not be met by an imple-mentation. The SUPBRAM protocol is presented and discussed in [3], which contains a complete description of its features as well as algorithms for the con-struction of its supporting data structure, the distance control matrix, or DCM. Here we first summarize the protocol and its features. Next we develop an analytic model which reflects its channel throughput and expected message delay measures. Finally we discuss optimally setting certain of its parameters (specifically Q, see below) so as to yield the lowest expected value for packet delay possible over the grange of allowable parameter (i.e., 2) values. 2. Summary of SUPBRAM protocol SUPBRAM was devised to provide nodes in a) a network for which there is a connectivity path between any two nodes, (i.e., a network in which information can be relayed by the nodes...