Last update: Fri Jan 5 02:05:58 MST 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Bisdikian:1993:QMA,
author = "C. Bisdikian",
title = "A queueing model with applications to bridges and the
{DQDB} ({IEEE} 802.6) {MAN}",
journal = j-COMP-NET-ISDN,
volume = "25",
number = "12",
pages = "1279--1289",
month = jul,
year = "1993",
CODEN = "CNISE9",
ISSN = "0169-7552 (print), 1879-2324 (electronic)",
ISSN-L = "0169-7552",
bibdate = "Sat Sep 25 15:30:02 1999",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1993.bib;
http://www.math.utah.edu/pub/tex/bib/compnetisdn.bib",
acknowledgement = ack-nhfb,
annote = "We introduce a single-server queueing system with two
classes of customers and state-dependent priorities.
The priority queueing system serves as a model with
several applications in communication networks. It may
apply to network nodes that generate traffic with
different access priorities to the network, e.g.,
bridged nodes that have to carry both internetwork and
locally generated traffic.",
country = "NL",
date = "00/00/00",
descriptors = "DQDB; queueing system; priority; performance
evaluation; IEEE 802.6",
enum = "7257",
journal-URL = "http://www.sciencedirect.com/science/journal/01697552",
language = "English",
location = "UniS-IND; UniS-IND-MAC_C",
references = "17",
revision = "30/05/94",
}
Related entries
- apply,
20(1)15
- Bisdikian, C.,
24(5)367
- both,
10(3)211,
21(3)149,
26(3)253,
27(2)205,
29(5)555
- bridge,
10(5)259,
12(2)81,
13(4)323,
17(2)149,
18(z)243,
22(4)265,
24(1)45,
30(1)669
- carry,
26(3)253
- class,
11(z)277,
14(2)305,
28(6)855,
28(7)941,
30(20)1897
- customer,
26(4)447,
26(11)1409,
29(5)595
- dependent, state-,
27(1)45
- different,
10(5)245,
18(1)31,
18(5)335,
18(z)243,
20(1)189,
25(4)454,
26(3)253,
28(6)799
- DQDB,
24(2)145,
24(2)153,
24(5)367,
25(10)1107,
25(10)1119,
25(11)1177,
26(6)679,
26(6)695,
26(12)1503,
27(5)653,
27(7)1137,
30(11)1013
- e.g.,
28(7)1445
- generated,
10(3)185
- have,
12(2)89,
17(2)101,
18(z)243,
26(z)z-1,
27(6)1009,
28(7)1445,
30(1)225,
30(24)2293
- internetwork,
11(1)43,
22(5)363,
23(1)57,
28(6)855
- introduce,
25(10)1119
- MAN,
25(10)1107,
25(10)1119,
26(2)163,
28(4)583
- may,
26(3)269,
27(6)1009,
28(7)1445
- model,
9(3)175,
10(3)135,
10(3)157,
10(3)185,
10(3)195,
10(3)221,
11(2)111,
11(z)277,
13(4)269,
14(2)231,
16(1)31,
16(4)299,
18(z)243,
20(1)7,
20(1)171,
20(1)189,
22(3)193,
24(1)33,
24(1)81,
25(4)454,
25(10)1107,
25(10)1155,
25(10)1165,
25(11)1177,
26(4)391,
26(5)493,
27(5)653,
27(6)751,
27(6)831,
27(6)1055,
27(7)1193,
27(8)1211,
27(8)1215,
27(8)1247,
27(8)1263,
27(8)1287,
27(8)1305,
28(5)689,
28(7)1095,
28(7)1105,
28(7)1445,
29(3)373,
29(4)501,
29(6)617,
29(7)745,
29(14)1675,
29(14)1727,
30(9)925,
30(14)1327
- node,
9(5)353,
11(z)287,
12(5)291,
17(2)127,
21(2)109,
25(10)1107,
26(6)695
- priority,
12(2)89,
25(10)1065,
26(1)95,
28(3)411,
28(5)653,
29(17)2153
- queueing,
9(3)191,
10(2)111,
11(2)111,
12(2)89,
15(1)1,
15(5)359,
20(1)425,
24(4)311,
25(10)1107,
26(6)799,
26(12)1503,
28(6)835
- several,
10(3)211,
20(1)351,
20(1)425,
24(2)153,
28(13)1723,
z(z)207
- state-dependent,
27(1)45
- two,
12(1)1,
17(3)201,
21(3)149,
23(4)267,
25(10)1089,
25(11)1205,
26(6)1023,
27(2)205,
27(11)1545,
28(13)1723,
29(7)759,
29(14)1661