LEADER 04601nam a2200457Ii 4500 001 991003243519707536 006 m d 007 cr cn||||||||| 008 070806s2005 ne a fsb 001 0 eng d 020 $a9780120884773 020 $a0120884771 035 $ab13654366-39ule_inst 037 $a107855:107894$bElsevier Science & Technology$nhttp://www.sciencedirect.com 040 $aOPELS$cOPELS 049 $aTEFA 082 04$a004.62$222 100 1 $aVarghese, George,$d1960-$0627490 245 10$aNetwork algorithmics$h[electronic resource] :$ban interdisciplinary approach to designing fast networked devices /$cGeorge Varghese. 260 $aAmsterdam ;$aBoston :$bElsevier/Morgan Kaufmann,$cc2005. 300 $axxiv, 465 p. :$bill. ;$c25 cm. 440 4$aThe Morgan Kaufmann series in networking 504 $aIncludes bibliographical references (p. 445-456) and index. 505 0 $a1 Introducing Network Algorithmics -- 2 Network Implementation Models -- 3 Fifteen Implementation Principles -- 4 Principles in Action -- 5 Copying Data -- 6 Transfering Control -- 7 Maintaining Timers -- 8 Demultiplexing -- 9 Protocol Processing -- 10 Exact Match Lookups -- 11 Prefix Match Lookups -- 12 Packet Classification -- 13 Switching -- 14 Scheduling Packets -- 15 Routers as Distributed Systems -- 16 Measuring Network Traffic -- 17 Network Security -- 18 Conclusions -- Appendix A Detailed Models. 520 $aIn designing a network device, you make dozens of decisions that affect the speed with which it will performsometimes for better, but sometimes for worse. Network Algorithmics provides a complete, coherent methodology for maximizing speed while meeting your other design goals. Author George Varghese begins by laying out the implementation bottlenecks that are most often encountered at four disparate levels of implementation: protocol, OS, hardware, and architecture. He then derives 15 solid principlesranging from the commonly recognized to the groundbreakingthat are key to breaking these bottlenecks. The rest of the book is devoted to a systematic application of these principles to bottlenecks found specifically in endnodes, interconnect devices, and specialty functions such as security and measurement that can be located anywhere along the network. This immensely practical, clearly presented information will benefit anyone involved with network implementation, as well as students who have made this work their goal. FOR INSTRUCTORS: To obtain access to the solutions manual for this title simply register on our textbook website (textbooks.elsevier.com)and request access to the Computer Science subject area. Once approved (usually within one business day) you will be able to access all of the instructor-only materials through the "Instructor Manual" link on this book's academic web page at textbooks.elsevier.com. Addresses the bottlenecks found in all kinds of network devices, (data copying, control transfer, demultiplexing, timers, and more) and offers ways to break them. Presents techniques suitable specifically for endnodes, including Web servers. Presents techniques suitable specifically for interconnect devices, including routers, bridges, and gateways. Written as a practical guide for implementers but full of valuable insights for students, teachers, and researchers. Includes end-of-chapter summaries and exercises. 533 $aElectronic reproduction.$bAmsterdam :$cElsevier Science & Technology,$d2007.$nMode of access: World Wide Web.$nSystem requirements: Web browser.$nTitle from title screen (viewed on Aug. 2, 2007).$nAccess may be restricted to users at subscribing institutions. 650 0$aComputer network protocols. 650 6$aProtocoles de réseaux d'ordinateurs. 650 17$aComputernetwerken.$2gtt 650 17$aAlgoritmen.$2gtt 650 17$aWachttijdproblemen.$2gtt 655 7$aElectronic books.$2local 776 1 $cOriginal$z0120884771$z9780120884773$w(DLC) 2005273800$w(OCoLC)56912632 856 40$3Referex$uhttp://www.sciencedirect.com/science/book/9780120884773$zAn electronic book accessible through the World Wide Web; click for information 856 42$zPublisher description$uhttp://catdir.loc.gov/catdir/enhancements/fy0626/2005273800-d.html 856 41$zTable of contents$uhttp://catdir.loc.gov/catdir/enhancements/fy0626/2005273800-t.html 907 $a.b13654366$b24-02-22$c24-01-08 912 $a991003243519707536 994 $aC0$bTEF 996 $aNetwork algorithmics$91212761 997 $aUNISALENTO 998 $ale029$b24-01-08$cm$dm $e-$feng$gne $h0$i0 LEADER 01249oam 2200373Ka 450 001 9910692120303321 005 20040129134351.0 035 $a(CKB)5470000002352234 035 $a(OCoLC)54106041 035 9 $aocm54106041 035 $a(OCoLC)995470000002352234 035 $a(EXLCZ)995470000002352234 100 $a20040129d2001 ua 0 101 0 $aeng 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aSheriffs' offices 1999$b[electronic resource] /$fBrian A. Reaves and Matthew J. Hickman 210 1$a[Washington, D.C.] :$cU.S. Dept. of Justice, Office of Justice Programs, Bureau of Justice Statistics,$d[2001] 300 $aTitle from PDF title screen (viewed on Jan. 29, 2004). 606 $aSheriffs$zUnited States$vStatistics 606 $aLaw enforcement$zUnited States$vStatistics 608 $aStatistics.$2lcgft 615 0$aSheriffs 615 0$aLaw enforcement 700 $aReaves$b Brian$01381363 701 $aHickman$b Matthew J$01381364 712 02$aUnited States.$bBureau of Justice Statistics. 801 0$bGPO 801 1$bGPO 906 $aDOCUMENT 912 $a9910692120303321 996 $aSheriffs' offices 1999$93423905 997 $aUNINA