1
0
Fork 0
You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
bc_thesis/en/bibliography.bib

439 lines
17 KiB
BibTeX

%
% An example of a bibliographical database for bibTeX
%
% Recommended software for maintenance of *.bib files:
% JabRef, http://jabref.sourceforge.net/
%
% BEWARE:
%
% * If a name contains a capital letter, which must be kept such,
% use curly brackets ({T}hailand, {HIV}).
%
% ===========================================================================
@MISC{rfc5838,
shorthand = {{RFC5838}},
series = {Request for Comments},
number = 5838,
howpublished = {RFC 5838},
publisher = {RFC Editor},
doi = {10.17487/RFC5838},
url = {https://www.rfc-editor.org/info/rfc5838},
author = {Michael Barnes and Sina Mirtorabi and Rahul Aggarwal and Abhay Roy and Acee Lindem},
title = {{Support of Address Families in OSPFv3}},
pagetotal = 13,
year = 2010,
month = apr,
abstract = {This document describes a mechanism for supporting multiple address families (AFs) in OSPFv3 using multiple instances. It maps an AF to an OSPFv3 instance using the Instance ID field in the OSPFv3 packet header. This approach is fairly simple and minimizes extensions to OSPFv3 for supporting multiple AFs. {[}STANDARDS-TRACK{]}},
}
@misc{rfc8042,
series = {Request for Comments},
number = 8042,
howpublished = {RFC 8042},
publisher = {RFC Editor},
doi = {10.17487/RFC8042},
url = {https://www.rfc-editor.org/info/rfc8042},
author = {Zhaohui (Jeffrey) Zhang and Lili Wang and Acee Lindem},
title = {{OSPF Two-Part Metric}},
pagetotal = 9,
year = 2016,
month = dec,
abstract = {This document specifies an optional OSPF protocol extension to represent router metrics in a multi-access network in two parts: the metric from the router to the network and the metric from the network to the router. For such networks, the router-to-router metric for OSPF route computation is the sum of the two parts. This document updates RFC 2328.},
}
@misc{rfc6919,
series = {Request for Comments},
number = 6919,
howpublished = {RFC 6919},
publisher = {RFC Editor},
doi = {10.17487/RFC6919},
url = {https://www.rfc-editor.org/info/rfc6919},
author = {Eric Rescorla and Richard Barnes and Stephen Kent},
title = {{Further Key Words for Use in RFCs to Indicate Requirement Levels}},
pagetotal = 6,
year = 2013,
month = apr,
day = 1,
abstract = {RFC 2119 defines a standard set of key words for describing requirements of a specification. Many IETF documents have found that these words cannot accurately capture the nuanced requirements of their specification. This document defines additional key words that can be used to address alternative requirements scenarios. Authors who follow these guidelines should incorporate this phrase near the beginning of their document: The key words "MUST (BUT WE KNOW YOU WON\textbackslash{}'T)", "SHOULD CONSIDER", "REALLY SHOULD NOT", "OUGHT TO", "WOULD PROBABLY", "MAY WISH TO", "COULD", "POSSIBLE", and "MIGHT" in this document are to be interpreted as described in RFC 6919.},
}
@misc{rfc2328,
series = {Request for Comments},
number = 2328,
howpublished = {RFC 2328},
publisher = {RFC Editor},
doi = {10.17487/RFC2328},
url = {https://www.rfc-editor.org/info/rfc2328},
author = {John Moy},
title = {{OSPF Version 2}},
pagetotal = 244,
year = 1998,
month = apr,
day = 1,
abstract = {This memo documents version 2 of the OSPF protocol. OSPF is a link- state routing protocol. {[}STANDARDS-TRACK{]}},
}
@misc{rfc3101,
series = {Request for Comments},
number = 3101,
howpublished = {RFC 3101},
publisher = {RFC Editor},
doi = {10.17487/RFC3101},
url = {https://www.rfc-editor.org/info/rfc3101},
author = {Dr. Patrick W. Murphy},
title = {{The OSPF Not-So-Stubby Area (NSSA) Option}},
pagetotal = 33,
year = 2003,
month = jan,
abstract = {This memo documents an optional type of Open Shortest Path First (OSPF) area that is somewhat humorously referred to as a "not-so-stubby" area (or NSSA). NSSAs are similar to the existing OSPF stub area configuration option but have the additional capability of importing AS external routes in a limited fashion. The OSPF NSSA Option was originally defined in RFC 1587. The functional differences between this memo and RFC 1587 are explained in Appendix F. All differences, while expanding capability, are backward-compatible in nature. Implementations of this memo and of RFC 1587 will interoperate. {[}STANDARDS-TRACK{]}},
}
@misc{rfc6549,
series = {Request for Comments},
number = 6549,
howpublished = {RFC 6549},
publisher = {RFC Editor},
doi = {10.17487/RFC6549},
url = {https://www.rfc-editor.org/info/rfc6549},
author = {Acee Lindem and Abhay Roy and Sina Mirtorabi},
title = {{OSPFv2 Multi-Instance Extensions}},
pagetotal = 9,
year = 2012,
month = mar,
abstract = {OSPFv3 includes a mechanism to support multiple instances of the protocol running on the same interface. OSPFv2 can utilize such a mechanism in order to support multiple routing domains on the same subnet. This document defines the OSPFv2 Instance ID to enable separate OSPFv2 protocol instances on the same interface. Unlike OSPFv3 where the Instance ID can be used for multiple purposes, such as putting the same interface in multiple areas, the OSPFv2 Instance ID is reserved for identifying protocol instances. This document updates RFC 2328. {[}STANDARDS-TRACK{]}},
}
@misc{rfc5709,
series = {Request for Comments},
number = 5709,
howpublished = {RFC 5709},
publisher = {RFC Editor},
doi = {10.17487/RFC5709},
url = {https://www.rfc-editor.org/info/rfc5709},
author = {M Fanto and Randall Atkinson and Michael Barnes and Vishwas Manral and Russ White and Tony Li and Manav Bhatia},
title = {{OSPFv2 HMAC-SHA Cryptographic Authentication}},
pagetotal = 14,
year = 2009,
month = oct,
abstract = {This document describes how the National Institute of Standards and Technology (NIST) Secure Hash Standard family of algorithms can be used with OSPF version 2's built-in, cryptographic authentication mechanism. This updates, but does not supercede, the cryptographic authentication mechanism specified in RFC 2328. {[}STANDARDS-TRACK{]}},
}
@misc{rfc5340,
series = {Request for Comments},
number = 5340,
howpublished = {RFC 5340},
publisher = {RFC Editor},
doi = {10.17487/RFC5340},
url = {https://www.rfc-editor.org/info/rfc5340},
author = {Dennis Ferguson and Acee Lindem and John Moy},
title = {{OSPF for IPv6}},
pagetotal = 94,
year = 2008,
month = jul,
abstract = {This document describes the modifications to OSPF to support version 6 of the Internet Protocol (IPv6). The fundamental mechanisms of OSPF (flooding, Designated Router (DR) election, area support, Short Path First (SPF) calculations, etc.) remain unchanged. However, some changes have been necessary, either due to changes in protocol semantics between IPv4 and IPv6, or simply to handle the increased address size of IPv6. These modifications will necessitate incrementing the protocol version from version 2 to version 3. OSPF for IPv6 is also referred to as OSPF version 3 (OSPFv3). Changes between OSPF for IPv4, OSPF Version 2, and OSPF for IPv6 as described herein include the following. Addressing semantics have been removed from OSPF packets and the basic Link State Advertisements (LSAs). New LSAs have been created to carry IPv6 addresses and prefixes. OSPF now runs on a per-link basis rather than on a per-IP-subnet basis. Flooding scope for LSAs has been generalized. Authentication has been removed from the OSPF protocol and instead relies on IPv6's Authentication Header and Encapsulating Security Payload (ESP). Even with larger IPv6 addresses, most packets in OSPF for IPv6 are almost as compact as those in OSPF for IPv4. Most fields and packet- size limitations present in OSPF for IPv4 have been relaxed. In addition, option handling has been made more flexible. All of OSPF for IPv4's optional capabilities, including demand circuit support and Not-So-Stubby Areas (NSSAs), are also supported in OSPF for IPv6. {[}STANDARDS-TRACK{]}},
}
% I have no idea where the abstract is from, but I do not care much.
@misc{rfc1131,
series = {Request for Comments},
number = 1131,
howpublished = {RFC 1131},
publisher = {RFC Editor},
doi = {10.17487/RFC1131},
url = {https://www.rfc-editor.org/info/rfc1131},
author = {John Moy},
title = {{The OSPF Specification}},
pagetotal = 103,
year = 1989,
month = oct,
abstract = {This RFC is the specification of the Open Shortest Path First (OSPF) Internet routing protocol. OSPF is in the class of Internal Gateway Protocols (IGPs) for distributing routing information between gateways of a single Autonomous System. This routing protocol is based on the link-state approach (in contrast to the distance-vector approach). This specification was developed by the OSPF Working Group of the Internet Engineering Task Force. {[}STANDARDS-TRACK{]}},
}
@misc{BIRD,
url={https://bird.network.cz},
urldate={2023-07-11},
author={CZ.NIC Labs},
title={{T}he {BIRD} {I}nternet {R}outing {D}aemon},
howpublished= {Available at \url{https://bird.network.cz}},
note={Accessed: 2023-07-11}
}
@misc{cisco-icons,
url={https://www.cisco.com/c/en/us/about/brand-center/network-topology-icons.html},
urldate={2023-07-17},
author={{C}isco {S}ystems {Inc.}},
title={{N}etwork {T}opology {I}cons},
howpublished={Available at \url{https://www.cisco.com/c/en/us/about/brand-center/network-topology-icons.html}},
note={Accessed: 2023-07-17}
}
@misc{weathermap,
url={https://www.network-weathermap.com/},
urldate={2023-07-17},
author={Howard Jones},
title={{N}etwork {W}eathermap},
howpublished={Available at \url{https://www.network-weathermap.com/}},
note={Accessed: 2023-07-17}
}
@misc{grafana,
url={https://grafana.com/grafana/},
urldate={2023-07-17},
author={Grafana Labs},
title={{G}rafana},
howpublished={Available at \url{https://grafana.com/grafana/}},
note={Accessed: 2023-07-17}
}
@misc{python,
url={https://www.python.org/},
urldate={2023-07-20},
author={Python Software Foundation},
title={Python},
howpublished={Available at \url{https://www.python.org/}},
note={Accessed: 2023-07-20}
}
@misc{qt6,
url={https://www.qt.io/product/qt6},
urldate={2023-07-20},
author={The Qt Company},
title={{Qt} 6},
howpublished={Available at \url{https://www.qt.io/product/qt6}},
note={Accessed: 2023-07-20}
}
@misc{graphviz,
url={https://graphviz.org/},
urldate={2023-07-20},
author={The Graphviz Authors},
title={Graphviz},
howpublished={Available at \url{https://graphviz.org/}},
note={Accessed: 2023-07-20}
}
@misc{czelanet,
url={https://www.czela.net/},
urldate={2023-07-20},
author={czela.net z.s.},
title={{czela.net}: Metropolitní síť v {Č}elákovicích a okolí},
howpublished={Available at \url{https://www.czela.net/}},
note={Accessed: 2023-07-20}
}
@misc{cacti,
url={https://www.cacti.net/},
urldate={2023-07-17},
author={The Cacti Group, Inc.},
title={{C}acti -- The Complete {RRDTool}-based Graphing Solution},
howpublished={Available at \url{https://www.cacti.net/}},
note={Accessed: 2023-07-17}
}
@misc{munin,
url={https://munin-monitoring.org/},
urldate={2023-07-17},
author={The Munin project},
title={{M}unin monitoring},
howpublished={Available at \url{https://munin-monitoring.org/}},
note={Accessed: 2023-07-17}
}
@misc{plotnetcfg,
url={https://github.com/jbenc/plotnetcfg},
urldate={2023-07-17},
author={Jiří Benc},
title={plotnetcfg},
howpublished={Available at \url{https://github.com/jbenc/plotnetcfg}},
note={Accessed: 2023-07-17}
}
@misc{calstats,
url={https://jankrupa.com/projects/calstats/},
urldate={2023-07-17},
author={Jan Krupa},
title={{CaLStats}: Computer and Line Statistics},
howpublished={Available at \url{https://jankrupa.com/projects/calstats/}},
note={Accessed: 2023-07-17}
}
@misc{icinga,
url={https://icinga.com/},
urldate={2023-07-17},
author={Icinga GmbH},
title={Icinga 2},
howpublished={Available at \url{https://icinga.com/}},
note={Accessed: 2023-07-17}
}
@misc{topolograph,
url={https://topolograph.com/},
urldate={2023-07-17},
author={Vadims06},
title={Topolograph},
howpublished={Available at \url{https://topolograph.com/}},
note={Accessed: 2023-07-17}
}
@misc{ospfwatcher,
url={https://github.com/Vadims06/ospfwatcher},
urldate={2023-07-17},
author={Vadims06},
title={{OSPF} {T}opology {W}atcher},
howpublished={Available at \url{https://github.com/Vadims06/ospfwatcher}},
note={Accessed: 2023-07-17}
}
%% author?
@misc{quagga,
url={https://www.nongnu.org/quagga/},
urldate={2023-07-17},
author={The Quagga team},
title={Quagga Routing Suite},
howpublished={Available at \url{https://www.nongnu.org/quagga/}},
note={Accessed: 2023-07-17}
}
@misc{logstash,
url={https://www.elastic.co/logstash/},
urldate={2023-07-17},
author={Elasticsearch {B.V.}},
title={Logstash},
howpublished={Available at \url{https://www.elastic.co/logstash/}},
note={Accessed: 2023-07-17}
}
@misc{xorp,
url={http://xorp.org/},
urldate={2019-02-15},
author={{XORP, Inc.}},
title={e{X}tensible {O}pen {R}outer {P}latform},
howpublished={Available at \url{http://xorp.org/}},
note={Accessed: 2019-02-15}
}
@misc{openospfd,
url={http://www.openbgpd.org/},
urldate={2023-07-17},
author={{OpenBSD} Project},
title={{OpenOSPFD}},
howpublished={Available at \url{http://www.openbgpd.org/}},
note={Accessed: 2023-07-17}
}
@misc{frr,
url={https://frrouting.org/},
urldate={2023-07-17},
author={{FRRouting} Project},
title={{FRRouting} Project},
howpublished={Available at \url{https://frrouting.org/}},
note={Accessed: 2023-07-17}
}
@misc{bird-src,
url={https://gitlab.nic.cz/labs/bird},
urldate={2023-07-17},
author={CZ.NIC Labs},
title={{BIRD} source code},
howpublished={Available at \url{https://gitlab.nic.cz/labs/bird}},
note={Accessed: 2023-07-17}
}
@misc{jinja2,
url={https://jinja.palletsprojects.com/en/3.1.x/},
urldate={2023-07-17},
author={Pallets project},
title={Jinja},
howpublished={Available at \url{https://jinja.palletsprojects.com/en/3.1.x/}},
note={Accessed: 2023-07-17}
}
@inbook{as-topologies,
author = {Canbaz, M Abdullah and Bakhshaliyev, Khalid and Gunes, Mehmet},
year = 2018,
month = feb,
pages = {243--257},
title = {Router-Level Topologies of Autonomous Systems},
isbn = {978-3-319-73197-1},
doi = {10.1007/978-3-319-73198-8_21}
}
@article{nodewatcher-paper,
doi = {10.1016/j.comnet.2015.09.021},
url = {https://doi.org/10.1016%2Fj.comnet.2015.09.021},
year = 2015,
month = dec,
publisher = {Elsevier {BV}},
volume = {93},
pages = {279--296},
author = {Jernej Kos and Mitar Milutinovi{\'{c}} and Luka {\v{C}}ehovin},
title = {nodewatcher: A substrate for growing your own community network},
journal = {Computer Networks}
}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% Keeping the example bibliography for reference. Anything bellow is irrelevant.
@BOOK{Andel07,
title = {Základy matematické statistiky},
publisher = {Matfyzpress},
year = {2007},
author = {Anděl, J.},
address = {Praha},
series = {Druhé opravené vydání},
isbn = {80-7378-001-1}
}
@BOOK{Andel98,
title = {Statistické metody},
publisher = {Matfyzpress},
year = {1998},
author = {Anděl, J.},
address = {Praha},
series = {Druhé přepracované vydání},
isbn = {80-85863-27-8}
}
@ARTICLE{Cox72,
author = {Cox, D. R.},
title = {Regression models and life-tables (with {D}iscussion)},
journal = {Journal of the Royal Statistical Society, Series B},
year = {1972},
volume = {34},
pages = {187--220},
number = {2}
}
@ARTICLE{DempsterLairdRubin77,
author = {Dempster, A. P. and Laird, N. M. and Rubin, D. B.},
title = {Maximum likelihood from incomplete data via the {EM} algorithm},
journal = {Journal of the Royal Statistical Society, Series B},
year = {1977},
volume = {39},
pages = {1--38},
number = {1}
}
@ARTICLE{Genberget08,
author = {Genberg, B. L. and Kulich, M. and Kawichai, S. and Modiba, P. and
Chingono, A. and Kilonzo, G. P. and Richter, L. and Pettifor, A.
and Sweat, M. and Celentano, D. D.},
title = {{HIV} risk behaviors in Sub-{S}aharan {A}frica and {N}orthern {T}hailand:
{B}aseline behavioral data from project {A}ccept},
journal = {Journal of Acquired Immune Deficiency Syndrome},
year = {2008},
volume = {49},
pages = {309--319}
}
@ARTICLE{KaplanMeier58,
author = {Kaplan, E. L. and Meier, P.},
title = {Nonparametric estimation from incomplete observations},
journal = {Journal of the American Statistical Association},
year = {1958},
volume = {53},
pages = {457--481},
number = {282}
}
@BOOK{LehmannCasella98,
title = {Theory of Point Estimation},
publisher = {Springer-Verlag},
year = {1998},
author = {Lehmann, E. L. and Casella, G.},
address = {New York},
series = {{S}econd {E}dition},
isbn = {0-387-98502-6}
}
@ARTICLE{Student08,
author = {Student},
title = {On the probable error of the mean},
journal = {Biometrika},
year = {1908},
volume = {6},
pages = {1-25}
}