Performance analysis of non-preemptive GE/G/1 priority queueing of LER system with bulk arrivals

M X / G / 1 non-preemptive priority queue with bulk arrivals has already been analysed in many papers. Two problems are known in this area: first, when the number of priorities is greater than 2, the analysis for priority processes is obviously very difficult to handle. Therefore, the earlier work o...

Full description

Saved in:
Bibliographic Details
Published inComputers & electrical engineering Vol. 35; no. 5; pp. 764 - 789
Main Authors Chen, Yunlung, Chen, Chienhua
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.09.2009
Subjects
Online AccessGet full text

Cover

Loading…
Abstract M X / G / 1 non-preemptive priority queue with bulk arrivals has already been analysed in many papers. Two problems are known in this area: first, when the number of priorities is greater than 2, the analysis for priority processes is obviously very difficult to handle. Therefore, the earlier work on the subject was restricted mostly to two priority classes; and second, although analytically explicit results are available, they require sophisticated closed-form expressions of the mean queue length. One particular bulk size distribution – the GE distribution – is motivated by an ME (Maximum Entropy) formulation for the behavior of a G/G/1 queue. The choice of a GE distribution is motivated by the fact that measurements of actual inter-arrival traffic or service times may be generally limited and so only few parameters, such as mean and variance, can be computed reliably. Thus this paper we can obtain very simple and analytic closed-form expression for the mean queue length of a GE/G/1 priority queue and a significant increase in performance evaluation has been achieved. We present the four-class priority queues, performance analysis and simulation of the LER (Label Edge Router) system in the ATM-based MPLS (Multiprotocol Label Switching) network. We wish to obtain the boundary conditions of the mean queue lengths and the mean queueing delays for each priority class, since this metric is one of the most important in performance evaluation parameters for improving QoS and system performance of the LER system in ATM-based MPLS network. A significant numerical example is presented and discussed as well. In order to obtain optimizing the performance analysis for EF flow, AF 1 flow, AF 2 flow and BE flow, the optimum ratios of COV (Coefficient of Variation) can be found via many numerical experiments carried out by the authors for queueing network model with HOL (Head of Line) priority rules. However, the ratios of COV value constraints exist. Furthermore, we find that each service class gradually begins to deteriorate when SQVs (Squared Coefficient of Variations), C ai 2 > 15.524 , C si 2 > 12.96 and traffic intensity is greater than 0.95. We also find the values of maximum allowed burst size for EF flow and AF 1 flow and perform necessary policing actions on EF flow and AF 1 flow at the boundary node of the network. Finally, the four-class GE/G/1 priority queues and performance analysis of the LER system are shown accurate and robust after the comparison between theoretical evaluates and computer simulation results.
AbstractList M super()XG/1 non-preemptive priority queue with bulk arrivals has already been analysed in many papers. Two problems are known in this area: first, when the number of priorities is greater than 2, the analysis for priority processes is obviously very difficult to handle. Therefore, the earlier work on the subject was restricted mostly to two priority classes; and second, although analytically explicit results are available, they require sophisticated closed-form expressions of the mean queue length. One particular bulk size distribution - the GE distribution - is motivated by an ME (Maximum Entropy) formulation for the behavior of a G/G/1 queue. The choice of a GE distribution is motivated by the fact that measurements of actual inter-arrival traffic or service times may be generally limited and so only few parameters, such as mean and variance, can be computed reliably. Thus this paper we can obtain very simple and analytic closed-form expression for the mean queue length of a GE/G/1 priority queue and a significant increase in performance evaluation has been achieved. We present the four-class priority queues, performance analysis and simulation of the LER (Label Edge Router) system in the ATM-based MPLS (Multiprotocol Label Switching) network. We wish to obtain the boundary conditions of the mean queue lengths and the mean queueing delays for each priority class, since this metric is one of the most important in performance evaluation parameters for improving QoS and system performance of the LER system in ATM-based MPLS network. A significant numerical example is presented and discussed as well. In order to obtain optimizing the performance analysis for EF flow, AF 1 flow, AF 2 flow and BE flow, the optimum ratios of COV (Coefficient of Variation) can be found via many numerical experiments carried out by the authors for queueing network model with HOL (Head of Line) priority rules. However, the ratios of COV value constraints exist. Furthermore, we find that each service class gradually begins to deteriorate when SQVs (Squared Coefficient of Variations), [MathML equation], [MathML equation] and traffic intensity is greater than 0.95. We also find the values of maximum allowed burst size for EF flow and AF 1 flow and perform necessary policing actions on EF flow and AF 1 flow at the boundary node of the network. Finally, the four-class GE/G/1 priority queues and performance analysis of the LER system are shown accurate and robust after the comparison between theoretical evaluates and computer simulation results.
M X / G / 1 non-preemptive priority queue with bulk arrivals has already been analysed in many papers. Two problems are known in this area: first, when the number of priorities is greater than 2, the analysis for priority processes is obviously very difficult to handle. Therefore, the earlier work on the subject was restricted mostly to two priority classes; and second, although analytically explicit results are available, they require sophisticated closed-form expressions of the mean queue length. One particular bulk size distribution – the GE distribution – is motivated by an ME (Maximum Entropy) formulation for the behavior of a G/G/1 queue. The choice of a GE distribution is motivated by the fact that measurements of actual inter-arrival traffic or service times may be generally limited and so only few parameters, such as mean and variance, can be computed reliably. Thus this paper we can obtain very simple and analytic closed-form expression for the mean queue length of a GE/G/1 priority queue and a significant increase in performance evaluation has been achieved. We present the four-class priority queues, performance analysis and simulation of the LER (Label Edge Router) system in the ATM-based MPLS (Multiprotocol Label Switching) network. We wish to obtain the boundary conditions of the mean queue lengths and the mean queueing delays for each priority class, since this metric is one of the most important in performance evaluation parameters for improving QoS and system performance of the LER system in ATM-based MPLS network. A significant numerical example is presented and discussed as well. In order to obtain optimizing the performance analysis for EF flow, AF 1 flow, AF 2 flow and BE flow, the optimum ratios of COV (Coefficient of Variation) can be found via many numerical experiments carried out by the authors for queueing network model with HOL (Head of Line) priority rules. However, the ratios of COV value constraints exist. Furthermore, we find that each service class gradually begins to deteriorate when SQVs (Squared Coefficient of Variations), C ai 2 > 15.524 , C si 2 > 12.96 and traffic intensity is greater than 0.95. We also find the values of maximum allowed burst size for EF flow and AF 1 flow and perform necessary policing actions on EF flow and AF 1 flow at the boundary node of the network. Finally, the four-class GE/G/1 priority queues and performance analysis of the LER system are shown accurate and robust after the comparison between theoretical evaluates and computer simulation results.
Author Chen, Yunlung
Chen, Chienhua
Author_xml – sequence: 1
  givenname: Yunlung
  surname: Chen
  fullname: Chen, Yunlung
  email: tense.chen@msa.hinet.net
  organization: Institute of Communication Engineering, Tatung University, 40, Chungshan N. Rd., 3rd Sec. Taipei, 104, Taiwan
– sequence: 2
  givenname: Chienhua
  surname: Chen
  fullname: Chen, Chienhua
  email: cchen@ttu.edu.tw
  organization: Institute of Communication Engineering, Tatung University, 40, Chungshan N. Rd., 3rd Sec. Taipei, 104, Taiwan
BookMark eNqNkM1O6zAQhS0EEuXnHcyGXdJx0tTOCl1VvQWpEgixN449AZckzrXdor49rsoC3RWroxmdc2b0XZDTwQ1IyA2DnAGbTze5dv2IHWoc3vICoM6hzAHYCZkwwesMeFWdkgnArMp4DfNzchHCBtI8Z2JCXp_Qt873atBI1aC6fbCBupamO9noEfsx2h3S1XK6mjI6euu8jXv6b4tbtMPbwbpePtOwDxF7-mnjO2223QdV3tud6sIVOWuT4PW3XpKXv8uXxX22flw9LP6sM11WRcyMYS0vOBMNCKzLphEGVVXVRcNbATNgBploWc2RV0zpulF61qY9N2gMFOUluT3Wjt6l30KUvQ0au04N6LZBFoyVQhQiGe-ORu1dCB5bqW1U0bohemU7yUAewMqN_AFWHsBKKGUCmxrq_xoSlV75_a-yi2MWE4qdRS-DtpjYG-tRR2mc_UXLF0ewnmc
CitedBy_id crossref_primary_10_1016_j_ejor_2012_08_008
crossref_primary_10_1007_s00170_014_6388_0
Cites_doi 10.1078/1434-8411-54100181
10.1023/A:1019199013546
10.1078/1434-8411-54100193
10.1109/90.282603
10.1287/opre.21.4.974
10.1016/0167-6377(91)90063-U
10.1057/jors.1988.30
10.17487/rfc2597
10.1007/BF02023095
10.1049/ip-com:19982077
10.17487/rfc3270
10.17487/rfc2474
10.1007/BF00290731
10.1007/978-0-387-35068-4
10.1109/26.20117
10.1016/S0166-5316(02)00092-5
10.17487/rfc3246
10.17487/rfc2475
10.1093/ietisy/e89-d.12.2886
10.1016/0166-5316(89)90009-6
10.17487/rfc3031
10.17487/rfc2598
10.1007/BF00572990
10.1287/opre.29.5.945
10.1109/MIC.2004.1260705
10.1109/TSSC.1968.300117
10.1109/5.650182
ContentType Journal Article
Copyright 2009 Elsevier Ltd
Copyright_xml – notice: 2009 Elsevier Ltd
DBID AAYXX
CITATION
7T5
H94
DOI 10.1016/j.compeleceng.2009.03.001
DatabaseName CrossRef
Immunology Abstracts
AIDS and Cancer Research Abstracts
DatabaseTitle CrossRef
AIDS and Cancer Research Abstracts
Immunology Abstracts
DatabaseTitleList AIDS and Cancer Research Abstracts

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1879-0755
EndPage 789
ExternalDocumentID 10_1016_j_compeleceng_2009_03_001
S0045790609000317
GroupedDBID --K
--M
.DC
.~1
0R~
1B1
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABEFU
ABFNM
ABJNI
ABMAC
ABXDB
ABYKQ
ACDAQ
ACGFO
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
ADTZH
AEBSH
AECPX
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
IHE
J1W
JJJVA
KOM
LG9
LY7
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
RXW
SBC
SDF
SDG
SDP
SES
SET
SEW
SPC
SPCBC
SST
SSV
SSZ
T5K
TAE
TN5
UHS
VOH
WH7
WUQ
XPP
ZMT
~G-
~S-
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AFXIZ
AGCQF
AGQPQ
AGRNS
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
BNPGV
CITATION
SSH
7T5
H94
ID FETCH-LOGICAL-c352t-dd1f72718b08e93bb8dea5592b7f80401de18f197e751ac9bac4f0407dedd023
IEDL.DBID AIKHN
ISSN 0045-7906
IngestDate Thu Jul 10 22:57:42 EDT 2025
Tue Jul 01 01:45:45 EDT 2025
Thu Apr 24 23:09:05 EDT 2025
Fri Feb 23 02:32:45 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 5
Keywords Differentiated Services
Label Edge Router
Generalised Exponential
Head of Line
Multiprotocol Label Switching
Quality of Service
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c352t-dd1f72718b08e93bb8dea5592b7f80401de18f197e751ac9bac4f0407dedd023
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
PQID 21138828
PQPubID 23462
PageCount 26
ParticipantIDs proquest_miscellaneous_21138828
crossref_citationtrail_10_1016_j_compeleceng_2009_03_001
crossref_primary_10_1016_j_compeleceng_2009_03_001
elsevier_sciencedirect_doi_10_1016_j_compeleceng_2009_03_001
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2009-09-01
PublicationDateYYYYMMDD 2009-09-01
PublicationDate_xml – month: 09
  year: 2009
  text: 2009-09-01
  day: 01
PublicationDecade 2000
PublicationTitle Computers & electrical engineering
PublicationYear 2009
Publisher Elsevier Ltd
Publisher_xml – name: Elsevier Ltd
References Kouvatsos, Tabet-Aouvel (bib27) 1989; 27
Meier-Hellstern (bib38) 1989
Infan-Ullah, Kouvatsos (bib44) 1999
Mir Nader F. Computer and communication networks. Prentice Hall; 2006.
Kouvatsos (bib25) 1986
Fretwell R, Kouvatsos D. ATM traffic burst lengths are geometrically bounded. In: Proceedings of the 7th IFIP workshop on performance modelling and evaluation of ATM & IP networks, Antwerp, Belgium, 1999.
Kouvatsos (bib23) 1994
Rosen E, Viswanathan A, Callon R. Multiprotocol label switching architecture. IETF RFC 3031, January 2001.
Blake S, Black D, Carlson M, Davies E, Wang Z, Weiss W. An architecture for differentiated services. IETF RFC 2475, December 1998.
Davie B et al. An Expedited Forwarding PHB (Per-Hop Behavior). RFC 3246, March 2002.
Nichols K, Jacobson V, Zhang L. A two-bit differentiated services architecture for the Internet. Work in progress.
Addie R et al. Performance of a single server queue with self-similar input. In: Proc. of IEEE ICC’95; 1995. p. 461–5.
Kouvatsos Demetres. ATM Networks Perform Modell Anal 1996;2:286–323.
Quan, Chung (bib6) 2003; 57
Evans Jhon, Filsfils Clarence. Deploying DiffServ at the network edge for tight SLAs part 1 and part 2. IEEE Comput 2004;61–65, 61–70.
El-Affendi, Kouvatsos (bib42) 1983; 19
Kleninrock L. Queueing system, vols. I and II. New York: Wiley; 1975/1976.
Callon R et al. A framework for multiprotocol label switching. IETF Internet Draft, work in progress, MPLS WG, 1997.
.
Marks (bib32) 1973; 21
Filsfils, Evans (bib12) 2005
Wu J-S, Wang P-Y. The performance modelling application of SIP-T signaling system based on two-class priority queueing process in carrier class VoIP network. IEICE Trans Inform Syst 2003;E86-D(11):2271–90.
Soo, Chung (bib7) 2003; 57
Bose (bib50) 2002
Nicolas, Eric (bib14) 2000
Mayor G, Silvester J. Time scale analysis of an ATM queuing system with long-range dependent trac. In: IEEE INFOCOM; 1997. p. 205–12.
Faucher FL, Lai W. Requirements for support of DiffServ aware MPLS traffic engineering. draft-ietf-tewg-diff-te-reqts-06.txt, Internet Engineering Task Force; 2002.
Le Faucheur F et al. Multi-Protocol Label Switching (MPLS) supports of differentiated services. IETF RFC 3270, May 2002.
Takagi, Takahashi (bib48) 1991; 10
Nichols K et al. Definition of the differentiated services field (DS field) in the IPv4 and IPv6 Headers. RFC 2474, December 1998.
Pragtong, Ahmed, Erke (bib46) 2006; E89-D
Kouvatsos (bib24) 1985
queue and its application to the analysis of the load balancing in MPLS networks. In: Proceedings of the 27th annual IEEE conference on local computer networks (LCN’02); 2002. p. 1–2.
Michiel, Lavens (bib40) 1997; 85
Leland, Taqqu, Willinger, Wilson (bib41) 1994; 2
Shah-Heydari, Le-Ngoc (bib39) 2000; 15
Chakka R, Van Do T. The MM
Jaiswal (bib34) 1968
Jaynes ET. Prior probabilities. IEEE Trans Syst Sci 1975;(Cybern. 4):227–41.
David T, Harf Z. Analysis and enhancement of network solutions using geometrically batched traffic. In: Proceedings of the 19th annual UK performance; 2003.
Heinanen et al. Assured Forwarding PHB group. RFC 2597, June 1999.
Miller (bib33) 1981; 29
Jacobson V et al. An Expedited Forwarding PHB. RFC 2598, June 1999.
Kouvatsos (bib28) 1989
Chaudhry KM, Temepletion JGC. A first course in bulk queues, 1st ed. New York; 1983.
Lee, Kim (bib20) 2002
Kouvatsos (bib29) 1988; 39
Ilias, George (bib13) 1999
Choi (bib10) 1998; 145
Lee GM, Choi HK. A study of flow-based traffic admission control algorithm in the ATM-based MPLS network. In: Proc. IEEE ICIN; 2001. p. 213–8.
Bertsekas, Gallagher (bib8) 1991
Kouvatsos, Awan (bib26) 2003
10.1016/j.compeleceng.2009.03.001_bib2
Soo (10.1016/j.compeleceng.2009.03.001_bib7) 2003; 57
10.1016/j.compeleceng.2009.03.001_bib1
10.1016/j.compeleceng.2009.03.001_bib4
10.1016/j.compeleceng.2009.03.001_bib18
10.1016/j.compeleceng.2009.03.001_bib3
10.1016/j.compeleceng.2009.03.001_bib19
10.1016/j.compeleceng.2009.03.001_bib16
10.1016/j.compeleceng.2009.03.001_bib17
10.1016/j.compeleceng.2009.03.001_bib15
Filsfils (10.1016/j.compeleceng.2009.03.001_bib12) 2005
Pragtong (10.1016/j.compeleceng.2009.03.001_bib46) 2006; E89-D
Kouvatsos (10.1016/j.compeleceng.2009.03.001_bib23) 1994
Infan-Ullah (10.1016/j.compeleceng.2009.03.001_bib44) 1999
Quan (10.1016/j.compeleceng.2009.03.001_bib6) 2003; 57
10.1016/j.compeleceng.2009.03.001_bib11
10.1016/j.compeleceng.2009.03.001_bib9
Shah-Heydari (10.1016/j.compeleceng.2009.03.001_bib39) 2000; 15
Lee (10.1016/j.compeleceng.2009.03.001_bib20) 2002
Kouvatsos (10.1016/j.compeleceng.2009.03.001_bib26) 2003
10.1016/j.compeleceng.2009.03.001_bib5
Bertsekas (10.1016/j.compeleceng.2009.03.001_bib8) 1991
10.1016/j.compeleceng.2009.03.001_bib49
10.1016/j.compeleceng.2009.03.001_bib47
Bose (10.1016/j.compeleceng.2009.03.001_bib50) 2002
10.1016/j.compeleceng.2009.03.001_bib45
10.1016/j.compeleceng.2009.03.001_bib43
Michiel (10.1016/j.compeleceng.2009.03.001_bib40) 1997; 85
Nicolas (10.1016/j.compeleceng.2009.03.001_bib14) 2000
Choi (10.1016/j.compeleceng.2009.03.001_bib10) 1998; 145
Kouvatsos (10.1016/j.compeleceng.2009.03.001_bib24) 1985
10.1016/j.compeleceng.2009.03.001_bib36
10.1016/j.compeleceng.2009.03.001_bib37
10.1016/j.compeleceng.2009.03.001_bib35
10.1016/j.compeleceng.2009.03.001_bib30
10.1016/j.compeleceng.2009.03.001_bib31
Leland (10.1016/j.compeleceng.2009.03.001_bib41) 1994; 2
Kouvatsos (10.1016/j.compeleceng.2009.03.001_bib28) 1989
Takagi (10.1016/j.compeleceng.2009.03.001_bib48) 1991; 10
Kouvatsos (10.1016/j.compeleceng.2009.03.001_bib29) 1988; 39
Kouvatsos (10.1016/j.compeleceng.2009.03.001_bib25) 1986
Jaiswal (10.1016/j.compeleceng.2009.03.001_bib34) 1968
Marks (10.1016/j.compeleceng.2009.03.001_bib32) 1973; 21
10.1016/j.compeleceng.2009.03.001_bib21
10.1016/j.compeleceng.2009.03.001_bib22
Miller (10.1016/j.compeleceng.2009.03.001_bib33) 1981; 29
El-Affendi (10.1016/j.compeleceng.2009.03.001_bib42) 1983; 19
Ilias (10.1016/j.compeleceng.2009.03.001_bib13) 1999
Kouvatsos (10.1016/j.compeleceng.2009.03.001_bib27) 1989; 27
Meier-Hellstern (10.1016/j.compeleceng.2009.03.001_bib38) 1989
References_xml – reference: Blake S, Black D, Carlson M, Davies E, Wang Z, Weiss W. An architecture for differentiated services. IETF RFC 2475, December 1998.
– start-page: 191
  year: 2003
  end-page: 227
  ident: bib26
  article-title: Entropy maximization and open queueing network with priorities and blocking
  publication-title: Perform Evaluat
– start-page: 169
  year: 1989
  end-page: 195
  ident: bib28
  article-title: MEM for arbitrary queueing networks with multiple general severs and repetitive-service blocking
  publication-title: Perform Eval
– start-page: 497
  year: 1999
  end-page: 521
  ident: bib44
  article-title: Approximate analysis of arbitrary QNMs with space and service priorities
  publication-title: Perform Anal ATM Networks
– volume: 15
  start-page: 273
  year: 2000
  end-page: 293
  ident: bib39
  article-title: MMPP models for multimedia traffic
  publication-title: Telecommun Syst
– start-page: 63
  year: 1994
  end-page: 126
  ident: bib23
  article-title: Entropy maximization and queueing network models
  publication-title: Ann Operat Res
– reference: Evans Jhon, Filsfils Clarence. Deploying DiffServ at the network edge for tight SLAs part 1 and part 2. IEEE Comput 2004;61–65, 61–70.
– reference: Nichols K et al. Definition of the differentiated services field (DS field) in the IPv4 and IPv6 Headers. RFC 2474, December 1998.
– reference: Chaudhry KM, Temepletion JGC. A first course in bulk queues, 1st ed. New York; 1983.
– reference: Heinanen et al. Assured Forwarding PHB group. RFC 2597, June 1999.
– volume: 85
  start-page: 2007
  year: 1997
  end-page: 2033
  ident: bib40
  article-title: Teletraffic engineering in a broad-band era
  publication-title: Proc IEEE
– volume: 39
  start-page: 183
  year: 1988
  end-page: 200
  ident: bib29
  article-title: A maximum entropy analysis of the
  publication-title: J Opl Soc
– reference: Le Faucheur F et al. Multi-Protocol Label Switching (MPLS) supports of differentiated services. IETF RFC 3270, May 2002.
– reference: David T, Harf Z. Analysis and enhancement of network solutions using geometrically batched traffic. In: Proceedings of the 19th annual UK performance; 2003.
– start-page: 113
  year: 1986
  end-page: 124
  ident: bib25
  article-title: A universal maximum entropy algorithm for the analysis of general closed network
  publication-title: Comput Networks Perform Eval
– reference: Callon R et al. A framework for multiprotocol label switching. IETF Internet Draft, work in progress, MPLS WG, 1997.
– reference: Davie B et al. An Expedited Forwarding PHB (Per-Hop Behavior). RFC 3246, March 2002.
– volume: 21
  start-page: 974
  year: 1973
  end-page: 987
  ident: bib32
  article-title: State probabilities of
  publication-title: Operat Res
– reference: Mir Nader F. Computer and communication networks. Prentice Hall; 2006.
– year: 2005
  ident: bib12
  article-title: Deploying DiffServ in backbone networks for tight SLA control
– start-page: 367
  year: 1989
  end-page: 372
  ident: bib38
  article-title: The analysis of a queue arising in overflow models
  publication-title: IEEE Trans Commun
– volume: E89-D
  start-page: 2886
  year: 2006
  end-page: 2896
  ident: bib46
  article-title: Analysis and modelling of voice over IP traffic in the real network
  publication-title: IEICE Trans Inform Syst
– year: 1999
  ident: bib13
  article-title: Supporting differentiated services in MPLS networks
– year: 2002
  ident: bib20
  article-title: Implementing of a MPLS router supporting DiffServ for QoS and high-speed switching
– reference: -queue and its application to the analysis of the load balancing in MPLS networks. In: Proceedings of the 27th annual IEEE conference on local computer networks (LCN’02); 2002. p. 1–2.
– reference: Addie R et al. Performance of a single server queue with self-similar input. In: Proc. of IEEE ICC’95; 1995. p. 461–5.
– volume: 145
  start-page: 152
  year: 1998
  end-page: 158
  ident: bib10
  article-title: Priority queue with two-state Markov-modulated arrivals
  publication-title: IEE Proc Commun
– reference: .
– reference: Faucher FL, Lai W. Requirements for support of DiffServ aware MPLS traffic engineering. draft-ietf-tewg-diff-te-reqts-06.txt, Internet Engineering Task Force; 2002.
– volume: 29
  start-page: 945
  year: 1981
  end-page: 958
  ident: bib33
  article-title: Computation of steady-state probabilities for
  publication-title: Operat Res
– volume: 27
  start-page: 247
  year: 1989
  end-page: 286
  ident: bib27
  article-title: A maximum entropy priority approximation for a stable
  publication-title: Acta Inform
– reference: Kouvatsos Demetres. ATM Networks Perform Modell Anal 1996;2:286–323.
– volume: 57
  start-page: 409
  year: 2003
  end-page: 414
  ident: bib7
  article-title: Analysis of non-preemptive priority queueing of DiffServ networks with bulk arrivals
  publication-title: Int J Commun (AEU)
– year: 2002
  ident: bib50
  article-title: An introduction to queueing system
– reference: Fretwell R, Kouvatsos D. ATM traffic burst lengths are geometrically bounded. In: Proceedings of the 7th IFIP workshop on performance modelling and evaluation of ATM & IP networks, Antwerp, Belgium, 1999.
– year: 1968
  ident: bib34
  article-title: Priority queue
– year: 1991
  ident: bib8
  article-title: Data network
– year: 2000
  ident: bib14
  article-title: Differentiated services and integrated services use of MPLS
– volume: 2
  start-page: 1
  year: 1994
  end-page: 15
  ident: bib41
  article-title: On the self-similar nature of Ethernet traffic (extended version)
  publication-title: IEEE/ACM Trans Networking
– reference: Rosen E, Viswanathan A, Callon R. Multiprotocol label switching architecture. IETF RFC 3031, January 2001.
– volume: 57
  start-page: 338
  year: 2003
  end-page: 340
  ident: bib6
  article-title: Queue length analysis of non-preemptive DiffServ networks
  publication-title: Int J Electron Commun (AEU)
– volume: 19
  start-page: 339
  year: 1983
  end-page: 355
  ident: bib42
  article-title: A maximum entropy analysis of the
  publication-title: Acta Inform
– reference: Chakka R, Van Do T. The MM
– reference: Wu J-S, Wang P-Y. The performance modelling application of SIP-T signaling system based on two-class priority queueing process in carrier class VoIP network. IEICE Trans Inform Syst 2003;E86-D(11):2271–90.
– reference: Nichols K, Jacobson V, Zhang L. A two-bit differentiated services architecture for the Internet. Work in progress.
– reference: Kleninrock L. Queueing system, vols. I and II. New York: Wiley; 1975/1976.
– reference: Jaynes ET. Prior probabilities. IEEE Trans Syst Sci 1975;(Cybern. 4):227–41.
– volume: 10
  start-page: 225
  year: 1991
  end-page: 232
  ident: bib48
  article-title: Priority queues with batch Poisson arrivals
  publication-title: Operat Res Lett
– reference: Mayor G, Silvester J. Time scale analysis of an ATM queuing system with long-range dependent trac. In: IEEE INFOCOM; 1997. p. 205–12.
– reference: Jacobson V et al. An Expedited Forwarding PHB. RFC 2598, June 1999.
– start-page: 589
  year: 1985
  end-page: 609
  ident: bib24
  article-title: Maximum entropy methods for general queueing networks
  publication-title: Modell Technol Tools Perform Anal
– reference: Lee GM, Choi HK. A study of flow-based traffic admission control algorithm in the ATM-based MPLS network. In: Proc. IEEE ICIN; 2001. p. 213–8.
– year: 2002
  ident: 10.1016/j.compeleceng.2009.03.001_bib50
– volume: 57
  start-page: 338
  issue: 5
  year: 2003
  ident: 10.1016/j.compeleceng.2009.03.001_bib6
  article-title: Queue length analysis of non-preemptive DiffServ networks
  publication-title: Int J Electron Commun (AEU)
  doi: 10.1078/1434-8411-54100181
– volume: 15
  start-page: 273
  issue: 3–4
  year: 2000
  ident: 10.1016/j.compeleceng.2009.03.001_bib39
  article-title: MMPP models for multimedia traffic
  publication-title: Telecommun Syst
  doi: 10.1023/A:1019199013546
– start-page: 589
  year: 1985
  ident: 10.1016/j.compeleceng.2009.03.001_bib24
  article-title: Maximum entropy methods for general queueing networks
  publication-title: Modell Technol Tools Perform Anal
– ident: 10.1016/j.compeleceng.2009.03.001_bib36
– year: 1968
  ident: 10.1016/j.compeleceng.2009.03.001_bib34
– volume: 57
  start-page: 409
  issue: 6
  year: 2003
  ident: 10.1016/j.compeleceng.2009.03.001_bib7
  article-title: Analysis of non-preemptive priority queueing of DiffServ networks with bulk arrivals
  publication-title: Int J Commun (AEU)
  doi: 10.1078/1434-8411-54100193
– volume: 2
  start-page: 1
  year: 1994
  ident: 10.1016/j.compeleceng.2009.03.001_bib41
  article-title: On the self-similar nature of Ethernet traffic (extended version)
  publication-title: IEEE/ACM Trans Networking
  doi: 10.1109/90.282603
– volume: 21
  start-page: 974
  year: 1973
  ident: 10.1016/j.compeleceng.2009.03.001_bib32
  article-title: State probabilities of M/M/1 priority queues
  publication-title: Operat Res
  doi: 10.1287/opre.21.4.974
– volume: 10
  start-page: 225
  year: 1991
  ident: 10.1016/j.compeleceng.2009.03.001_bib48
  article-title: Priority queues with batch Poisson arrivals
  publication-title: Operat Res Lett
  doi: 10.1016/0167-6377(91)90063-U
– ident: 10.1016/j.compeleceng.2009.03.001_bib35
– volume: 39
  start-page: 183
  year: 1988
  ident: 10.1016/j.compeleceng.2009.03.001_bib29
  article-title: A maximum entropy analysis of the G/G/1 queue at equilibrium
  publication-title: J Opl Soc
  doi: 10.1057/jors.1988.30
– ident: 10.1016/j.compeleceng.2009.03.001_bib16
  doi: 10.17487/rfc2597
– start-page: 63
  year: 1994
  ident: 10.1016/j.compeleceng.2009.03.001_bib23
  article-title: Entropy maximization and queueing network models
  publication-title: Ann Operat Res
  doi: 10.1007/BF02023095
– ident: 10.1016/j.compeleceng.2009.03.001_bib31
– volume: 145
  start-page: 152
  year: 1998
  ident: 10.1016/j.compeleceng.2009.03.001_bib10
  article-title: Priority queue with two-state Markov-modulated arrivals
  publication-title: IEE Proc Commun
  doi: 10.1049/ip-com:19982077
– year: 2000
  ident: 10.1016/j.compeleceng.2009.03.001_bib14
– ident: 10.1016/j.compeleceng.2009.03.001_bib4
  doi: 10.17487/rfc3270
– ident: 10.1016/j.compeleceng.2009.03.001_bib17
  doi: 10.17487/rfc2474
– volume: 19
  start-page: 339
  year: 1983
  ident: 10.1016/j.compeleceng.2009.03.001_bib42
  article-title: A maximum entropy analysis of the M/G/1 and G/M/1 queueing system at equilibrium
  publication-title: Acta Inform
  doi: 10.1007/BF00290731
– ident: 10.1016/j.compeleceng.2009.03.001_bib49
– year: 1999
  ident: 10.1016/j.compeleceng.2009.03.001_bib13
– ident: 10.1016/j.compeleceng.2009.03.001_bib45
– ident: 10.1016/j.compeleceng.2009.03.001_bib19
– start-page: 113
  year: 1986
  ident: 10.1016/j.compeleceng.2009.03.001_bib25
  article-title: A universal maximum entropy algorithm for the analysis of general closed network
  publication-title: Comput Networks Perform Eval
– ident: 10.1016/j.compeleceng.2009.03.001_bib21
– ident: 10.1016/j.compeleceng.2009.03.001_bib30
  doi: 10.1007/978-0-387-35068-4
– start-page: 367
  year: 1989
  ident: 10.1016/j.compeleceng.2009.03.001_bib38
  article-title: The analysis of a queue arising in overflow models
  publication-title: IEEE Trans Commun
  doi: 10.1109/26.20117
– start-page: 191
  year: 2003
  ident: 10.1016/j.compeleceng.2009.03.001_bib26
  article-title: Entropy maximization and open queueing network with priorities and blocking
  publication-title: Perform Evaluat
  doi: 10.1016/S0166-5316(02)00092-5
– ident: 10.1016/j.compeleceng.2009.03.001_bib18
  doi: 10.17487/rfc3246
– year: 2002
  ident: 10.1016/j.compeleceng.2009.03.001_bib20
– ident: 10.1016/j.compeleceng.2009.03.001_bib1
– ident: 10.1016/j.compeleceng.2009.03.001_bib3
  doi: 10.17487/rfc2475
– volume: E89-D
  start-page: 2886
  year: 2006
  ident: 10.1016/j.compeleceng.2009.03.001_bib46
  article-title: Analysis and modelling of voice over IP traffic in the real network
  publication-title: IEICE Trans Inform Syst
  doi: 10.1093/ietisy/e89-d.12.2886
– start-page: 169
  year: 1989
  ident: 10.1016/j.compeleceng.2009.03.001_bib28
  article-title: MEM for arbitrary queueing networks with multiple general severs and repetitive-service blocking
  publication-title: Perform Eval
  doi: 10.1016/0166-5316(89)90009-6
– ident: 10.1016/j.compeleceng.2009.03.001_bib2
  doi: 10.17487/rfc3031
– ident: 10.1016/j.compeleceng.2009.03.001_bib15
  doi: 10.17487/rfc2598
– ident: 10.1016/j.compeleceng.2009.03.001_bib22
– ident: 10.1016/j.compeleceng.2009.03.001_bib37
– ident: 10.1016/j.compeleceng.2009.03.001_bib5
– volume: 27
  start-page: 247
  year: 1989
  ident: 10.1016/j.compeleceng.2009.03.001_bib27
  article-title: A maximum entropy priority approximation for a stable G/G/1 queue
  publication-title: Acta Inform
  doi: 10.1007/BF00572990
– volume: 29
  start-page: 945
  year: 1981
  ident: 10.1016/j.compeleceng.2009.03.001_bib33
  article-title: Computation of steady-state probabilities for M/M/1 priority queues
  publication-title: Operat Res
  doi: 10.1287/opre.29.5.945
– ident: 10.1016/j.compeleceng.2009.03.001_bib9
– start-page: 497
  year: 1999
  ident: 10.1016/j.compeleceng.2009.03.001_bib44
  article-title: Approximate analysis of arbitrary QNMs with space and service priorities
  publication-title: Perform Anal ATM Networks
– ident: 10.1016/j.compeleceng.2009.03.001_bib11
  doi: 10.1109/MIC.2004.1260705
– year: 1991
  ident: 10.1016/j.compeleceng.2009.03.001_bib8
– year: 2005
  ident: 10.1016/j.compeleceng.2009.03.001_bib12
– ident: 10.1016/j.compeleceng.2009.03.001_bib43
  doi: 10.1109/TSSC.1968.300117
– volume: 85
  start-page: 2007
  issue: 12
  year: 1997
  ident: 10.1016/j.compeleceng.2009.03.001_bib40
  article-title: Teletraffic engineering in a broad-band era
  publication-title: Proc IEEE
  doi: 10.1109/5.650182
– ident: 10.1016/j.compeleceng.2009.03.001_bib47
SSID ssj0004618
Score 1.8221325
Snippet M X / G / 1 non-preemptive priority queue with bulk arrivals has already been analysed in many papers. Two problems are known in this area: first, when the...
M super()XG/1 non-preemptive priority queue with bulk arrivals has already been analysed in many papers. Two problems are known in this area: first, when the...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 764
SubjectTerms Differentiated Services
Generalised Exponential
Head of Line
Label Edge Router
Multiprotocol Label Switching
Quality of Service
Title Performance analysis of non-preemptive GE/G/1 priority queueing of LER system with bulk arrivals
URI https://dx.doi.org/10.1016/j.compeleceng.2009.03.001
https://www.proquest.com/docview/21138828
Volume 35
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED-mA9EH8RO_jeBrXbN2bQK-iGzOD4aIgm-1aRKZzq3U7dW_3Tub6hQEwdfSNOFyubtfc_c7gEPRjBFz-cprRQYBSibpfjeUnlKZzSxXVF9C2Ra9qHsXXty37mtwWtXCUFqls_2lTf-w1u5Jw0mzkff7VOMbtmLpRz71vUQ3OAP1ZiAjVO36yflltzdVHslLgxwSO6MfzcHBV5oXZW5TxxkzfHTslUR5yn9zUz8M9ocX6izBogsf2Um5wmWomeEKLEyRCq7Cw_VXLQBLHecIG1mGQN_LC2NecjJx7KzdOGtwlhf9ETWwYzjfxOAX6NWr9g0rOZ4Z_ahlajJ4ZmlR9FEvX9fgttO-Pe16ro-Cl2F4Nfa05hbDFC6UL4wMlBLapIgkmiq2Ag8x14YLy2Vs4hZPM6nSLLT4PNZGa_Tp6zCLKzQbwGSM_gwhXGjjMFRCKC0C42uFIBOla8UmiEpqSeY4xqnVxSCpksmekimBUw9MmfgBJdZtQvNzaF4Sbfxl0HG1Nck3rUnQIfxl-H61nQmeKroqSYdmNHlNEBYHiD3E1v8m2Ib58vaJctJ2YHZcTMwuBjFjtQczR298z6nqO_li84A
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFD54AS8P4hXvi-BrXbNlawq-iEynThGZsLfYNInMy1bq9upv95y1dVMQBr6WpgknOZevOec7AMeyEiDm8rVXq1sEKHFI97si9LSOXey4pvoSyra4qzcfxXWn1pmB86IWhtIqc9uf2fSRtc6flHNplpNul2p8RS0I_bpPfS_RDc7CvED1Je08-eQTxZE8M8eCuBn9-gIcjZO8KG-b-s3Y3nPOXUmEp_wvJ_XLXI980MUqrOTBIzvL1rcGM7a3DssTlIIb8HQ_rgRgUc44wvqOIcz3ktTa94QMHLtslC_LnCVpt0_t6xjON7T4BXq11XhgGcMzo9-0TA_fXlmUpl08lR-b0L5otM-bXt5FwYsxuBp4xnCHQQqX2pc2rGotjY0QR1R04CSqMDeWS8fDwAY1HsWhjmLh8HlgrDHo0bdgDldot4GFAXozBHDCBUJoKbWRVesbjRATpevkDshCairOGcap0cWbKlLJXtSEwKkDZqj8KqXV7UDle2iS0WxMM-i02Br148wodAfTDC8V26lQp-iiJOrZ_vBDISiuIvKQu_-boASLzfZtS7Wu7m72YCm7h6LstH2YG6RDe4DhzEAfjo7rF_kl9EQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Performance+analysis+of+non-preemptive+GE%2FG%2F1+priority+queueing+of+LER+system+with+bulk+arrivals&rft.jtitle=Computers+%26+electrical+engineering&rft.au=Chen%2C+Yunlung&rft.au=Chen%2C+Chienhua&rft.date=2009-09-01&rft.pub=Elsevier+Ltd&rft.issn=0045-7906&rft.eissn=1879-0755&rft.volume=35&rft.issue=5&rft.spage=764&rft.epage=789&rft_id=info:doi/10.1016%2Fj.compeleceng.2009.03.001&rft.externalDocID=S0045790609000317
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0045-7906&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0045-7906&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0045-7906&client=summon