Mathematical theory of connecting networks and telephone traffic /:
Mathematical theory of connecting networks and telephone traffic.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York :
Academic Press,
1965.
|
| Schriftenreihe: | Mathematics in science and engineering ;
v. 17. |
| Schlagworte: | |
| Online-Zugang: | Volltext Volltext |
| Zusammenfassung: | Mathematical theory of connecting networks and telephone traffic. |
| Beschreibung: | 1 online resource (xiv, 319 pages) : illustrations |
| Format: | Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. |
| Bibliographie: | Includes bibliographical references and indexes. |
| ISBN: | 9780080955230 0080955231 1282289772 9781282289772 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn316549754 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 090320s1965 nyua obs 001 0 eng d | ||
| 040 | |a OPELS |b eng |e pn |c OPELS |d N$T |d OCLCQ |d EBLCP |d IDEBK |d OCLCQ |d OPELS |d MHW |d OCLCQ |d OCLCE |d E7B |d OCLCQ |d OCLCO |d OCLCQ |d OCLCF |d DEBBG |d OCLCQ |d NLGGC |d YDXCP |d OCLCQ |d COO |d OCLCQ |d DEBSZ |d OCLCQ |d VTS |d STF |d OCLCQ |d K6U |d OCLCO |d OCLCQ |d OCL |d OCLCO |d COA |d OCLCL |d OCLCQ | ||
| 019 | |a 301113310 |a 600555765 |a 646827440 |a 805950595 |a 823843565 |a 823912297 |a 824099337 |a 824154757 |a 935268398 |a 1340119161 | ||
| 020 | |a 9780080955230 |q (electronic bk.) | ||
| 020 | |a 0080955231 |q (electronic bk.) | ||
| 020 | |a 1282289772 | ||
| 020 | |a 9781282289772 | ||
| 020 | |z 9780120875504 | ||
| 020 | |z 0120875500 | ||
| 024 | 8 | |a (WaSeSS)ssj0000340209 | |
| 035 | |a (OCoLC)316549754 |z (OCoLC)301113310 |z (OCoLC)600555765 |z (OCoLC)646827440 |z (OCoLC)805950595 |z (OCoLC)823843565 |z (OCoLC)823912297 |z (OCoLC)824099337 |z (OCoLC)824154757 |z (OCoLC)935268398 |z (OCoLC)1340119161 | ||
| 042 | |a dlr | ||
| 050 | 4 | |a TK5101 |b .B46 1965eb | |
| 072 | 7 | |a TEC |x 041000 |2 bisacsh | |
| 072 | 7 | |a GPF |2 bicssc | |
| 082 | 7 | |a 621.385/1 |2 22 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Beneš, V. E. |q (Václav E.) |1 https://id.oclc.org/worldcat/entity/E39PBJtRF4WJbFGC8WhcK7MgKd |0 http://id.loc.gov/authorities/names/n83826862 | |
| 245 | 1 | 0 | |a Mathematical theory of connecting networks and telephone traffic / |c V.E. Beneš. |
| 260 | |a New York : |b Academic Press, |c 1965. | ||
| 300 | |a 1 online resource (xiv, 319 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |2 rdaft |0 http://rdaregistry.info/termList/fileType/1002. | ||
| 490 | 1 | |a Mathematics in science and engineering ; |v v. 17 | |
| 504 | |a Includes bibliographical references and indexes. | ||
| 588 | 0 | |a Print version record. | |
| 506 | |3 Use copy |f Restrictions unspecified |2 star |5 MiAaHDL | ||
| 520 | |a Mathematical theory of connecting networks and telephone traffic. | ||
| 533 | |a Electronic reproduction. |b [Place of publication not identified] : |c HathiTrust Digital Library, |d 2010. |5 MiAaHDL | ||
| 538 | |a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. |u http://purl.oclc.org/DLF/benchrepro0212 |5 MiAaHDL | ||
| 583 | 1 | |a digitized |c 2010 |h HathiTrust Digital Library |l committed to preserve |2 pda |5 MiAaHDL | |
| 505 | 0 | |a Front Cover; Mathematical Theory of Connecting Networks and Telephone Traffic; Copyright Page; Contents; Preface; Chapter 1. Heuristic Remarks and Mathematical Problems Regarding the Theory of Connecting Systems; 1. Introduction; 2. Summary of Chapter 1; 3. Historical Sketch; 4. Critique; 5. General Properties of Connecting Systems; 6. Performance of Switching Systems; 7. Desiderata; 8. Mathematical Models; 9. Fundamental Difficulties and Questions; 10. The Merits of Microscopic States; 11. From Details to Structure; 12. The Relevance of Combinatorial and Structural Properties: Examples. | |
| 505 | 8 | |a 13. Combinatorial, Probabilistic, and Variational Problems14. A Packing Problem; 15. A Problem of Traffic Circulation in a Telephone Exchange; 16. An Optimal Routing Problem; References; Chapter 2. Algebraic and Topological Properties of Connecting Networks; 1. Introduction; 2. Summary of Chapter 2; 3. The Structure and Condition of a Connecting Network; 4. Graphical Depiction of Network Structure and Condition; 5. Network States; 6. The State Diagram; 7. Some Numerical Functions; 8. Assignments; 9. Three Topologies; 10. Some Definitions and Problems; 11. Rearrangeable Networks. | |
| 505 | 8 | |a 12. Networks Nonblocking in the Wide Sense13. Networks Nonblocking in the Strict Sense; 14. Glossary for Chapter 2; References; Chapter 3. Rearrangeable Networks; 1. Introduction; 2. Summary of Chapter 3; 3. The Slepian-Duguid Theorem; 4. The Number of Calls That Must Be Moved: Paull's Theorem; 5. Some Formal Preliminaries; 6. The Number of Calls That Must Be Moved: New Results; 7. Summary of Sections 8-15; 8. Stages and Link Patterns; 9. Group Theory Formulation; 10. The Generation of Complexes by Stages; 11. An Example; 12. Some Definitions; 13. Preliminary Results. | |
| 505 | 8 | |a 14. Generating the Permutation Group15. Construction of a Class of Rearrangeable Networks; 16. Summary of Sections 17-21; 17. The Combinatorial Power of a Network; 18. Preliminaries; 19. Construction of the Basic Partial Ordering; 20. Cost Is Nearly Isotone on T(Cn); 21. Principal Results of Optimization; References; Chapter 4. Strictly Nonblocking Networks; 1. Introduction; 2. Square Array; 3. Three-Stage Strictly Nonblocking Connecting Network; 4. Principle Involved; 5. Five-Stage Network; 6. Seven-Stage Network; 7. General Multistage Switching Network. | |
| 505 | 8 | |a 8. Most Favorable Size of Input and Output Switches in the Three-Stage Network9. Most Favorable Switch Sizes in the Five-Stage Network; 10. Search for the Smallest N for a Given n for the Three-Stage Network; 11. Cases in the Three-Stage Network Where N = r(mod n); 12. Search for the Minimum Number of Crosspoints between N = 23 and N = 160; 13. Search for the Minimum Number of Crosspoints for N = 240; 14. Rectangular Array; 15. N Inputs and M Outputs in the Three-Stage Array; 16. Triangular Network; 17. One-way Incoming, One-way Outgoing, and Two-way Trunks. | |
| 650 | 0 | |a Telephone, Automatic. |0 http://id.loc.gov/authorities/subjects/sh85133397 | |
| 650 | 0 | |a Queuing theory. |0 http://id.loc.gov/authorities/subjects/sh85109832 | |
| 650 | 0 | |a Communication |v Statistics. | |
| 650 | 0 | |a Electric networks. |0 http://id.loc.gov/authorities/subjects/sh85041866 | |
| 650 | 6 | |a Communication |x Statistiques. | |
| 650 | 6 | |a Téléphone |x Lignes. | |
| 650 | 6 | |a Réseaux électriques (Circuits) | |
| 650 | 6 | |a Téléphone automatique. | |
| 650 | 6 | |a Théorie des files d'attente. | |
| 650 | 6 | |a Information |v Statistiques. | |
| 650 | 7 | |a TECHNOLOGY & ENGINEERING |x Telecommunications. |2 bisacsh | |
| 650 | 7 | |a Electric networks |2 fast | |
| 650 | 7 | |a Communication |2 fast | |
| 650 | 7 | |a Queuing theory |2 fast | |
| 650 | 7 | |a Telephone, Automatic |2 fast | |
| 655 | 7 | |a Statistics |2 fast | |
| 776 | 0 | 8 | |i Print version : |a Beneš, V.E. (Václav E.). |t Mathematical theory of connecting networks and telephone traffic. |d New York : Academic Press, 1965 |z 9780120875504 |w (DLC) 65021156 |w (OCoLC)1650896 |
| 830 | 0 | |a Mathematics in science and engineering ; |v v. 17. |0 http://id.loc.gov/authorities/names/n42015986 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://www.sciencedirect.com/science/bookseries/00765392/17 |3 Volltext |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=296999 |3 Volltext |
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL452936 | ||
| 938 | |a ebrary |b EBRY |n ebr10329399 | ||
| 938 | |a EBSCOhost |b EBSC |n 296999 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n 228977 | ||
| 938 | |a YBP Library Services |b YANK |n 3101770 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn316549754 |
|---|---|
| _version_ | 1816881689168707584 |
| adam_text | |
| any_adam_object | |
| author | Beneš, V. E. (Václav E.) |
| author_GND | http://id.loc.gov/authorities/names/n83826862 |
| author_facet | Beneš, V. E. (Václav E.) |
| author_role | |
| author_sort | Beneš, V. E. |
| author_variant | v e b ve veb |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | T - Technology |
| callnumber-label | TK5101 |
| callnumber-raw | TK5101 .B46 1965eb |
| callnumber-search | TK5101 .B46 1965eb |
| callnumber-sort | TK 45101 B46 41965EB |
| callnumber-subject | TK - Electrical and Nuclear Engineering |
| collection | ZDB-4-EBA |
| contents | Front Cover; Mathematical Theory of Connecting Networks and Telephone Traffic; Copyright Page; Contents; Preface; Chapter 1. Heuristic Remarks and Mathematical Problems Regarding the Theory of Connecting Systems; 1. Introduction; 2. Summary of Chapter 1; 3. Historical Sketch; 4. Critique; 5. General Properties of Connecting Systems; 6. Performance of Switching Systems; 7. Desiderata; 8. Mathematical Models; 9. Fundamental Difficulties and Questions; 10. The Merits of Microscopic States; 11. From Details to Structure; 12. The Relevance of Combinatorial and Structural Properties: Examples. 13. Combinatorial, Probabilistic, and Variational Problems14. A Packing Problem; 15. A Problem of Traffic Circulation in a Telephone Exchange; 16. An Optimal Routing Problem; References; Chapter 2. Algebraic and Topological Properties of Connecting Networks; 1. Introduction; 2. Summary of Chapter 2; 3. The Structure and Condition of a Connecting Network; 4. Graphical Depiction of Network Structure and Condition; 5. Network States; 6. The State Diagram; 7. Some Numerical Functions; 8. Assignments; 9. Three Topologies; 10. Some Definitions and Problems; 11. Rearrangeable Networks. 12. Networks Nonblocking in the Wide Sense13. Networks Nonblocking in the Strict Sense; 14. Glossary for Chapter 2; References; Chapter 3. Rearrangeable Networks; 1. Introduction; 2. Summary of Chapter 3; 3. The Slepian-Duguid Theorem; 4. The Number of Calls That Must Be Moved: Paull's Theorem; 5. Some Formal Preliminaries; 6. The Number of Calls That Must Be Moved: New Results; 7. Summary of Sections 8-15; 8. Stages and Link Patterns; 9. Group Theory Formulation; 10. The Generation of Complexes by Stages; 11. An Example; 12. Some Definitions; 13. Preliminary Results. 14. Generating the Permutation Group15. Construction of a Class of Rearrangeable Networks; 16. Summary of Sections 17-21; 17. The Combinatorial Power of a Network; 18. Preliminaries; 19. Construction of the Basic Partial Ordering; 20. Cost Is Nearly Isotone on T(Cn); 21. Principal Results of Optimization; References; Chapter 4. Strictly Nonblocking Networks; 1. Introduction; 2. Square Array; 3. Three-Stage Strictly Nonblocking Connecting Network; 4. Principle Involved; 5. Five-Stage Network; 6. Seven-Stage Network; 7. General Multistage Switching Network. 8. Most Favorable Size of Input and Output Switches in the Three-Stage Network9. Most Favorable Switch Sizes in the Five-Stage Network; 10. Search for the Smallest N for a Given n for the Three-Stage Network; 11. Cases in the Three-Stage Network Where N = r(mod n); 12. Search for the Minimum Number of Crosspoints between N = 23 and N = 160; 13. Search for the Minimum Number of Crosspoints for N = 240; 14. Rectangular Array; 15. N Inputs and M Outputs in the Three-Stage Array; 16. Triangular Network; 17. One-way Incoming, One-way Outgoing, and Two-way Trunks. |
| ctrlnum | (OCoLC)316549754 |
| dewey-full | 621.385/1 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 621 - Applied physics |
| dewey-raw | 621.385/1 |
| dewey-search | 621.385/1 |
| dewey-sort | 3621.385 11 |
| dewey-tens | 620 - Engineering and allied operations |
| discipline | Elektrotechnik / Elektronik / Nachrichtentechnik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>07173cam a2200853 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn316549754</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">090320s1965 nyua obs 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">OPELS</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">OPELS</subfield><subfield code="d">N$T</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">EBLCP</subfield><subfield code="d">IDEBK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OPELS</subfield><subfield code="d">MHW</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCE</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">DEBBG</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">NLGGC</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">COO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">STF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCO</subfield><subfield code="d">COA</subfield><subfield code="d">OCLCL</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">301113310</subfield><subfield code="a">600555765</subfield><subfield code="a">646827440</subfield><subfield code="a">805950595</subfield><subfield code="a">823843565</subfield><subfield code="a">823912297</subfield><subfield code="a">824099337</subfield><subfield code="a">824154757</subfield><subfield code="a">935268398</subfield><subfield code="a">1340119161</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780080955230</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0080955231</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1282289772</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781282289772</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780120875504</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0120875500</subfield></datafield><datafield tag="024" ind1="8" ind2=" "><subfield code="a">(WaSeSS)ssj0000340209</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)316549754</subfield><subfield code="z">(OCoLC)301113310</subfield><subfield code="z">(OCoLC)600555765</subfield><subfield code="z">(OCoLC)646827440</subfield><subfield code="z">(OCoLC)805950595</subfield><subfield code="z">(OCoLC)823843565</subfield><subfield code="z">(OCoLC)823912297</subfield><subfield code="z">(OCoLC)824099337</subfield><subfield code="z">(OCoLC)824154757</subfield><subfield code="z">(OCoLC)935268398</subfield><subfield code="z">(OCoLC)1340119161</subfield></datafield><datafield tag="042" ind1=" " ind2=" "><subfield code="a">dlr</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">TK5101</subfield><subfield code="b">.B46 1965eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">TEC</subfield><subfield code="x">041000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">GPF</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">621.385/1</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Beneš, V. E.</subfield><subfield code="q">(Václav E.)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJtRF4WJbFGC8WhcK7MgKd</subfield><subfield code="0">http://id.loc.gov/authorities/names/n83826862</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Mathematical theory of connecting networks and telephone traffic /</subfield><subfield code="c">V.E. Beneš.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">New York :</subfield><subfield code="b">Academic Press,</subfield><subfield code="c">1965.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiv, 319 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="2">rdaft</subfield><subfield code="0">http://rdaregistry.info/termList/fileType/1002.</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Mathematics in science and engineering ;</subfield><subfield code="v">v. 17</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and indexes.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="506" ind1=" " ind2=" "><subfield code="3">Use copy</subfield><subfield code="f">Restrictions unspecified</subfield><subfield code="2">star</subfield><subfield code="5">MiAaHDL</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Mathematical theory of connecting networks and telephone traffic.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="a">Electronic reproduction.</subfield><subfield code="b">[Place of publication not identified] :</subfield><subfield code="c">HathiTrust Digital Library,</subfield><subfield code="d">2010.</subfield><subfield code="5">MiAaHDL</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.</subfield><subfield code="u">http://purl.oclc.org/DLF/benchrepro0212</subfield><subfield code="5">MiAaHDL</subfield></datafield><datafield tag="583" ind1="1" ind2=" "><subfield code="a">digitized</subfield><subfield code="c">2010</subfield><subfield code="h">HathiTrust Digital Library</subfield><subfield code="l">committed to preserve</subfield><subfield code="2">pda</subfield><subfield code="5">MiAaHDL</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Front Cover; Mathematical Theory of Connecting Networks and Telephone Traffic; Copyright Page; Contents; Preface; Chapter 1. Heuristic Remarks and Mathematical Problems Regarding the Theory of Connecting Systems; 1. Introduction; 2. Summary of Chapter 1; 3. Historical Sketch; 4. Critique; 5. General Properties of Connecting Systems; 6. Performance of Switching Systems; 7. Desiderata; 8. Mathematical Models; 9. Fundamental Difficulties and Questions; 10. The Merits of Microscopic States; 11. From Details to Structure; 12. The Relevance of Combinatorial and Structural Properties: Examples.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">13. Combinatorial, Probabilistic, and Variational Problems14. A Packing Problem; 15. A Problem of Traffic Circulation in a Telephone Exchange; 16. An Optimal Routing Problem; References; Chapter 2. Algebraic and Topological Properties of Connecting Networks; 1. Introduction; 2. Summary of Chapter 2; 3. The Structure and Condition of a Connecting Network; 4. Graphical Depiction of Network Structure and Condition; 5. Network States; 6. The State Diagram; 7. Some Numerical Functions; 8. Assignments; 9. Three Topologies; 10. Some Definitions and Problems; 11. Rearrangeable Networks.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">12. Networks Nonblocking in the Wide Sense13. Networks Nonblocking in the Strict Sense; 14. Glossary for Chapter 2; References; Chapter 3. Rearrangeable Networks; 1. Introduction; 2. Summary of Chapter 3; 3. The Slepian-Duguid Theorem; 4. The Number of Calls That Must Be Moved: Paull's Theorem; 5. Some Formal Preliminaries; 6. The Number of Calls That Must Be Moved: New Results; 7. Summary of Sections 8-15; 8. Stages and Link Patterns; 9. Group Theory Formulation; 10. The Generation of Complexes by Stages; 11. An Example; 12. Some Definitions; 13. Preliminary Results.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">14. Generating the Permutation Group15. Construction of a Class of Rearrangeable Networks; 16. Summary of Sections 17-21; 17. The Combinatorial Power of a Network; 18. Preliminaries; 19. Construction of the Basic Partial Ordering; 20. Cost Is Nearly Isotone on T(Cn); 21. Principal Results of Optimization; References; Chapter 4. Strictly Nonblocking Networks; 1. Introduction; 2. Square Array; 3. Three-Stage Strictly Nonblocking Connecting Network; 4. Principle Involved; 5. Five-Stage Network; 6. Seven-Stage Network; 7. General Multistage Switching Network.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">8. Most Favorable Size of Input and Output Switches in the Three-Stage Network9. Most Favorable Switch Sizes in the Five-Stage Network; 10. Search for the Smallest N for a Given n for the Three-Stage Network; 11. Cases in the Three-Stage Network Where N = r(mod n); 12. Search for the Minimum Number of Crosspoints between N = 23 and N = 160; 13. Search for the Minimum Number of Crosspoints for N = 240; 14. Rectangular Array; 15. N Inputs and M Outputs in the Three-Stage Array; 16. Triangular Network; 17. One-way Incoming, One-way Outgoing, and Two-way Trunks.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Telephone, Automatic.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85133397</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Queuing theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85109832</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Communication</subfield><subfield code="v">Statistics.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Electric networks.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85041866</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Communication</subfield><subfield code="x">Statistiques.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Téléphone</subfield><subfield code="x">Lignes.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Réseaux électriques (Circuits)</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Téléphone automatique.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie des files d'attente.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Information</subfield><subfield code="v">Statistiques.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">TECHNOLOGY & ENGINEERING</subfield><subfield code="x">Telecommunications.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Electric networks</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Communication</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Queuing theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Telephone, Automatic</subfield><subfield code="2">fast</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Statistics</subfield><subfield code="2">fast</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version :</subfield><subfield code="a">Beneš, V.E. (Václav E.).</subfield><subfield code="t">Mathematical theory of connecting networks and telephone traffic.</subfield><subfield code="d">New York : Academic Press, 1965</subfield><subfield code="z">9780120875504</subfield><subfield code="w">(DLC) 65021156</subfield><subfield code="w">(OCoLC)1650896</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Mathematics in science and engineering ;</subfield><subfield code="v">v. 17.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n42015986</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://www.sciencedirect.com/science/bookseries/00765392/17</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=296999</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL452936</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10329399</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">296999</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">228977</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3101770</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | Statistics fast |
| genre_facet | Statistics |
| id | ZDB-4-EBA-ocn316549754 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:16:42Z |
| institution | BVB |
| isbn | 9780080955230 0080955231 1282289772 9781282289772 |
| language | English |
| oclc_num | 316549754 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xiv, 319 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 1965 |
| publishDateSearch | 1965 |
| publishDateSort | 1965 |
| publisher | Academic Press, |
| record_format | marc |
| series | Mathematics in science and engineering ; |
| series2 | Mathematics in science and engineering ; |
| spelling | Beneš, V. E. (Václav E.) https://id.oclc.org/worldcat/entity/E39PBJtRF4WJbFGC8WhcK7MgKd http://id.loc.gov/authorities/names/n83826862 Mathematical theory of connecting networks and telephone traffic / V.E. Beneš. New York : Academic Press, 1965. 1 online resource (xiv, 319 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier text file rdaft http://rdaregistry.info/termList/fileType/1002. Mathematics in science and engineering ; v. 17 Includes bibliographical references and indexes. Print version record. Use copy Restrictions unspecified star MiAaHDL Mathematical theory of connecting networks and telephone traffic. Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. MiAaHDL Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL Front Cover; Mathematical Theory of Connecting Networks and Telephone Traffic; Copyright Page; Contents; Preface; Chapter 1. Heuristic Remarks and Mathematical Problems Regarding the Theory of Connecting Systems; 1. Introduction; 2. Summary of Chapter 1; 3. Historical Sketch; 4. Critique; 5. General Properties of Connecting Systems; 6. Performance of Switching Systems; 7. Desiderata; 8. Mathematical Models; 9. Fundamental Difficulties and Questions; 10. The Merits of Microscopic States; 11. From Details to Structure; 12. The Relevance of Combinatorial and Structural Properties: Examples. 13. Combinatorial, Probabilistic, and Variational Problems14. A Packing Problem; 15. A Problem of Traffic Circulation in a Telephone Exchange; 16. An Optimal Routing Problem; References; Chapter 2. Algebraic and Topological Properties of Connecting Networks; 1. Introduction; 2. Summary of Chapter 2; 3. The Structure and Condition of a Connecting Network; 4. Graphical Depiction of Network Structure and Condition; 5. Network States; 6. The State Diagram; 7. Some Numerical Functions; 8. Assignments; 9. Three Topologies; 10. Some Definitions and Problems; 11. Rearrangeable Networks. 12. Networks Nonblocking in the Wide Sense13. Networks Nonblocking in the Strict Sense; 14. Glossary for Chapter 2; References; Chapter 3. Rearrangeable Networks; 1. Introduction; 2. Summary of Chapter 3; 3. The Slepian-Duguid Theorem; 4. The Number of Calls That Must Be Moved: Paull's Theorem; 5. Some Formal Preliminaries; 6. The Number of Calls That Must Be Moved: New Results; 7. Summary of Sections 8-15; 8. Stages and Link Patterns; 9. Group Theory Formulation; 10. The Generation of Complexes by Stages; 11. An Example; 12. Some Definitions; 13. Preliminary Results. 14. Generating the Permutation Group15. Construction of a Class of Rearrangeable Networks; 16. Summary of Sections 17-21; 17. The Combinatorial Power of a Network; 18. Preliminaries; 19. Construction of the Basic Partial Ordering; 20. Cost Is Nearly Isotone on T(Cn); 21. Principal Results of Optimization; References; Chapter 4. Strictly Nonblocking Networks; 1. Introduction; 2. Square Array; 3. Three-Stage Strictly Nonblocking Connecting Network; 4. Principle Involved; 5. Five-Stage Network; 6. Seven-Stage Network; 7. General Multistage Switching Network. 8. Most Favorable Size of Input and Output Switches in the Three-Stage Network9. Most Favorable Switch Sizes in the Five-Stage Network; 10. Search for the Smallest N for a Given n for the Three-Stage Network; 11. Cases in the Three-Stage Network Where N = r(mod n); 12. Search for the Minimum Number of Crosspoints between N = 23 and N = 160; 13. Search for the Minimum Number of Crosspoints for N = 240; 14. Rectangular Array; 15. N Inputs and M Outputs in the Three-Stage Array; 16. Triangular Network; 17. One-way Incoming, One-way Outgoing, and Two-way Trunks. Telephone, Automatic. http://id.loc.gov/authorities/subjects/sh85133397 Queuing theory. http://id.loc.gov/authorities/subjects/sh85109832 Communication Statistics. Electric networks. http://id.loc.gov/authorities/subjects/sh85041866 Communication Statistiques. Téléphone Lignes. Réseaux électriques (Circuits) Téléphone automatique. Théorie des files d'attente. Information Statistiques. TECHNOLOGY & ENGINEERING Telecommunications. bisacsh Electric networks fast Communication fast Queuing theory fast Telephone, Automatic fast Statistics fast Print version : Beneš, V.E. (Václav E.). Mathematical theory of connecting networks and telephone traffic. New York : Academic Press, 1965 9780120875504 (DLC) 65021156 (OCoLC)1650896 Mathematics in science and engineering ; v. 17. http://id.loc.gov/authorities/names/n42015986 FWS01 ZDB-4-EBA FWS_PDA_EBA https://www.sciencedirect.com/science/bookseries/00765392/17 Volltext FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=296999 Volltext |
| spellingShingle | Beneš, V. E. (Václav E.) Mathematical theory of connecting networks and telephone traffic / Mathematics in science and engineering ; Front Cover; Mathematical Theory of Connecting Networks and Telephone Traffic; Copyright Page; Contents; Preface; Chapter 1. Heuristic Remarks and Mathematical Problems Regarding the Theory of Connecting Systems; 1. Introduction; 2. Summary of Chapter 1; 3. Historical Sketch; 4. Critique; 5. General Properties of Connecting Systems; 6. Performance of Switching Systems; 7. Desiderata; 8. Mathematical Models; 9. Fundamental Difficulties and Questions; 10. The Merits of Microscopic States; 11. From Details to Structure; 12. The Relevance of Combinatorial and Structural Properties: Examples. 13. Combinatorial, Probabilistic, and Variational Problems14. A Packing Problem; 15. A Problem of Traffic Circulation in a Telephone Exchange; 16. An Optimal Routing Problem; References; Chapter 2. Algebraic and Topological Properties of Connecting Networks; 1. Introduction; 2. Summary of Chapter 2; 3. The Structure and Condition of a Connecting Network; 4. Graphical Depiction of Network Structure and Condition; 5. Network States; 6. The State Diagram; 7. Some Numerical Functions; 8. Assignments; 9. Three Topologies; 10. Some Definitions and Problems; 11. Rearrangeable Networks. 12. Networks Nonblocking in the Wide Sense13. Networks Nonblocking in the Strict Sense; 14. Glossary for Chapter 2; References; Chapter 3. Rearrangeable Networks; 1. Introduction; 2. Summary of Chapter 3; 3. The Slepian-Duguid Theorem; 4. The Number of Calls That Must Be Moved: Paull's Theorem; 5. Some Formal Preliminaries; 6. The Number of Calls That Must Be Moved: New Results; 7. Summary of Sections 8-15; 8. Stages and Link Patterns; 9. Group Theory Formulation; 10. The Generation of Complexes by Stages; 11. An Example; 12. Some Definitions; 13. Preliminary Results. 14. Generating the Permutation Group15. Construction of a Class of Rearrangeable Networks; 16. Summary of Sections 17-21; 17. The Combinatorial Power of a Network; 18. Preliminaries; 19. Construction of the Basic Partial Ordering; 20. Cost Is Nearly Isotone on T(Cn); 21. Principal Results of Optimization; References; Chapter 4. Strictly Nonblocking Networks; 1. Introduction; 2. Square Array; 3. Three-Stage Strictly Nonblocking Connecting Network; 4. Principle Involved; 5. Five-Stage Network; 6. Seven-Stage Network; 7. General Multistage Switching Network. 8. Most Favorable Size of Input and Output Switches in the Three-Stage Network9. Most Favorable Switch Sizes in the Five-Stage Network; 10. Search for the Smallest N for a Given n for the Three-Stage Network; 11. Cases in the Three-Stage Network Where N = r(mod n); 12. Search for the Minimum Number of Crosspoints between N = 23 and N = 160; 13. Search for the Minimum Number of Crosspoints for N = 240; 14. Rectangular Array; 15. N Inputs and M Outputs in the Three-Stage Array; 16. Triangular Network; 17. One-way Incoming, One-way Outgoing, and Two-way Trunks. Telephone, Automatic. http://id.loc.gov/authorities/subjects/sh85133397 Queuing theory. http://id.loc.gov/authorities/subjects/sh85109832 Communication Statistics. Electric networks. http://id.loc.gov/authorities/subjects/sh85041866 Communication Statistiques. Téléphone Lignes. Réseaux électriques (Circuits) Téléphone automatique. Théorie des files d'attente. Information Statistiques. TECHNOLOGY & ENGINEERING Telecommunications. bisacsh Electric networks fast Communication fast Queuing theory fast Telephone, Automatic fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85133397 http://id.loc.gov/authorities/subjects/sh85109832 http://id.loc.gov/authorities/subjects/sh85041866 |
| title | Mathematical theory of connecting networks and telephone traffic / |
| title_auth | Mathematical theory of connecting networks and telephone traffic / |
| title_exact_search | Mathematical theory of connecting networks and telephone traffic / |
| title_full | Mathematical theory of connecting networks and telephone traffic / V.E. Beneš. |
| title_fullStr | Mathematical theory of connecting networks and telephone traffic / V.E. Beneš. |
| title_full_unstemmed | Mathematical theory of connecting networks and telephone traffic / V.E. Beneš. |
| title_short | Mathematical theory of connecting networks and telephone traffic / |
| title_sort | mathematical theory of connecting networks and telephone traffic |
| topic | Telephone, Automatic. http://id.loc.gov/authorities/subjects/sh85133397 Queuing theory. http://id.loc.gov/authorities/subjects/sh85109832 Communication Statistics. Electric networks. http://id.loc.gov/authorities/subjects/sh85041866 Communication Statistiques. Téléphone Lignes. Réseaux électriques (Circuits) Téléphone automatique. Théorie des files d'attente. Information Statistiques. TECHNOLOGY & ENGINEERING Telecommunications. bisacsh Electric networks fast Communication fast Queuing theory fast Telephone, Automatic fast |
| topic_facet | Telephone, Automatic. Queuing theory. Communication Statistics. Electric networks. Communication Statistiques. Téléphone Lignes. Réseaux électriques (Circuits) Téléphone automatique. Théorie des files d'attente. Information Statistiques. TECHNOLOGY & ENGINEERING Telecommunications. Electric networks Communication Queuing theory Telephone, Automatic Statistics |
| url | https://www.sciencedirect.com/science/bookseries/00765392/17 https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=296999 |
| work_keys_str_mv | AT benesve mathematicaltheoryofconnectingnetworksandtelephonetraffic |