LEADER 06606nam 2200757 450 001 9910456683903321 005 20200520144314.0 010 $a1-60783-996-2 035 $a(CKB)2550000000000187 035 $a(EBL)946554 035 $a(OCoLC)796382939 035 $a(SSID)ssj0000342919 035 $a(PQKBManifestationID)11258931 035 $a(PQKBTitleCode)TC0000342919 035 $a(PQKBWorkID)10285822 035 $a(PQKB)10986799 035 $a(MiAaPQ)EBC946554 035 $a(Au-PeEL)EBL946554 035 $a(CaPaEBR)ebr10359071 035 $a(CaBNVSL)mat09106117 035 $a(IEEE)9106117 035 $a(EXLCZ)992550000000000187 100 $a20200729d2009 uy 101 0 $aeng 135 $aurcn||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aSIP $eunderstanding the Session Initiation Protocol /$fAlan B. Johnston 205 $a3rd ed. 210 1$aBoston :$cArtech House,$dİ2009. 210 2$a[Piscataqay, New Jersey] :$cIEEE Xplore,$d[2009] 215 $a1 online resource (426 p.) 225 1 $aArtech House telecommunications series 300 $aDescription based upon print version of record. 311 $a1-60783-995-4 320 $aIncludes bibliographical references and index. 327 $aSIP: Understanding the Session Initiation Protocol Third Edition; Contents; Foreword to the First Edition; Preface to the Third Edition; Preface to the Second Edition; Preface to the First Edition; 1 SIP and the Internet; 1.1 Signaling Protocols; 1.2 Internet Multimedia Protocol Stack; 1.2.1 Physical Layer; 1.2.2 Data/Link Layer; 1.2.3 Network Layer; 1.2.4 Transport Layer; 1.2.5 Application Layer; 1.2.6 Utility Applications; 1.2.7 Multicast; 1.3 Internet Names; 1.4 URLs, URIs, and URNs; 1.5 Domain Name Service; 1.5.1 DNS Resource Records; 1.5.2 Address Resource Records (A or AAAA) 327 $a1.5.3 Service Resource Records (SRV)1.5.4 Naming Authority Pointer Resource Records (NAPTR); 1.5.5 DNS Resolvers; 1.6 Global Open Standards; 1.7 Internet Standards Process; 1.8 A Brief History of SIP; 1.9 Conclusion; References; 2 Introduction to SIP; 2.1 A Simple Session Establishment Example; 2.2 SIP Call with a Proxy Server; 2.3 SIP Registration Example; 2.4 SIP Presence and Instant Message Example; 2.5 Message Transport; 2.5.1 UDP Transport; 2.5.2 TCP Transport; 2.5.3 TLS Transport; 2.5.4 SCTP Transport; 2.6 Transport Protocol Selection; 2.7 Conclusion; 2.8 Questions; References 327 $a3 SIP Clients and Servers 3.1 SIP User Agents; 3.2 Presence Agents; 3.3 Back-to-Back User Agents; 3.4 SIP Gateways; 3.5 SIP Servers; 3.5.1 Proxy Servers; 3.5.2 Redirect Servers; 3.5.3 Registrar Servers; 3.6 Uniform Resource Indicators; 3.7 Acknowledgment of Messages; 3.8 Reliability; 3.9 Multicast Support; 3.10 Conclusion; 3.11 Questions; References; 4 SIP Request Messages; 4.1 Methods; 4.1.1 INVITE; 4.1.2 REGISTER; 4.1.3 BYE; 4.1.4 ACK; 4.1.5 CANCEL; 4.1.6 OPTIONS; 4.1.7 SUBSCRIBE; 4.1.8 NOTIFY; 4.1.9 PUBLISH; 4.1.10 REFER; 4.1.11 MESSAGE; 4.1.12 INFO; 4.1.13 PRACK; 4.1.14 UPDATE 327 $a4.2 URI and URL Schemes Used by SIP 4.2.1 SIP and SIPS URIs; 4.2.2 Telephone URLs; 4.2.3 Presence and Instant Messaging URLs; 4.3 Tags; 4.4 Message Bodies; 4.5 Conclusion; 4.6 Questions; References; 5 SIP Response Messages; 5.1 Informational; 5.1.1 100 Trying; 5.1.2 180 Ringing; 5.1.3 181 Call is Being Forwarded; 5.1.4 182 Call Queued; 5.1.5 183 Session Progress; 5.2 Success; 5.2.1 200 OK; 5.2.2 202 Accepted; 5.2.3 204 No Notification; 5.3 Redirection; 5.3.1 300 Multiple Choices; 5.3.2 301 Moved Permanently; 5.3.3 302 Moved Temporarily; 5.3.4 305 Use Proxy; 5.3.5 380 Alternative Service 327 $a5.4 Client Error 5.4.1 400 Bad Request; 5.4.2 401 Unauthorized; 5.4.3 402 Payment Required; 5.4.4 403 Forbidden; 5.4.5 404 Not Found; 5.4.6 405 Method Not Allowed; 5.4.7 406 Not Acceptable; 5.4.8 407 Proxy Authentication Required; 5.4.9 408 Request Timeout; 5.4.10 409 Conflict; 5.4.11 410 Gone; 5.4.12 411 Length Required; 5.4.13 412 Conditional Request Failed; 5.4.14 413 Request Entity Too Large; 5.4.15 414 Request-URI Too Long; 5.4.16 415 Unsupported Media Type; 5.4.17 416 Unsupported URI Scheme; 5.4.18 417 Unknown Resource Priority; 5.4.19 420 Bad Extension; 5.4.20 421 Extension Required 330 3 $aNow in its third edition, the ground-breaking Artech House bestseller SIP: Understanding the Session Initiation Protocol offers you the most comprehensive and current understanding of this revolutionary protocol for call signaling and IP Telephony. The third edition has been significantly expanded with brand new chapters on NAT traversal, SIP security, services in SIP, presence and instant messaging, Peer-to-Peer SIP, and an introduction to ABNF and XML. This cutting-edge book shows you how SIP provides a highly-scalable and cost-effective way to offer new and exciting telecommunication feature sets, helping you design your "next generation" network and develop new applications and software stacks. Other key discussions include SIP as a key component in the Internet multimedia conferencing architecture, request and response messages, devices in a typical network, types of servers, SIP headers, comparisons with existing signaling protocols including H.323, related protocols SDP (Session Description Protocol) and RTP (Real-time Transport Protocol), and the future direction of SIP. Detailed call flow diagrams illustrate how this technology works with other protocols such as H.323 and ISUP. Moreover, this book covers SIP RFC 3261 and the complete set of SIP extension RFCs.$cPublisher abstract. 410 0$aArtech House telecommunications library. 517 3 $aUnderstanding the Session Initiation Protocol 606 $aComputer network protocols 606 $aInstant messaging$xComputer programs 606 $aInternet telephony$xComputer programs 606 $aMultimedia systems$xComputer programs 606 $aSession Initiation Protocol (Computer network protocol) 608 $aElectronic books. 615 0$aComputer network protocols. 615 0$aInstant messaging$xComputer programs. 615 0$aInternet telephony$xComputer programs. 615 0$aMultimedia systems$xComputer programs. 615 0$aSession Initiation Protocol (Computer network protocol) 676 $a004.62 676 $a620/.50289 700 $aJohnston$b Alan B.$0523308 801 0$bCaBNVSL 801 1$bCaBNVSL 801 2$bCaBNVSL 906 $aBOOK 912 $a9910456683903321 996 $aSIP$91222864 997 $aUNINA LEADER 05264nam 22007575 450 001 996465871703316 005 20200701224957.0 010 $a3-540-45123-4 024 7 $a10.1007/3-540-45123-4 035 $a(CKB)1000000000211264 035 $a(SSID)ssj0000321916 035 $a(PQKBManifestationID)11246234 035 $a(PQKBTitleCode)TC0000321916 035 $a(PQKBWorkID)10281101 035 $a(PQKB)10222688 035 $a(DE-He213)978-3-540-45123-5 035 $a(MiAaPQ)EBC3072461 035 $a(PPN)155196014 035 $a(EXLCZ)991000000000211264 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Pattern Matching$b[electronic resource] $e11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings /$fedited by Raffaele Giancarlo, David Sankoff 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (XI, 426 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1848 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-67633-3 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Lectures -- Identifying and Filtering Near-Duplicate Documents -- Machine Learning for Efficient Natural-Language Processing -- Browsing around a Digital Library: Today and Tomorrow -- Summer School Lectures -- Algorithmic Aspects of Speech Recognition: A Synopsis -- Some Results on Flexible-Pattern Discovery -- Contributed Papers -- Explaining and Controlling Ambiguity in Dynamic Programming -- A Dynamic Edit Distance Table -- Parametric Multiple Sequence Alignment and Phylogeny Construction -- Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment -- A Polynomial Time Approximation Scheme for the Closest Substring Problem -- Approximation Algorithms for Hamming Clustering Problems -- Approximating the Maximum Isomorphic Agreement Subtree Is Hard -- A Faster and Unifying Algorithm for Comparing Trees -- Incomplete Directed Perfect Phylogeny -- The Longest Common Subsequence Problem for Arc-Annotated Sequences -- Boyer?Moore String Matching over Ziv-Lempel Compressed Text -- A Boyer?Moore Type Algorithm for Compressed Pattern Matching -- Approximate String Matching over Ziv?Lempel Compressed Text -- Improving Static Compression Schemes by Alphabet Extension -- Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments -- A Lower Bound for the Breakpoint Phylogeny Problem -- Structural Properties and Tractability Results for Linear Synteny -- Shift Error Detection in Standardized Exams -- An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC) -- The Combinatorial Partitioning Method -- Compact Suffix Array -- Linear Bidirectional On-Line Construction of Affix Trees -- Using Suffix Trees for Gapped Motif Discovery -- Indexing Text with Approximate q-Grams -- Simple Optimal String Matching Algorithm -- Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts -- Periods and Quasiperiods Characterization -- Finding Maximal Quasiperiodicities in Strings -- On the Complexity of Determining the Period of a String. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1848 606 $aPattern recognition 606 $aComputers 606 $aAlgorithms 606 $aNatural language processing (Computer science) 606 $aInformation storage and retrieval 606 $aCombinatorics 606 $aPattern Recognition$3https://scigraph.springernature.com/ontologies/product-market-codes/I2203X 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aNatural Language Processing (NLP)$3https://scigraph.springernature.com/ontologies/product-market-codes/I21040 606 $aInformation Storage and Retrieval$3https://scigraph.springernature.com/ontologies/product-market-codes/I18032 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aPattern recognition. 615 0$aComputers. 615 0$aAlgorithms. 615 0$aNatural language processing (Computer science). 615 0$aInformation storage and retrieval. 615 0$aCombinatorics. 615 14$aPattern Recognition. 615 24$aTheory of Computation. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aNatural Language Processing (NLP). 615 24$aInformation Storage and Retrieval. 615 24$aCombinatorics. 676 $a006.4 702 $aGiancarlo$b Raffaele$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSankoff$b David$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465871703316 996 $aCombinatorial Pattern Matching$9772744 997 $aUNISA