LEADER 02430nam 2200505 450 001 9910818949203321 005 20200520144314.0 010 $a1-119-56341-0 010 $a1-119-56340-2 010 $a1-119-44028-9 035 $a(CKB)4100000007111270 035 $a(Au-PeEL)EBL5566694 035 $a(CaPaEBR)ebr11626311 035 $a(OCoLC)1061095092 035 $a(CaSebORM)9781848218529 035 $a(MiAaPQ)EBC5566694 035 $a(EXLCZ)994100000007111270 100 $a20181116d2018 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aDeterministic network calculus $efrom theory to practical implementation /$fAnne Bouillard, Marc Boyer, Euriell Le Corronc 205 $a1st edition 210 1$aLondon, UK :$cISTE ;$aHoboken, NJ :$cWiley,$d2018. 215 $a1 online resource (330 pages) 225 0 $aNetwork and telecommunications series 311 $a1-84821-852-4 330 $aDeterministic network calculus is a theory based on the (min,plus) algebra. Its aim is to compute worst-case performance bounds in communication networks. Our goal is to provide a comprehensive view of this theory and its recent advances, from its theoretical foundations to its implementations. The book is divided into three parts. The first part focuses on the (min,plus) framework and its algorithmic aspects. The second part defines the network calculus model and analyzes one server in isolation. Different service and scheduling policies are discussed, particularly when data is packetized. The third part is about network analyses. Pay burst only once and pay multiplexing only once phenomena are exhibited, and different analyses are proposed and compared. This includes the linear programming approaches that compute tight performance bounds. Finally, some partial results on the stability are detailed. 606 $aQueuing theory 606 $aComputer networks$xMathematical models 615 0$aQueuing theory. 615 0$aComputer networks$xMathematical models. 676 $a519.82 700 $aBouillard$b Anne$01690856 702 $aBoyer$b Marc 702 $aCorronc$b Euriell Le 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910818949203321 996 $aDeterministic network calculus$94066848 997 $aUNINA