FiWi network throughput-delay modeling with traffic intensity control and local bandwidth allocation

Po Yen Chen, Martin Reisslein

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

Fiber-Wireless (FiWi) networks typically combine an optical access network with a wireless access network so as to build on the respective strengths of the optical and wireless network technologies. Prior analytical throughput-delay studies of FiWi networks have typically considered heavy-loaded traffic models, i.e., constantly backlogged source nodes. In contrast, in this paper we present a more general comprehensive FiWi network throughput-delay analysis that encompasses Poisson (non-heavy) as well as heavy-loaded input traffic models. In addition, our analysis covers bandwidth assignments of wireless channels both at the hop distance level and at the node level, as well as a queuing model of dynamic bandwidth allocation in the optical access network. Our analysis provides insightful guidelines for setting the channel access probabilities for source traffic and relay traffic in FiWi networks. Our numerical evaluations demonstrate that prior studies which considered only heavy traffic loads gave misleading results for the delay performance of well-known access probability assignments. We correct and clarify these misleading results with our more general analysis for non-heavy traffic.

Original languageEnglish (US)
Pages (from-to)8-22
Number of pages15
JournalOptical Switching and Networking
Volume28
DOIs
StatePublished - Apr 2018

Keywords

  • Fiber-Wireless (FiWi) network
  • Input traffic rate control
  • M/M/1/K queue
  • Node level design
  • Poisson traffic
  • Throughput-delay analysis

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'FiWi network throughput-delay modeling with traffic intensity control and local bandwidth allocation'. Together they form a unique fingerprint.

Cite this