bibliography.bib

@article{ALPERN1985181,
  title        = {Defining liveness},
  journal      = {Information Processing Letters},
  volume       = 21,
  number       = 4,
  pages        = {181-185},
  year         = 1985,
  issn         = {0020-0190},
  doi          = {https://doi.org/10.1016/0020-0190(85)90056-0},
  url          = {https://www.sciencedirect.com/science/article/pii/0020019085900560},
  author       = {Bowen Alpern and Fred B. Schneider},
  keywords     = {Liveness, absolute liveness, uniform liveness, safety, property, topology, concurrency, semantics},
  abstract     = {A formal definition for liveness properties is proposed. It is argued that this definition captures
                  the intuition that liveness properties stipulate that ‘something good’ eventually happens during
                  execution. A topological characterization of safety and liveness is given. Every property is shown to
                  be the intersection of a safety property and a liveness property.}
}

@article{2011:monares,
  author       = {Monares, \'{A}lvaro and Ochoa, Sergio F. and Pino, Jos\'{e} A. and Herskovic, Valeria and
                  Rodriguez-Covili, Juan and Neyem, Andr\'{e}s},
  title        = {{Mobile Computing in Urban Emergency Situations: Improving the Support to Firefighters in the Field}},
  year         = 2011,
  issue_date   = {February, 2011},
  publisher    = {Pergamon Press, Inc.},
  address      = {USA},
  volume       = 38,
  number       = 2,
  issn         = {0957-4174},
  url          = {https://doi.org/10.1016/j.eswa.2010.05.018},
  doi          = {10.1016/j.eswa.2010.05.018},
  abstract     = {Communication support is a serious limitation for Latin American firefighters when they deal with
                  emergency situations. The insufficient number of radio channels and the impossibility to deliver
                  digital information force firemen to improvise during response processes, e.g., to make decisions
                  using their experience and poor or null supporting information. These improvised actions affect the
                  time required to take control of an emergency, and also affect the evolution of the crisis
                  situation. Provided most of Latin American fire companies are volunteer organizations, communication
                  solutions that could help to overcome these problems are usually expensive for them. This article
                  presents a low-cost mobile collaborative application, which may be used in emergency situations to
                  overcome most of the firefighters' communication problems. The application, named MobileMap, is the
                  result of the research and development work conducted by the authors, supported by a Chilean fire
                  company, during the last three years. MobileMap allows ad hoc communication, decisions support and
                  collaboration among firefighters in the field using mobile devices. This solution complements the
                  radio communication systems. Since the interactions supported by MobileMap are recorded, it is
                  possible to analyze such information after the crisis and learn for future emergencies. The tool was
                  evaluated in simulated and real scenarios, and the obtained results are highly encouraging.},
  journal      = {Expert Syst. Appl.},
  month        = 2,
  pages        = {1255–1267},
  numpages     = 13,
  keywords     = {Communication support, Decision support system, Emergency support, Mobile collaborative application,
                  Mobile computing}
}

@article{2009:triagetag,
  title        = {{Providing Early Resource Allocation During Emergencies: The Mobile Triage Tag}},
  journal      = {Journal of Network and Computer Applications},
  volume       = 32,
  number       = 6,
  pages        = {1167-1182},
  year         = 2009,
  issn         = {1084-8045},
  doi          = {https://doi.org/10.1016/j.jnca.2009.05.006},
  url          = {https://www.sciencedirect.com/science/article/pii/S1084804509000769},
  author       = {R. Martí and S. Robles and A. Martín-Campillo and J. Cucurull},
  keywords     = {Mobile agents, Triage tag, Emergency system},
  abstract     = {Quick response is critical during an emergency situation. This paper describes a system based on
                  mobile electronic triage tags that makes victim information available at the base of operations as
                  soon as possible, thus allowing an early medical resource allocation and immediate action. The
                  cornerstone of the system is mobile agent technology, which allows information to be transported
                  asynchronously and reliably from terminal to terminal and not requiring any network infrastructure at
                  all. This novel approach is ready to be used in the worst case scenario, where only small handheld
                  devices carried by the emergency personnel are available, but also integrates well when synchronous
                  connections are possible, for instance when a mesh network can be created. The system has been
                  successfully implemented, showing the feasibility of the proposal. By using this low-budget system,
                  the number of casualties during the triage stage of an emergency is expected to drop off.}
}

@article{1987:sarinlynch,
  author       = {Sarin, S.K. and Lynch, N.A.},
  journal      = {IEEE Transactions on Software Engineering},
  title        = {Discarding Obsolete Information in a Replicated Database System},
  year         = 1987,
  volume       = {SE-13},
  number       = 1,
  pages        = {39-47},
  keywords     = {Database systems;Protocols;Pipelines;Partitioning algorithms;Computer crashes;Distributed
                  databases;Availability;Government;Computer science;Protection;Distributed databases;distributed
                  snapshots;mutual consistency;network partitions;replicated data;timestamps},
  doi          = {10.1109/TSE.1987.232564}
}

@misc{rfc1119,
  series       = {Request for Comments},
  number       = 1119,
  howpublished = {RFC 1119},
  publisher    = {RFC Editor},
  doi          = {10.17487/RFC1119},
  url          = {https://www.rfc-editor.org/info/rfc1119},
  author       = {D.L. Mills},
  title        = {{Network Time Protocol (version 2) Specification and Implementation}},
  pagetotal    = 1,
  year         = 1989,
  month        = sep,
  abstract     = {This document describes the Network Time Protocol (NTP), specifies its formal structure and summarizes
                  information useful for its implementation. NTP provides the mechanisms to synchronize time and
                  coordinate time distribution in a large, diverse internet operating at rates from mundane to
                  lightwave. It uses a returnable-time design in which a distributed subnet of time servers operating in
                  a self- organizing, hierarchical-master-slave configuration synchronizes local clocks within the
                  subnet and to national time standards via wire or radio. The servers can also redistribute reference
                  time via local routing algorithms and time daemons. {[}STANDARDS-TRACK{]}},
}

@inproceedings{1989mattern,
  title        = {{Virtual Time and Global States of Distributed Systems}},
  author       = {Friedemann Mattern},
  booktitle    = "Parallel and Distributed Algorithms: proceedings of the International Workshop on Parallel and
                  Distributed Algorithms",
  editor       = "M. Cosnard et. al.",
  year         = 1989,
  publisher    = "Elsevier Science Publishers B. V.",
  pages        = "215--226",
  url          = {https://api.semanticscholar.org/CorpusID:7517210}
}

@book{coulouris2005distributed,
  added-at     = {2010-11-23T14:26:55.000+0100},
  asin         = 0321263545,
  author       = {Coulouris, George and Dollimore, Jean and Kindberg, Tim},
  biburl       = {https://www.bibsonomy.org/bibtex/20f7b3759d6d803835d09a29a9bb9397f/schmidt2},
  description  = {Distributed Systems: Concepts and Design International Computer Science: Amazon.de: George Coulouris,
                  Jean Dollimore, Tim Kindberg: Englische Bücher},
  dewey        = {004.36},
  ean          = 9780321263544,
  edition      = {4th rev. ed.},
  interhash    = {4dda0a9ab33b8405bd609ea34718c821},
  intrahash    = {0f7b3759d6d803835d09a29a9bb9397f},
  isbn         = 0321263545,
  keywords     = {addison-wesley books coulouris distributed},
  publisher    = {Addison-Wesley Longman, Amsterdam},
  timestamp    = {2011-07-19T11:29:32.000+0200},
  title        = {Distributed Systems: Concepts and Design (International Computer Science)},
  year         = 2005
}

@misc{2022:mechfire,
  title        = {{Mechanized Wildland Firefighting. Ep.64}},
  date         = {2022-05},
  organization = {Youtube},
  author       = {{Jesse Stark/``Free-Range-Human Project''}},
  howpublished = {\url{https://www.youtube.com/watch?v=4F2dDKMgAME}}
}

@misc{2021:firstnet,
  title        = {{How 9/11 Changed Me and First Responder Communications}},
  date         = {2021-08-20},
  organization = {NIST},
  author       = {{Dereck Orr}},
  howpublished = {Available at
                  \url{https://www.nist.gov/blogs/taking-measure/how-911-changed-me-and-first-responder-communications}},
}

@misc{2021:firstnet2,
  title        = {{Remembering 9/11 and How It Changed Public Safety communications}},
  date         = {2021-09-07},
  organization = {{FirstNet}},
  author       = {{Harry Markley}},
  howpublished = {Available at
                  \url{https://www.firstnet.gov/newsroom/blog/remembering-911-and-how-it-changed-public-safety-communications}}
}

@article{2016:iobt,
  author       = {Kott, Alexander and Swami, Ananthram and West, Bruce J.},
  journal      = {Computer},
  title        = {{The Internet of Battle Things}},
  year         = 2016,
  volume       = 49,
  number       = 12,
  pages        = {70-75},
  keywords     = {Internet of things;Military communication;Computer hacking;Computer crime;Computer security;Internet
                  of Things;IoT;military;cyberattacks;Internet of Battle Things;the IoT Connection},
  doi          = {10.1109/MC.2016.355}
}

@Misc{2021:aerialfirefighting,
  title        = {{Aerial Firefighting Progress | Behind the Wings on PBS}},
  date         = {2021-11-18},
  organization = {Youtube},
  author       = {{Wings Over the Rockies Air and Space Museum}},
  howpublished = {Available at \url{https://www.youtube.com/watch?v=CWjfpMORGSQ&t=138}}
}

@article{2011:Reardon,
  author       = {Reardon, Marguerite},
  date         = {2011-09-07},
  year         = 2011,
  title        = {{Post 9/11: Can We Count on Cell Networks?}},
  journal      = {CBS News},
  url          = {https://www.cbsnews.com/news/post-9-11-can-we-count-on-cell-networks/},
  urldate      = {2024-01-08}
}

@Misc{2019:airtankerops,
  Title        = {{Standards for Airtanker Operations}},
  Author       = {{United States Department of Agriculture}},
  Date         = {2019-07},
  url          =
                  {https://www.fs.usda.gov/sites/default/files/2019-09/standards_for_airtanker_operations_-_final_-_2019_approved_0.pdf},
  Year         = 2019,
}

@Misc{2021:monumentfire,
  author       = {{California Department of Forestry and Fire Protection}},
  date         = {2022-10-14},
  title        = {{Monument Fire}},
  howpublished = {Available at \url{https://www.fire.ca.gov/incidents/2021/7/30/monument-fire/}},
  urldate      = {2024-01-08},
}

@article{2019:stickney,
  author       = {{R. Stickney}},
  date         = {2019-08-26},
  title        = {{Cal Fire YouTube Clip Shows Power of Fire Retardant Drop}},
  journal      = {NBC San Diego},
  howpublished = {Available at
                  \url{https://web.archive.org/web/20221007215901/https://www.nbcsandiego.com/news/local/cal-fire-youtube-clip-power-of-fire-retardant-drop/128166/}},
  urldate      = {2022-10-07},
  year         = 2019
}

@article{2010:magnuson,
  ISSN         = {00921491, 19433115},
  URL          = {http://www.jstor.org/stable/45370790},
  author       = {Stew Magnuson},
  journal      = {National Defense},
  number       = 674,
  pages        = {36--38},
  publisher    = {National Defense Industrial Association},
  title        = {{'Coin of the Realm': Military 'Swimming In Sensors and Drowning in Data'}},
  urldate      = {2023-11-10},
  volume       = 94,
  year         = 2010
}

@article{1999:lucien-datafusion,
  author       = {Wald, Lucien},
  year         = 1999,
  month        = 06,
  pages        = {1190 - 1193},
  title        = {Some terms of reference in data fusion},
  volume       = 37,
  journal      = {Geoscience and Remote Sensing, IEEE Transactions on},
  doi          = {10.1109/36.763269}
}

@book{mendelson2012introduction,
  title        = {Introduction to Topology: Third Edition},
  author       = {Mendelson, B.},
  isbn         = 9780486135090,
  series       = {Dover Books on Mathematics},
  url          = {https://books.google.com/books?id=FWFmoEUJSwkC},
  year         = 2012,
  publisher    = {Dover Publications}
}

@Report{pcast2023,
  Title        = {{Report to the President: Modernizing Wildland Firefighting to Protect Our Firefighters}},
  Author       = {{President’s Council of Advisors on Science and Technology}},
  Date         = {2023-02-02},
  Institution  = {Executive Office of the President},
  Year         = 2023,
  Location     = {Washington, D.C.},
  Date         = {2023-02-02},
  URL          =
                  {https://web.archive.org/web/20230401084148/https://www.whitehouse.gov/wp-content/uploads/2023/02/PCAST_Wildfires-Report_Feb2023.pdf}
}

@Report{2018:calfire,
  Title        = {{Firefighter Injuries and Fatality: August 13, 2018, Mendocino Complex (Ranch Fire)}},
  Author       = {{California Department of Forestry and Fire Protection}},
  Date         = {2018-08-13},
  Institution  = {{California Department of Forestry and Fire Protection}},
  Year         = 2018,
  Location     = {California, USA},
  Date         = {2018-08-13},
  URL          =
                  {https://web.archive.org/web/20180918124244/https://wildfiretoday.com/documents/Green_Sheet_Retardant_Drop_Fatality.pdf}
}

@misc{radiocache,
  title        = {{Radio Cache}},
  author       = {{National Interagency Incident Communications Division}},
  howpublished =
                  {\url{https://web.archive.org/web/20231106025933/https://www.nifc.gov/about-us/what-is-nifc/radio-cache}},
  note         = {Accessed: 2023-11-10}
}

@inproceedings{2000brewerCAP,
  author       = {Brewer, Eric},
  year         = 2000,
  month        = 01,
  pages        = 7,
  title        = {Towards robust distributed systems},
  booktitle    = {Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing},
  journal      = {PODC},
  doi          = {10.1145/343477.343502}
}

@book{TanenbaumSteen07,
  abstract     = {Very few textbooks today explore distributed systems in a manner appropriate for university
                  students. In this unique text, esteemed authors Tanenbaum and van Steen provide full coverage of the
                  field in a systematic way that can be readily used for teaching. No other text examines the underlying
                  principles - and their applications to a wide variety of practical distributed systems - with this
                  level of depth and clarity.},
  added-at     = {2016-12-26T21:10:28.000+0100},
  address      = {Upper Saddle River, NJ},
  author       = {Tanenbaum, Andrew S. and van Steen, Maarten},
  biburl       = {https://www.bibsonomy.org/bibtex/2aeb78dfa5b91b66dce027f86ecdeeb81/flint63},
  description  = {Edition 2 deutsch 2008 978-3-8273-7293-2},
  edition      = 2,
  file         = {Pearson Product page:http\://www.pearsoned.co.uk/bookshop/detail.asp?item=100000000280068:URL;Amazon
                  Search inside:http\://www.amazon.de/gp/reader/0132392275/:URL},
  groups       = {public},
  interhash    = {7dc82e09cac538d5eb7781e41a050aa7},
  intrahash    = {aeb78dfa5b91b66dce027f86ecdeeb81},
  isbn         = {978-0-13-239227-3},
  keywords     = {01841 104 book shelf computer middleware network application},
  publisher    = {Pearson Prentice Hall},
  timestamp    = {2018-04-16T11:54:15.000+0200},
  title        = {Distributed Systems: Principles and Paradigms},
  username     = {flint63},
  year         = 2007
}

@INPROCEEDINGS{1999foxbrewer,
  author       = {Fox, A. and Brewer, E.A.},
  booktitle    = {Proceedings of the Seventh Workshop on Hot Topics in Operating Systems},
  title        = {{Harvest, Yield, and Scalable Tolerant Systems}},
  year         = 1999,
  pages        = {174-178},
  doi          = {10.1109/HOTOS.1999.798396}
}

@article{10.1145/78969.78972,
  author       = {Herlihy, Maurice P. and Wing, Jeannette M.},
  title        = {{Linearizability: A Correctness Condition for Concurrent Objects}},
  year         = 1990,
  issue_date   = {July 1990},
  publisher    = {Association for Computing Machinery},
  address      = {New York, NY, USA},
  volume       = 12,
  number       = 3,
  issn         = {0164-0925},
  url          = {https://doi.org/10.1145/78969.78972},
  doi          = {10.1145/78969.78972},
  abstract     = {A concurrent object is a data object shared by concurrent processes. Linearizability is a correctness
                  condition for concurrent objects that exploits the semantics of abstract data types. It permits a high
                  degree of concurrency, yet it permits programmers to specify and reason about concurrent objects using
                  known techniques from the sequential domain. Linearizability provides the illusion that each operation
                  applied by concurrent processes takes effect instantaneously at some point between its invocation and
                  its response, implying that the meaning of a concurrent object's operations can be given by pre- and
                  post-conditions. This paper defines linearizability, compares it to other correctness conditions,
                  presents and demonstrates a method for proving the correctness of implementations, and shows how to
                  reason about concurrent objects, given they are linearizable.},
  journal      = {ACM Trans. Program. Lang. Syst.},
  month        = 7,
  pages        = {463–492},
  numpages     = 30
}

@ARTICLE{2012CAP12Years,
  author       = {Brewer, Eric},
  journal      = {Computer},
  title        = {CAP Twelve Years Later: How the "Rules" Have Changed},
  year         = 2012,
  volume       = 45,
  number       = 2,
  pages        = {23-29},
  doi          = {10.1109/MC.2012.37}
}

@article{1978:lamportclocks,
  author       = {Lamport, Leslie},
  title        = {{Time, Clocks, and the Ordering of Events in a Distributed System}},
  year         = 1978,
  issue_date   = {July 1978},
  publisher    = {Association for Computing Machinery},
  address      = {New York, NY, USA},
  volume       = 21,
  number       = 7,
  issn         = {0001-0782},
  url          = {https://doi.org/10.1145/359545.359563},
  doi          = {10.1145/359545.359563},
  abstract     = {The concept of one event happening before another in a distributed system is examined, and is shown to
                  define a partial ordering of the events. A distributed algorithm is given for synchronizing a system
                  of logical clocks which can be used to totally order the events. The use of the total ordering is
                  illustrated with a method for solving synchronization problems. The algorithm is then specialized for
                  synchronizing physical clocks, and a bound is derived on how far out of synchrony the clocks can
                  become.},
  journal      = {Commun. ACM},
  month        = 7,
  pages        = {558–565},
  numpages     = 8,
  keywords     = {clock synchronization, computer networks, distributed systems, multiprocess systems}
}

@ARTICLE{1979LamportSequential,
  author       = {Lamport},
  journal      = {IEEE Transactions on Computers},
  title        = {How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs},
  year         = 1979,
  volume       = {C-28},
  number       = 9,
  pages        = {690-691},
  doi          = {10.1109/TC.1979.1675439}
}

@techreport{10.5555/866855,
  author       = {Friedman, Roy and Birman, Ken},
  title        = {Trading Consistency for Availability in Distributed Systems},
  year         = 1996,
  publisher    = {Cornell University},
  address      = {USA},
  abstract     = {This paper shows that two important classes of actions, {em non left commuting}/ and {em strongly non
                  commuting}, cannot be executed by concurrent partitions in a system that provides serializable
                  services. This result indicates that there is an inherent limitation to the ability of systems to
                  provide services in a consistent manner during network partitions.}
}

@ARTICLE{2019wideningcap,
  author       = {Muñoz-Escoí, Francesc D and de Juan-Marín, Rubén and García-Escrivá, José-Ramón and González de
                  Mendívil, J R and Bernabéu-Aubán, José M},
  journal      = {The Computer Journal},
  title        = {CAP Theorem: Revision of Its Related Consistency Models},
  year         = 2019,
  volume       = 62,
  number       = 6,
  pages        = {943-960},
  doi          = {10.1093/comjnl/bxy142}
}

@article{2002gilbertlynchCAP,
  author       = {Gilbert, Seth and Lynch, Nancy A.},
  title        = {{Brewer's Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services}},
  year         = 2002,
  issue_date   = {June 2002},
  publisher    = {Association for Computing Machinery},
  address      = {New York, NY, USA},
  volume       = 33,
  number       = 2,
  issn         = {0163-5700},
  url          = {https://doi.org/10.1145/564585.564601},
  doi          = {10.1145/564585.564601},
  abstract     = {When designing distributed web services, there are three properties that are commonly desired:
                  consistency, availability, and partition tolerance. It is impossible to achieve all three. In this
                  note, we prove this conjecture in the asynchronous network model, and then discuss solutions to this
                  dilemma in the partially synchronous model.},
  journal      = {SIGACT News},
  month        = 6,
  pages        = {51–59},
  numpages     = 9
}

@ARTICLE{@2012brewerCAPchanged,
  author       = {Brewer, Eric},
  journal      = {Computer},
  title        = {CAP twelve years later: How the ``rules'' have changed},
  year         = 2012,
  volume       = 45,
  number       = 2,
  pages        = {23-29},
  doi          = {10.1109/MC.2012.37}
}

@book{kshemkalyani_singhal_2008,
  place        = {Cambridge},
  title        = {Distributed Computing: Principles, Algorithms, and Systems},
  DOI          = {10.1017/CBO9780511805318},
  publisher    = {Cambridge University Press},
  author       = {Kshemkalyani, Ajay D. and Singhal, Mukesh},
  year         = 2008
}

@article{10.1145/5505.5508,
  author       = {Davidson, Susan B. and Garcia-Molina, Hector and Skeen, Dale},
  title        = {Consistency in a Partitioned Network: A Survey},
  year         = 1985,
  issue_date   = {Sept. 1985},
  publisher    = {Association for Computing Machinery},
  address      = {New York, NY, USA},
  volume       = 17,
  number       = 3,
  issn         = {0360-0300},
  url          = {https://doi.org/10.1145/5505.5508},
  doi          = {10.1145/5505.5508},
  abstract     = {Recently, several strategies have been proposed for transaction processing in partitioned distributed
                  database systems with replicated data. These strategies are surveyed in light of the competing goals
                  of maintaining correctness and achieving high availability. Extensions and combinations are then
                  discussed, and guidelines are presented for selecting strategies for particular applications.},
  journal      = {ACM Comput. Surv.},
  month        = {sep},
  pages        = {341–370},
  numpages     = 30
}

@inproceedings{DBLP:conf/icdcs/YuV01,
  author       = {Haifeng Yu and Amin Vahdat},
  title        = {{Combining Generality and Practicality in a Conit-Based Continuous Consistency Model for Wide-Area
                  Replication}},
  booktitle    = {Proceedings of the 21st International Conference on Distributed Computing Systems {(ICDCS} 2001),
                  Phoenix, Arizona, USA, April 16-19, 2001},
  pages        = {429--438},
  publisher    = {{IEEE} Computer Society},
  year         = 2001,
  url          = {https://doi.org/10.1109/ICDSC.2001.918973},
  doi          = {10.1109/ICDSC.2001.918973},
  timestamp    = {Wed, 16 Oct 2019 14:14:50 +0200},
  biburl       = {https://dblp.org/rec/conf/icdcs/YuV01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{2002tact,
  author       = {Yu, Haifeng and Vahdat, Amin},
  title        = {{Design and Evaluation of a Conit-Based Continuous Consistency Model for Replicated Services}},
  year         = 2002,
  issue_date   = {August 2002},
  publisher    = {Association for Computing Machinery},
  address      = {New York, NY, USA},
  volume       = 20,
  number       = 3,
  issn         = {0734-2071},
  url          = {https://doi.org/10.1145/566340.566342},
  doi          = {10.1145/566340.566342},
  abstract     = {The tradeoffs between consistency, performance, and availability are well understood. Traditionally,
                  however, designers of replicated systems have been forced to choose from either strong consistency
                  guarantees or none at all. This paper explores the semantic space between traditional strong and
                  optimistic consistency models for replicated services. We argue that an important class of
                  applications can tolerate relaxed consistency, but benefit from bounding the maximum rate of
                  inconsistent access in an application-specific manner. Thus, we develop a conit-based continuous
                  consistency model to capture the consistency spectrum using three application-independent metrics,
                  numerical error, order error, and staleness. We then present the design and implementation of TACT, a
                  middleware layer that enforces arbitrary consistency bounds among replicas using these metrics. We
                  argue that the TACT consistency model can simultaneously achieve the often conflicting goals of
                  generality and practicality by describing how a broad range of applications can express their
                  consistency semantics using TACT and by demonstrating that application-independent algorithms can
                  efficiently enforce target consistency levels. Finally, we show that three replicated applications
                  running across the Internet demonstrate significant semantic and performance benefits from using our
                  framework.},
  journal      = {ACM Trans. Comput. Syst.},
  month        = 8,
  pages        = {239–282},
  numpages     = 44,
  keywords     = {consistency model, continuous consistency, Conit, replication, network services, relaxed consistency}
}

@INPROCEEDINGS{2000tact,
  author       = {Yu, Haifeng and Vahdat, Amin},
  booktitle    = {Proceedings Second International Workshop on Advanced Issues of E-Commerce and Web-Based Information
                  Systems. WECWIS 2000},
  title        = {{Building Replicated Internet Services using TACT: a Toolkit for Tunable Availability and Consistency
                  Tradeoffs}},
  year         = 2000,
  pages        = {75-84},
  doi          = {10.1109/WECWIS.2000.853861}
}

@inproceedings{2000tactalgorithms,
  author       = {Yu, Haifeng and Vahdat, Amin},
  title        = {{Efficient Numerical Error Bounding for Replicated Network Services}},
  year         = 2000,
  isbn         = 1558607153,
  publisher    = {Morgan Kaufmann Publishers Inc.},
  address      = {San Francisco, CA, USA},
  booktitle    = {Proceedings of the 26th International Conference on Very Large Data Bases},
  pages        = {123–133},
  numpages     = 11,
  series       = {VLDB '00}
}

@book{10.5555/562065,
  author       = {Singhal, Mukesh and Shivaratri, Niranjan G.},
  title        = {Advanced Concepts in Operating Systems},
  year         = 1994,
  isbn         = {007057572X},
  publisher    = {McGraw-Hill, Inc.},
  address      = {USA},
  abstract     = {From the Publisher:Operating systems have evolved substantially over the past two decades,and there is
                  a need for a book which can explain major developments and changes in this dynamic field. This is such
                  a book. Comprehensive,and useful as a text and reference,Advanced Concepts in Operating Systems lays
                  down all the concepts and mechanisms involved in the design of advanced operating systems. The
                  discussion is reinforced by many examples and cases}
}

@inproceedings{10.5555/1251229.1251250,
  author       = {Yu, Haifeng and Vahdat, Amin},
  title        = {{Design and Evaluation of a Continuous Consistency Model for Replicated Services}},
  year         = 2000,
  publisher    = {USENIX Association},
  address      = {USA},
  abstract     = {The tradeoffs between consistency, performance, and availability are well understood. Traditionally,
                  however, designers of replicated systems have been forced to choose from either strong consistency
                  guarantees or none at all. This paper explores the semantic space between traditional strong and
                  optimistic consistency models for replicated services. We argue that an important class of
                  applications can tolerate relaxed consistency, but benefit from bounding the maximum rate of
                  inconsistent access in an application-specific manner. Thus, we develop a set of metrics, Numerical
                  Error, Order Error, and Staleness, to capture the consistency spectrum. We then present the design and
                  implementation of TACT, a middleware layer that enforces arbitrary consistency bounds among replicas
                  using these metrics. Finally, we show that three replicated applications demonstrate significant
                  semantic and performance benefits from using our framework.},
  booktitle    = {{Proceedings of the 4th Conference on Symposium on Operating System Design and Implementation - Volume
                  4}},
  articleno    = 21,
  location     = {San Diego, California},
  series       = {OSDI'00}
}

@ARTICLE{1979Sift,
  author       = {Wensley, J.H. and Lamport, L. and Goldberg, J. and Green, M.W. and Levitt, K.N. and Melliar-Smith,
                  P.M. and Shostak, R.E. and Weinstock, C.B.},
  journal      = {Proceedings of the IEEE},
  title        = {SIFT: Design and analysis of a fault-tolerant computer for aircraft control},
  year         = 1978,
  volume       = 66,
  number       = 10,
  pages        = {1240-1255},
  doi          = {10.1109/PROC.1978.11114}
}

@ARTICLE {2012perspectivesCAP,
  author       = {Gilbert, Seth and Lynch, Nancy A.},
  journal      = {Computer},
  title        = {Perspectives on the CAP Theorem},
  year         = 2012,
  volume       = 45,
  number       = 02,
  issn         = {1558-0814},
  pages        = {30-36},
  abstract     = {{The CAP theorem is one example of a more general tradeoff between safety and liveness in unreliable
                  systems. Viewing CAP in this context provides insight into the inherent tradeoffs and the manner in
                  which they can be circumvented in practice.}},
  keywords     = {distributed computing, cap theorem, fault tolerance},
  doi          = {10.1109/MC.2011.389},
  publisher    = {IEEE Computer Society},
  address      = {Los Alamitos, CA, USA},
  month        = 2
}

@misc{2021facebookBGP,
  title        = { More details about the October 4 outage},
  url          = {https://engineering.fb.com/2021/10/05/networking-traffic/outage-details/},
  journal      = {Engineering at Meta},
  publisher    = {Meta},
  author       = {Janardhan, Santosh},
  year         = 2021,
  month        = {Oct}
}

@misc{2016nasaSSI,
  title        = { New Solar System Internet Technology Debuts on the International Space Station},
  url          =
                  {https://www.nasa.gov/feature/new-solar-system-internet-technology-debuts-on-the-international-space-station},
  journal      = {NASA.gov},
  publisher    = {NASA},
  year         = 2016,
  month        = {Jun}
}

@article{2017robinsonCanonical,
  title        = {Sheaves are the canonical data structure for sensor integration},
  journal      = {Information Fusion},
  volume       = 36,
  pages        = {208-224},
  year         = 2017,
  issn         = {1566-2535},
  doi          = {https://doi.org/10.1016/j.inffus.2016.12.002},
  url          = {https://www.sciencedirect.com/science/article/pii/S156625351630207X},
  author       = {Michael Robinson},
  keywords     = {Sheaf, Sensor integration, Mosaic, Semantic fusion, Heterogeneous data source, Cohomology},
  abstract     = {A sensor integration framework should be sufficiently general to accurately represent many sensor
                  modalities, and also be able to summarize information in a faithful way that emphasizes important,
                  actionable information. Few approaches adequately address these two discordant requirements. The
                  purpose of this expository paper is to explain why sheaves are the canonical data structure for sensor
                  integration and how the mathematics of sheaves satisfies our two requirements. We outline some of the
                  powerful inferential tools that are not available to other representational frameworks.}
}

@article{2020robinsonPseudometric,
  author       = {Robinson, Michael},
  year         = 2020,
  month        = 06,
  pages        = 2,
  title        = {Assignments to sheaves of pseudometric spaces},
  volume       = 2,
  journal      = {Compositionality},
  doi          = {10.32408/compositionality-2-2}
}

@book{10.5555/2060081,
  author       = {Awodey, Steve},
  title        = {Category Theory},
  year         = 2010,
  isbn         = 0199237182,
  publisher    = {Oxford University Press, Inc.},
  address      = {USA},
  edition      = {2nd},
  abstract     = {Category theory is a branch of abstract algebra with incredibly diverse applications. This text and
                  reference book is aimed not only at mathematicians, but also researchers and students of computer
                  science, logic, linguistics, cognitive science, philosophy, and any of the other fields in which the
                  ideas are being applied. Containing clear definitions of the essential concepts, illuminated with
                  numerous accessible examples, and providing full proofs of all important propositions and theorems,
                  this book aims to make the basic ideas, theorems, and methods of category theory understandable to
                  this broad readership. Although assuming few mathematical pre-requisites, the standard of mathematical
                  rigour is not compromised. The material covered includes the standard core of categories; functors;
                  natural transformations; equivalence; limits and colimits; functor categories; representables;
                  Yoneda's lemma; adjoints; monads. An extra topic of cartesian closed categories and the
                  lambda-calculus is also provided - a must for computer scientists, logicians and linguists!This Second
                  Edition contains numerous revisions to the original text, including expanding the exposition, revising
                  and elaborating the proofs, providing additional diagrams, correcting typographical errors and,
                  finally, adding an entirely new section on monoidal categories. Nearly a hundred new exercises have
                  also been added, many with solutions, to make the book more useful as a course text and for
                  self-study.}
}

@article{1984:end-to-end,
  author       = {Saltzer, J. H. and Reed, D. P. and Clark, D. D.},
  title        = {End-to-end arguments in system design},
  year         = 1984,
  issue_date   = {Nov. 1984},
  publisher    = {Association for Computing Machinery},
  address      = {New York, NY, USA},
  volume       = 2,
  number       = 4,
  issn         = {0734-2071},
  url          = {https://doi.org/10.1145/357401.357402},
  doi          = {10.1145/357401.357402},
  journal      = {ACM Trans. Comput. Syst.},
  month        = 11,
  pages        = {277–288},
  numpages     = 12,
  keywords     = {protocol design, design principles, data communication}
}

@incollection{2009:hci-definition,
  title        = {{Philosophy of Computing and Information Technology}},
  editor       = {Anthonie Meijers},
  booktitle    = {Philosophy of Technology and Engineering Sciences},
  publisher    = {North-Holland},
  address      = {Amsterdam},
  pages        = {1341-1407},
  year         = 2009,
  series       = {Handbook of the Philosophy of Science},
  issn         = 18789846,
  doi          = {https://doi.org/10.1016/B978-0-444-51667-1.50051-3},
  url          = {https://www.sciencedirect.com/science/article/pii/B9780444516671500513},
  author       = {Philip Brey and Johnny Hartz Søraker},
  abstract     = {Publisher Summary Philosophy has been described as having taken a “computational turn,” referring to
                  the ways in which computers and information technology throw new light upon traditional philosophical
                  issues, provide new tools and concepts for philosophical reasoning, and pose theoretical and practical
                  questions that cannot readily be approached within traditional philosophical frameworks. As such,
                  computer technology is arguably the technology that has had the most profound impact on
                  philosophy. Philosophers have studied computer technology and its philosophical implications
                  extensively. Philosophers have discovered computers and information technology (IT) as research
                  topics, and a wealth of research is taking place on philosophical issues in relation to these
                  technologies. The research agenda is broad and diverse. Issues that are studied include the nature of
                  computational systems, the ontological status of virtual worlds, the limitations of artificial
                  intelligence, philosophical aspects of data modeling, the political regulation of cyberspace, the
                  epistemology of Internet information, ethical aspects of information privacy and security, and many
                  more.}
}

@incollection{2021:intro-dtn,
  title        = {{An Introduction to Delay and Disruption Tolerant Networks (DTNs)}},
  editor       = {Joel J.P.C. Rodrigues},
  booktitle    = {Advances in Delay-Tolerant Networks (DTNs) (Second Edition)},
  publisher    = {Woodhead Publishing},
  edition      = {Second Edition},
  pages        = {1-20},
  year         = 2021,
  series       = {Woodhead Publishing Series in Electronic and Optical Materials},
  isbn         = {978-0-08-102793-6},
  doi          = {https://doi.org/10.1016/B978-0-08-102793-6.00001-1},
  url          = {https://www.sciencedirect.com/science/article/pii/B9780081027936000011},
  author       = {Joel J.P.C. Rodrigues and Vasco N.G.J. Soares},
  keywords     = {Delay-tolerant networks, Disruption-tolerant networks, DTN, Network architecture, Application
                  scenarios, Routing protocols, Store-carry-and-forward},
  abstract     = {Delay and disruption tolerant networking (DTN) is an exciting research topic that has attracted
                  increasing attention from many researchers. It focuses on the design, construction, performance
                  evaluation, and application of architectures, services, and protocols to achieve interoperability
                  between heterogeneous, intermittently connected networks where applications tolerate delays beyond
                  conventional IP networks and even some data loss. DTNs may be deployed in vastly diverse environments
                  including, but not limited to, interplanetary networking, military and tactical systems, disaster
                  recovery networks, wildlife tracking/monitoring sensor networks, vehicular communication, and
                  communication in remote and rural areas, and developing countries. The chapter starts with a review of
                  the DTN architecture and its main concepts. Further, DTN application scenarios are described and,
                  finally, the chapter classifies and presents representative routing protocols for DTN-based networks.}
}

@article{2017:cajun-navy-rumors,
  author       = {{WGNO Web Desk}},
  date         = {2017-08-29},
  year         = 2017,
  title        = {{Cajun Navy says No Shots Fired at Rescuers; Statements Made by Another Rescue Group}},
  journal      = {WGNO},
  url          =
                  {https://wgno.com/us-world-news/update-cajun-navy-says-no-shots-fired-at-rescuers-statements-made-by-another-rescue-group/},
  urldate      = {2024-09-17}
}

@article{2022:dect-2020-nr,
  author       = {Kovalchukov, Roman and Moltchanov, Dmitri and Pirskanen, Juho and Säe, Joonas and Numminen, Jussi and
                  Koucheryavy, Yevgeni and Valkama, Mikko},
  year         = 2022,
  month        = 06,
  pages        = {58-64},
  title        = {{DECT-2020 New Radio: The Next Step toward 5G Massive Machine-Type Communications}},
  volume       = 60,
  journal      = {IEEE Communications Magazine},
  doi          = {10.1109/MCOM.001.2100375}
}


% Datatracker information for RFCs on the Legacy Stream is unfortunately often
% incorrect. Please correct the bibtex below based on the information in the
% actual RFC at https://rfc-editor.org/rfc/rfc1128.txt

@misc{rfc1128,
  series       = {Request for Comments},
  number       = 1128,
  howpublished = {RFC 1128},
  publisher    = {RFC Editor},
  doi          = {10.17487/RFC1128},
  url          = {https://www.rfc-editor.org/info/rfc1128},
  author       = {David Mills},
  title        = {{Measured Performance of the Network Time Protocol in the Internet system}},
  year         = 1989,
  month        = oct,
  abstract     = {This paper describes a series of experiments involving over 100,000 hosts of the Internet system and
                  located in the U.S., Europe and the Pacific. The experiments are designed to evaluate the
                  availability, accuracy and reliability of international standard time distribution using the DARPA/NSF
                  Internet and the Network Time Protocol (NTP), which is specified in RFC-1119. NTP is designed
                  specifically for use in a large, diverse internet system operating at speeds from mundane to
                  lightwave. In NTP a distributed subnet of time servers operating in a self-organizing, hierarchical,
                  master-slave configuration exchange precision timestamps in order to synchronize subnet clocks to each
                  other and national time standards via wire or radio. The experiments are designed to locate Internet
                  hosts and gateways that provide time by one of three time distribution protocols and evaluate the
                  accuracy of their indications. For those hosts that support NTP, the experiments determine the
                  distribution of errors and other statistics over paths spanning major portions of the globe. Finally,
                  the experiments evaluate the accuracy and reliability of precision timekeeping using NTP and typical
                  Internet paths involving DARPA, NSFNET and other agency networks. The experiments demonstrate that
                  timekeeping accuracy throughout most portions of the Internet can be ordinarily maintained to within a
                  few tens of milliseconds, even in cases of failure or disruption of clocks, time servers or
                  networks. This memo does not specify a standard.},
}

@article{1983:osi-reference-model,
  author       = {Day, J.D. and Zimmermann, H.},
  journal      = {Proceedings of the IEEE},
  title        = {{The OSI Reference Model}},
  year         = 1983,
  volume       = 71,
  number       = 12,
  pages        = {1334-1340},
  keywords     = {Open systems;Standards development;ISO standards;Communication standards;Computer networks;Standards
                  organizations;Protocols;Springs;ARPANET;Packet switching},
  doi          = {10.1109/PROC.1983.12775}
}

@article{1995:causal-memory,
  title        = {Causal Memory: Definitions, Implementation, and Programming},
  author       = {Mustaque Ahamad and Gil Neiger and James E. Burns and Prince Kohli and Phillip W. Hutto},
  journal      = {Distributed Computing},
  year         = 1995,
  volume       = 9,
  pages        = {37-49},
  url          = {https://api.semanticscholar.org/CorpusID:6435056}
}

@phdthesis{1992:golding-thesis,
  author       = {Golding, Richard Andrew},
  title        = {Weak-Consistency Group Communication and Membership},
  year         = 1992,
  publisher    = {University of California at Santa Cruz},
  address      = {USA},
  abstract     = {Many distributed systems for wide-area networks can be built conveniently, and operate efficiently and
                  correctly, using a weak consistency group communication mechanism. This mechanism organizes a set of
                  principals into a single logical entity, and provides methods to multicast messages to the members. A
                  weak consistency distributed system allows the principals in the group to differ on the value of
                  shared state at any given instant, as long as they will eventually converge to a single, consistent
                  value. A group containing many principals and using weak consistency can provide the reliability,
                  performance, and scalability necessary for wide-area systems. I have developed a framework for
                  constructing group communication systems, for classifying existing distributed system tools, and for
                  constructing and reasoning about a particular group communication model. It has four components:
                  message delivery, message ordering, group membership, and the application. Each component may have a
                  different implementation, so that the group mechanism can be tailored to application requirements.The
                  framework supports a new message delivery protocol, called timestamped anti-entropy, which provides
                  reliable, eventual message delivery; is efficient; and tolerates most transient processor and network
                  failures. It can be combined with message ordering implementations that provide ordering guarantees
                  ranging from unordered to total, causal delivery. A new group membership protocol completes the set,
                  providing temporarily inconsistent membership views resilient to up to k simultaneous principal
                  failures.The Refdbms distributed bibliographic database system, which has been constructed using this
                  framework, is used as an example. Refdbms databases can be replicated on many different sites, using
                  the group communication system described here.},
  note         = {UMI Order No. GAX93-12435}
}

@misc{rfc3986,
  series       = {Request for Comments},
  number       = 3986,
  howpublished = {RFC 3986},
  publisher    = {RFC Editor},
  doi          = {10.17487/RFC3986},
  url          = {https://www.rfc-editor.org/info/rfc3986},
  author       = {Tim Berners-Lee and Roy T. Fielding and Larry M Masinter},
  title        = {{Uniform Resource Identifier (URI): Generic Syntax}},
  pagetotal    = 61,
  year         = 2005,
  month        = jan,
  abstract     = {A Uniform Resource Identifier (URI) is a compact sequence of characters that identifies an abstract or
                  physical resource. This specification defines the generic URI syntax and a process for resolving URI
                  references that might be in relative form, along with guidelines and security considerations for the
                  use of URIs on the Internet. The URI syntax defines a grammar that is a superset of all valid URIs,
                  allowing an implementation to parse the common components of a URI reference without knowing the
                  scheme-specific requirements of every possible identifier. This specification does not define a
                  generative grammar for URIs; that task is performed by the individual specifications of each URI
                  scheme. {[}STANDARDS-TRACK{]}},
}

@mastersthesis{dyconits,
  title        = {{Design and Experimental Evaluation of a System based on Dynamic Conits for Scaling Minecraft-like
                  Environments}},
  author       = {Jesse Donkervliet},
  year         = 2018,
  month        = 1,
  address      = {Example City, CA},
  note         = {Available at \url{https://resolver.tudelft.nl/uuid:4045d6a2-87ae-4397-8898-8e992fa0652c}},
  school       = {Delft University of Technology},
  type         = {Master's thesis}
}

@article{1984:1sr,
  author       = {Attar, Rony and Bernstein, Philip A. and Goodman, Nathan},
  journal      = {IEEE Transactions on Software Engineering},
  title        = {Site Initialization, Recovery, and Backup in a Distributed Database System},
  year         = 1984,
  volume       = {SE-10},
  number       = 6,
  pages        = {645-650},
  keywords     = {Database systems;Concurrency control;Transaction databases;Contracts;Concurrent computing;Research and
                  development;Distributed database systems;fault recovery;site initialization},
  doi          = {10.1109/TSE.1984.5010293}
}

@Article{2023:towards-sdn-dtn,
  AUTHOR       = {Ta, Dominick and Booth, Stephanie and Dudukovich, Rachel},
  TITLE        = {Towards Software-Defined Delay Tolerant Networks},
  JOURNAL      = {Network},
  VOLUME       = 3,
  YEAR         = 2023,
  NUMBER       = 1,
  PAGES        = {15--38},
  URL          = {https://www.mdpi.com/2673-8732/3/1/2},
  ISSN         = {2673-8732},
  ABSTRACT     = {This paper proposes a Software-Defined Delay Tolerant Networking (SDDTN) architecture as a solution to
                  managing large Delay Tolerant Networking (DTN) networks in a scalable manner. This work is motivated
                  by the planned deployments of large DTN networks on the Moon and beyond in deep space. Current space
                  communication involves relatively few nodes and is heavily deterministic and scheduled, which will not
                  be true in the future. It is unclear how these large space DTN networks, consisting of inherently
                  intermittent links, will be able to adapt to dynamically changing network conditions. In addition to
                  the proposed SDDTN architecture, this paper explores data plane programming and the Programming
                  Protocol-Independent Packet Processors (P4) language as a possible method of implementing this SDDTN
                  architecture, enumerates the challenges of this approach, and presents intermediate results.},
  DOI          = {10.3390/network3010002}
}

@article{2016:sdn-battlefield,
  author       = {Nobre, Jéferson and Rosário, Denis and Both, Cristiano and Cerqueira, Eduardo and Gerla, Mario},
  year         = 2016,
  month        = 10,
  pages        = {152-157},
  title        = {Toward Software-Defined Battlefield Networking},
  volume       = 54,
  journal      = {IEEE Communications Magazine},
  doi          = {10.1109/MCOM.2016.7588285}
}

@article{2014:p4,
  author       = {Bosshart, Pat and Daly, Dan and Gibb, Glen and Izzard, Martin and McKeown, Nick and Rexford, Jennifer
                  and Schlesinger, Cole and Talayco, Dan and Vahdat, Amin and Varghese, George and Walker, David},
  title        = {P4: Programming Protocol-Independent Packet Processors},
  year         = 2014,
  issue_date   = {July 2014},
  publisher    = {Association for Computing Machinery},
  address      = {New York, NY, USA},
  volume       = 44,
  number       = 3,
  issn         = {0146-4833},
  url          = {https://doi.org/10.1145/2656877.2656890},
  doi          = {10.1145/2656877.2656890},
  abstract     = {P4 is a high-level language for programming protocol-independent packet processors. P4 works in
                  conjunction with SDN control protocols like OpenFlow. In its current form, OpenFlow explicitly
                  specifies protocol headers on which it operates. This set has grown from 12 to 41 fields in a few
                  years, increasing the complexity of the specification while still not providing the flexibility to add
                  new headers. In this paper we propose P4 as a strawman proposal for how OpenFlow should evolve in the
                  future. We have three goals: (1) Reconfigurability in the field: Programmers should be able to change
                  the way switches process packets once they are deployed. (2) Protocol independence: Switches should
                  not be tied to any specific network protocols. (3) Target independence: Programmers should be able to
                  describe packet-processing functionality independently of the specifics of the underlying hardware. As
                  an example, we describe how to use P4 to configure a switch to add a new hierarchical label.},
  journal      = {SIGCOMM Comput. Commun. Rev.},
  month        = jul,
  pages        = {87–95},
  numpages     = 9,
  keywords     = {sdn, reconfigurability, protocol-independent, p4}
}