Bounding Superposed On-Off Sources -- Variability Ordering and Majorization to the Rescue

Abstract

This report considers the problem of bounding the loss rate of the aggregation of independent on-off sources in a bufferless model by the loss rate resulting from the aggregation of i.i.d. on-off sources. This is done through a unified framework based on the interplay of well-known results from the theory of variability orderings with the concept of majorization ordering. The author uses a basic comparison result to readily derive a bound of Rasmussen et al. for heterogeneous sources and an upper bound of Mao and Habibi for homogeneous sources. He also discusses a second upper bound proposed by these authors, and argues that this conjectured upper bound is too tight and should be replaced by a new and provably correct upper bound.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2003
Accession Number
ADA444382

Entities

People

  • Armand M. Makowski

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Contracts
  • Electrical Engineering
  • Electronic Mail
  • Engineering
  • Heterogeneity
  • Information Operations
  • Instructions
  • Maryland
  • Materials
  • Multiplexing
  • Naval Warfare
  • Sequences
  • Steady State
  • Universities
  • Warfare

Readers

  • Mathematical Modeling and Probability Theory.