Control of packet flow in statistical data forks

  • H. Saidi
  • , P. S. Min
  • , M. V. Hegde

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper presents a new structural property of the Statistical Data Fork (SDF) which is exploited to derive a method for controlling packet flow in SDF. The property states that among all output channels, the one labeled with a binary number i can be made the most likely recipient of the packets associated with the codeword ci which is defined as the bit reversal pattern of i. The property also states that no other packets with a different codeword appear at this channel with a greater probability. A sufficient condition for this property to hold is for the probabilities at the input to be certain permutations of each other. Using this property, a convenient addressing scheme is presented for assigning channel groups in the SDF when the input probability is uniform. In the proposed addressing scheme, an output channel can be assigned to a channel group based only on its address bits and this assignment is optimal for all levels of the offered load to the SDF.

Original languageEnglish
Title of host publicationConference Record - International Conference on Communications
PublisherPubl by IEEE
Pages701-704
Number of pages4
ISBN (Print)0780318269
StatePublished - 1994
EventProceedings of the 1994 IEEE International Conference on Communications - New Orleans, LA, USA
Duration: May 1 1994May 5 1994

Publication series

NameConference Record - International Conference on Communications
Volume2
ISSN (Print)0536-1486

Conference

ConferenceProceedings of the 1994 IEEE International Conference on Communications
CityNew Orleans, LA, USA
Period05/1/9405/5/94

Fingerprint

Dive into the research topics of 'Control of packet flow in statistical data forks'. Together they form a unique fingerprint.

Cite this