LEADER 00000cam a22005771i 4500 
003    OCoLC 
005    20240129213017.0 
006    m     o  d         
007    cr ||||||||||| 
008    181003s2018    enk     o     000 0 eng d 
015    GBB8J0240|2bnb 
016 7  019087278|2Uk 
020    9781119563419|q(ePub ebook) 
020    1119563410 
020    9781119563402|q(PDF ebook) 
020    1119563402 
020    |q(hbk.) 
029 0  UKMGB|b019087278 
035    (OCoLC)1088911394 
037    9781119563419|bWiley 
040    UKMGB|beng|erda|epn|cUKMGB|dOCLCO|dUKAHL|dOCLCF|dOTZ
       |dOCLCQ|dTOH|dOCLCO|dOCLCQ|dOCLCO|dOCLCL 
049    INap 
082 04 519.82 
082 04 519.82|223 
099    eBook O'Reilly for Public Libraries 
100 1  Bouillard, Anne,|eauthor. 
245 10 Deterministic network calculus /|cAnne Bouillard, Marc 
       Boyer, Euriell Le Corronc.|h[O'Reilly electronic resource]
250    1st 
264  1 London :|bWiley-ISTE,|c2018. 
300    1 online resource 
336    text|btxt|2rdacontent 
337    computer|bc|2rdamedia 
338    online resource|bcr|2rdacarrier 
500    <P>1. Basic Model: Single Server, Single Flow.<br /> <br /
       > Part 1. (min, plus) Functions and Algorithms <br /> 2. 
       The (min, plus) Functions Semi-ring.<br /> 3. Sub-classes 
       of Functions.<br /> 4. Efficient Computations for (min, 
       plus) Operators. <br /> <br /> Part 2. Network Calculus: 
       Local Analysis <br /> 5. Network Calculus Basics: a Server
       Crossed by a Single Flow. <br /> 6. Single Flow Crossing 
       Several Servers.<br /> 7. Multiple Flows Crossing One 
       Server.<br /> 8. Packets.<br /> 9. A Hierarchy of Service 
       Curves.<br /> <br /> Part 3. Network Calculus: Global 
       Analysis <br /> 10. Modular Analysis: Computing with 
       Curves.<br /> 11. Tight Worst-case Performances.<br /> 12.
       Stability in Networks with Cyclic Dependencies.</p> 
520    Deterministic 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. 
588 0  CIP data; resource not viewed. 
590    O'Reilly|bO'Reilly Online Learning: Academic/Public 
       Library Edition 
650  0 Queuing theory. 
650  0 Calculus. 
650  6 Théorie des files d'attente. 
650  6 Calcul infinitésimal. 
650  7 calculus.|2aat 
650  7 Calculus|2fast 
650  7 Queuing theory|2fast 
700 1  Boyer, Marc,|eauthor. 
700 1  Le Corronc, Euriell,|eauthor. 
776 08 |iPrint version :|z9781848218529 
856 40 |uhttps://ezproxy.naperville-lib.org/login?url=https://
       learning.oreilly.com/library/view/~/9781848218529/?ar
       |zAvailalbe on O'Reilly for Public Libraries 
938    Askews and Holts Library Services|bASKH|nAH35216717 
938    Askews and Holts Library Services|bASKH|nAH35216716 
994    92|bJFN