1```
2% pandoc -f biblatex -t markdown -s
3@comment{excerpt from http://mirrors.ctan.org/macros/latex/contrib/biblatex/doc/examples/biblatex-examples.bib
4
5TODO: Where to map "file" field?
6}
7
8@report{chiu,
9	Annotation = {This is a report entry for a research report. Note the format of the type field in the database file which uses a localization key. The number of the report is given in the number field. Also note the sorttitle and indextitle fields},
10	Author = {Chiu, Willy W. and Chow, We Min},
11	Date = 1978,
12	Hyphenation = {american},
13	Indextitle = {Hybrid Hierarchical Model, A},
14	Institution = {IBM},
15	Number = {RC-6947},
16	Sorttitle = {Hybrid Hierarchical Model of a Multiple Virtual Storage (MVS) Operating System},
17	Title = {A Hybrid Hierarchical Model of a {Multiple Virtual Storage} ({MVS}) Operating System},
18	Type = {resreport}}
19
20@report{padhye,
21	Annotation = {This is a report entry for a technical report. Note the format of the type field in the database file which uses a localization key. The number of the report is given in the number field. Also note the sorttitle and indextitle fields},
22	Author = {Padhye, Jitendra and Firoiu, Victor and Towsley, Don},
23	Date = 1999,
24	File = {ftp://gaia.cs.umass.edu/pub/Padhey99-markov.ps},
25	Hyphenation = {american},
26	Indextitle = {Stochastic Model of TCP Reno Congestion Avoidance and Control, A},
27	Institution = {University of Massachusetts},
28	Location = {Amherst, Mass.},
29	Number = {99-02},
30	Sorttitle = {A Stochastic Model of TCP Reno Congestion Avoidance and Control},
31	Title = {A Stochastic Model of {TCP Reno} Congestion Avoidance and Control},
32	Type = {techreport},
33	Abstract = {The steady state performance of a bulk transfer TCP flow
34                  (i.e., a flow with a large amount of data to send, such as FTP
35                  transfers) may be characterized by three quantities. The first
36                  is the send rate, which is the amount of data sent by the
37                  sender in unit time. The second is the throughput, which is
38                  the amount of data received by the receiver in unit time. Note
39                  that the throughput will always be less than or equal to the
40                  send rate due to losses. Finally, the number of non-duplicate
41                  packets received by the receiver in unit time gives us the
42                  goodput of the connection. The goodput is always less than or
43                  equal to the throughput, since the receiver may receive two
44                  copies of the same packet due to retransmissions by the
45                  sender. In a previous paper, we presented a simple model for
46                  predicting the steady state send rate of a bulk transfer TCP
47                  flow as a function of loss rate and round trip time. In this
48                  paper, we extend that work in two ways. First, we analyze the
49                  performance of bulk transfer TCP flows using more precise,
50                  stochastic analysis. Second, we build upon the previous
51                  analysis to provide both an approximate formula as well as a
52                  more accurate stochastic model for the steady state throughput
53                  of a bulk transfer TCP flow.}}
54^D
55---
56nocite: "[@*]"
57references:
58- annote: This is a report entry for a research report. Note the format
59    of the type field in the database file which uses a localization
60    key. The number of the report is given in the number field. Also
61    note the sorttitle and indextitle fields
62  author:
63  - family: Chiu
64    given: Willy W.
65  - family: Chow
66    given: We Min
67  genre: research report
68  id: chiu
69  issued: 1978
70  language: en-US
71  number: RC-6947
72  publisher: IBM
73  title: A hybrid hierarchical model of a Multiple Virtual Storage (MVS)
74    operating system
75  type: report
76- abstract: The steady state performance of a bulk transfer TCP flow
77    (i.e., a flow with a large amount of data to send, such as FTP
78    transfers) may be characterized by three quantities. The first is
79    the send rate, which is the amount of data sent by the sender in
80    unit time. The second is the throughput, which is the amount of data
81    received by the receiver in unit time. Note that the throughput will
82    always be less than or equal to the send rate due to losses.
83    Finally, the number of non-duplicate packets received by the
84    receiver in unit time gives us the goodput of the connection. The
85    goodput is always less than or equal to the throughput, since the
86    receiver may receive two copies of the same packet due to
87    retransmissions by the sender. In a previous paper, we presented a
88    simple model for predicting the steady state send rate of a bulk
89    transfer TCP flow as a function of loss rate and round trip time. In
90    this paper, we extend that work in two ways. First, we analyze the
91    performance of bulk transfer TCP flows using more precise,
92    stochastic analysis. Second, we build upon the previous analysis to
93    provide both an approximate formula as well as a more accurate
94    stochastic model for the steady state throughput of a bulk transfer
95    TCP flow.
96  annote: This is a report entry for a technical report. Note the format
97    of the type field in the database file which uses a localization
98    key. The number of the report is given in the number field. Also
99    note the sorttitle and indextitle fields
100  author:
101  - family: Padhye
102    given: Jitendra
103  - family: Firoiu
104    given: Victor
105  - family: Towsley
106    given: Don
107  genre: technical report
108  id: padhye
109  issued: 1999
110  language: en-US
111  number: 99-02
112  publisher: University of Massachusetts
113  publisher-place: Amherst, Mass.
114  title: A stochastic model of TCP Reno congestion avoidance and control
115  type: report
116---
117
118
119```
120