About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
4th International ICST Conference on Performance Evaluation Methodologies and Tools

Research Article

Analysis of a TCP system under polling-type reduction-signal procedures

Download884 downloads
Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.4108/ICST.VALUETOOLS2009.7725,
        author={Omer  Czerniak and Eitan  Altman and Uri  Yechiali},
        title={Analysis of a TCP system under polling-type reduction-signal procedures},
        proceedings={4th International ICST Conference on Performance Evaluation Methodologies and Tools},
        publisher={ICST},
        proceedings_a={VALUETOOLS},
        year={2010},
        month={5},
        keywords={TCP AIMD MIMD Cyclic Polling Probabilistic Polling M/G/1 Bulk Service},
        doi={10.4108/ICST.VALUETOOLS2009.7725}
    }
    
  • Omer Czerniak
    Eitan Altman
    Uri Yechiali
    Year: 2010
    Analysis of a TCP system under polling-type reduction-signal procedures
    VALUETOOLS
    ICST
    DOI: 10.4108/ICST.VALUETOOLS2009.7725
Omer Czerniak1,*, Eitan Altman2,*, Uri Yechiali1,*
  • 1: Department of Statistics and Operations Research, School of Mathematical Sciences, Tel Aviv University, Israel.
  • 2: INRIA, Sophia Antipolis, France
*Contact email: omercz@gmail.com, altman@sophia.inria.fr, uriy@post.tau.ac.il

Abstract

The performance of a Transmission Control Protocol (TCP) for a system with N connections sharing a common Active Queue Management (AQM) is analyzed for both Additive-Increase Multiplicative-Decrease (AIMD) and Multiplicative-Increase Multiplicative-Decrease (MIMD) control mechanisms, where reduction signals follow either a cyclic or a probabilistic polling-type procedure. The Laplace-Stieltjes Transforms (LST) of the transmission rate of each connection at a polling instant, as well as at an arbitrary moment, are derived. Explicit results are calculated for the mean rate and (in contrast to most polling models) for its second moment. The analysis of the probabilistic MIMD models uses transformations yielding a system's law of motion equivalent to that of an M/G/1 queue with bulk service.

Keywords
TCP AIMD MIMD Cyclic Polling Probabilistic Polling M/G/1 Bulk Service
Published
2010-05-16
Publisher
ICST
http://dx.doi.org/10.4108/ICST.VALUETOOLS2009.7725
Copyright © 2009–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL