LEADER 01372nas  2200361 n 450 
001 990008973400403321
005 20240229084548.0
011   $a1577-1954
035   $a000897340
035   $aFED01000897340
035   $a(Aleph)000897340FED01
035   $a000897340
091   $2CNR$aP 00054663
100   $a20161109b19491967km-y0itaa50------ba
101 0 $aspa
102   $aES
110   $aauu--------
200 1 $aHumanidades
207  1$a1949-1967
210   $aComillas$c[s.n.]
530 0 $aHumanidades
675   $a009
712 02$aUniversidad P$bComillas
801  0$aIT$bACNP$c20090723
859 4 $uhttp://acnp.cib.unibo.it/cgi-ser/start/it/cnr/dc-p1.tcl?catno=37110&person=false&language=ITALIANO&libr=&libr_th=unina1$zBiblioteche che possiedono il periodico
901   $aSE
912   $a990008973400403321
958   $aBRAU. Biblioteca di Ricerca di Area Umanistica$b1951-1954;1958;1960;$eEST. SPAGNA 16$fFLFBC
959   $aFLFBC
996   $aHumanidades$9796151
997   $aUNINA
AP1 8 $6866-01$aNA072 BRAU. Biblioteca di Ricerca di Area Umanistica$bEST. SPAGNA 16$ePiazza Bellini 56/60, 80133 Napoli (NA)$m(081) 2533948$nit
AP2 40$aacnp.cib.unibo.it$nACNP Italian Union Catalogue of Serials$uhttp://acnp.cib.unibo.it/cgi-ser/start/it/cnr/df-p.tcl?catno=37110&language=ITALIANO&libr=&person=&B=1&libr_th=unina&proposto=NO

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