LEADER 00911cam a2200217 i 4500 001 991004253637307536 005 20230601085326.0 008 980114t19271926it 00| | ita 040 $aBibl. Interfacoltà T. Pellegrino$bita 041 $aita 082 0 $a200.1 100 1 $aMazzini, Giuseppe,$d<1805-1872>$0293347 245 13$aLe idee sul problema religioso d'educazione negli scritti di Giuseppe Mazzini :$bpagine scelte, con introduzione e note ad uso degli Istituti magistrali /$ca cura di E. Paolo Lamanna 260 $aFirenze :$bSansoni,$c1927,$g(stampa 1926) 300 $aXXVIII, 214 p. ;$c20 cm 650 4$aMazzini, Giuseppe$xPensiero religioso 700 1 $aLamanna, E. Paolo 830 0$aBiblioteca di testi filosofici. 2., Letture filosofiche 912 $a991004253637307536 996 $aIdee sul problema religioso d'educazione negli scritti di Giuseppe Mazzini$9600538 997 $aUNISALENTO LEADER 05820nam 2200829 a 450 001 9910815238703321 005 20240313144207.0 010 $a9781118602911 010 $a1118602919 010 $a9781118602850 010 $a1118602854 010 $a9781118602836 010 $a1118602838 010 $a9781299187801 010 $a1299187803 035 $a(CKB)2550000001005910 035 $a(EBL)1124673 035 $a(OCoLC)828298911 035 $a(SSID)ssj0000831963 035 $a(PQKBManifestationID)11421096 035 $a(PQKBTitleCode)TC0000831963 035 $a(PQKBWorkID)10881247 035 $a(PQKB)10765859 035 $a(OCoLC)842860158 035 $a(MiAaPQ)EBC1124673 035 $a(Au-PeEL)EBL1124673 035 $a(CaPaEBR)ebr10660582 035 $a(CaONFJC)MIL450030 035 $a(PPN)181711699 035 $a(OCoLC)742234193 035 $a(FINmELB)ELB178785 035 $a(Perlego)1011219 035 $a(EXLCZ)992550000001005910 100 $a20110719d2011 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aNetwork performance analysis /$fThomas Bonald, Mathieu Feuillet 205 $a1st ed. 210 $aLondon $cISTE ;$aHoboken, N.J. $cJohn Wiley$d2011 215 $a1 online resource (267 p.) 225 1 $aISTE 300 $aDescription based upon print version of record. 311 08$a9781848213128 311 08$a1848213123 320 $aIncludes bibliographical references and index. 327 $aCover; Title Page; Copyright Page; Table of Contents; Preface; Chapter 1. Introduction; 1.1. Motivation; 1.2. Networks; 1.3. Traffic; 1.4. Queues; 1.5. Structure of the book; 1.6. Bibliography; Chapter 2. Exponential Distribution; 2.1. Definition; 2.2. Discrete analog; 2.3. An amnesic distribution; 2.4. Minimum of exponential variables; 2.5. Sum of exponential variables; 2.6. Random sum of exponential variables; 2.7. A limiting distribution; 2.8. A ""very"" random variable; 2.9. Exercises; 2.10. Solution to the exercises; Chapter 3. Poisson Processes; 3.1. Definition; 3.2. Discrete analog 327 $a3.3. An amnesic process3.4. Distribution of the points of a Poisson process; 3.5. Superposition of Poisson processes; 3.6. Subdivision of a Poisson process; 3.7. A limiting process; 3.8. A ""very"" random process; 3.9. Exercises; 3.10. Solution to the exercises; Chapter 4. Markov Chains; 4.1. Definition; 4.2. Transition probabilities; 4.3. Periodicity; 4.4. Balance equations; 4.5. Stationary measure; 4.6. Stability and ergodicity; 4.7. Finite state space; 4.8. Recurrence and transience; 4.9. Frequency of transition; 4.10. Formula of conditional transitions; 4.11. Chain in reverse time 327 $a4.12. Reversibility4.13. Kolmogorov's criterion; 4.14. Truncation of a Markov chain; 4.15. Random walk; 4.16. Exercises; 4.17. Solution to the exercises; Chapter 5. Markov Processes; 5.1. Definition; 5.2. Transition rates; 5.3. Discrete analog; 5.4. Balance equations; 5.5. Stationary measure; 5.6. Stability and ergodicity; 5.7. Recurrence and transience; 5.8. Frequency of transition; 5.9. Virtual transitions; 5.10. Embedded chain; 5.11. Formula of conditional transitions; 5.12. Process in reverse time; 5.13. Reversibility; 5.14. Kolmogorov's criterion; 5.15. Truncation of a reversible process 327 $a5.16. Product of independent Markov processes5.17. Birth-death processes; 5.18. Exercises; 5.19. Solution to the exercises; Chapter 6. Queues; 6.1. Kendall's notation; 6.2. Traffic and load; 6.3. Service discipline; 6.4. Basic queues; 6.5. A general queue; 6.6. Little's formula; 6.7. PASTA property; 6.8. Insensitivity; 6.9. Pollaczek-Khinchin's formula; 6.10. The observer paradox; 6.11. Exercises; 6.12. Solution to the exercises; Chapter 7. Queuing Networks; 7.1. Jackson networks; 7.2. Traffic equations; 7.3. Stationary distribution; 7.4. MUSTA property; 7.5. Closed networks 327 $a7.6. Whittle networks7.7. Kelly networks; 7.8. Exercises; 7.9. Solution to the exercises; Chapter 8. Circuit Traffic; 8.1. Erlang's model; 8.2. Erlang's formula; 8.3. Engset's formula; 8.3.1. Model without blocking; 8.3.2. Model with blocking; 8.4. Erlang's waiting formula; 8.4.1. Waiting probability; 8.4.2. Mean waiting time; 8.5. The multiclass Erlang model; 8.6. Kaufman-Roberts formula; 8.7. Network models; 8.8. Decoupling approximation; 8.9. Exercises; 8.10. Solutions to the exercises; Chapter 9. Real-time Traffic; 9.1. Flows and packets; 9.2. Packet-level model; 9.3. Flow-level model 327 $a9.4. Congestion rate 330 $aThe book presents some key mathematical tools for the performance analysis of communication networks and computer systems.Communication networks and computer systems have become extremely complex. The statistical resource sharing induced by the random behavior of users and the underlying protocols and algorithms may affect Quality of Service.This book introduces the main results of queuing theory that are useful for analyzing the performance of these systems. These mathematical tools are key to the development of robust dimensioning rules and engineering methods. A number of examples i 410 0$aISTE 606 $aComputer networks$xEvaluation 606 $aNetwork performance (Telecommunication) 606 $aQueuing theory 615 0$aComputer networks$xEvaluation. 615 0$aNetwork performance (Telecommunication) 615 0$aQueuing theory. 676 $a621.382 700 $aBonald$b Thomas$01717588 701 $aFeuillet$b Mathieu$01717589 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910815238703321 996 $aNetwork performance analysis$94113940 997 $aUNINA