Mathematical theory of connecting networks and telephone traffic /

Mathematical theory of connecting networks and telephone traffic.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Bene�s, V. E. (V�aclav E.)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York : Academic Press, 1965.
Colección:Mathematics in science and engineering ; v. 17.
Temas:
Telephone, Automatic.
Queuing theory.
Communication > Statistics.
Electric networks.
Communication > Statistiques.
T�el�ephone > Lignes.
R�eseaux �electriques (Circuits)
T�el�ephone automatique.
Th�eorie des files d'attente.
Information > Statistiques.
TECHNOLOGY & ENGINEERING > Telecommunications.
Electric networks
Communication
Queuing theory
Telephone, Automatic
Statistics
Acceso en línea:Texto completo
Texto completo
Texto completo

MARC

LEADER 00000cam a2200000 a 4500
001 SCIDIR_ocn316549754
003 OCoLC
005 20231117015222.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 
019 |a 301113310  |a 600555765  |a 646827440  |a 805950595  |a 823843565  |a 823912297  |a 824099337  |a 824154757  |a 935268398 
020 |a 9780080955230  |q (electronic bk.) 
020 |a 0080955231  |q (electronic bk.) 
020 |a 1282289772 
020 |a 9781282289772 
020 |z 9780120875504 
020 |z 0120875500 
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 
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 0 4 |a 621.385/1  |2 22 
100 1 |a Bene�s, V. E.  |q (V�aclav E.) 
245 1 0 |a Mathematical theory of connecting networks and telephone traffic /  |c V.E. Bene�s. 
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 
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. 
650 0 |a Queuing theory. 
650 0 |a Communication  |v Statistics. 
650 0 |a Electric networks. 
650 6 |a Communication  |0 (CaQQLa)201-0036942  |x Statistiques.  |0 (CaQQLa)201-0378408 
650 6 |a T�el�ephone  |0 (CaQQLa)201-0019846  |x Lignes. 
650 6 |a R�eseaux �electriques (Circuits)  |0 (CaQQLa)201-0000851 
650 6 |a T�el�ephone automatique.  |0 (CaQQLa)201-0017912 
650 6 |a Th�eorie des files d'attente.  |0 (CaQQLa)201-0078341 
650 6 |a Information  |0 (CaQQLa)201-0189052  |v Statistiques.  |0 (CaQQLa)201-0378300 
650 7 |a TECHNOLOGY & ENGINEERING  |x Telecommunications.  |2 bisacsh 
650 7 |a Electric networks  |2 fast  |0 (OCoLC)fst00905339 
650 7 |a Communication  |2 fast  |0 (OCoLC)fst00869952 
650 7 |a Queuing theory  |2 fast  |0 (OCoLC)fst01085713 
650 7 |a Telephone, Automatic  |2 fast  |0 (OCoLC)fst01146475 
655 7 |a Statistics  |2 fast  |0 (OCoLC)fst01423727 
776 0 8 |i Print version :  |a Bene�s, V.E. (V�aclav 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. 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/book/9780120875504  |z Texto completo 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/publication?issn=00765392&volume=17  |z Texto completo 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/bookseries/00765392/17  |z Texto completo 

Ejemplares similares