The Resource Mathematical theory of connecting networks and telephone traffic, V.E. Benes, (electronic resource/)

Mathematical theory of connecting networks and telephone traffic, V.E. Benes, (electronic resource/)

Label
Mathematical theory of connecting networks and telephone traffic
Title
Mathematical theory of connecting networks and telephone traffic
Statement of responsibility
V.E. Benes
Creator
Subject
Genre
Language
eng
Summary
Mathematical theory of connecting networks and telephone traffic
Member of
Cataloging source
OPELS
Dewey number
621.385/1
Illustrations
illustrations
Index
index present
LC call number
TK5101
LC item number
.B46 1965eb
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
Series statement
Mathematics in science and engineering
Series volume
v. 17
Label
Mathematical theory of connecting networks and telephone traffic, V.E. Benes, (electronic resource/)
Link
http://library.quincycollege.edu:2048/login?url=http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=296999
Instantiates
Publication
Antecedent source
unknown
Bibliography note
Includes bibliographical references and indexes
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
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: Paulls 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
Control code
ocn316549754
Dimensions
unknown
Extent
1 online resource (access may be restricted)
File format
unknown
Form of item
online
Governing access note
Access restricted to subscribing institution
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
c
Note
  • eBooks on EBSCOhost
  • eBooks on EBSCOhost
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
Label
Mathematical theory of connecting networks and telephone traffic, V.E. Benes, (electronic resource/)
Link
http://library.quincycollege.edu:2048/login?url=http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=296999
Publication
Antecedent source
unknown
Bibliography note
Includes bibliographical references and indexes
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
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: Paulls 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
Control code
ocn316549754
Dimensions
unknown
Extent
1 online resource (access may be restricted)
File format
unknown
Form of item
online
Governing access note
Access restricted to subscribing institution
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
c
Note
  • eBooks on EBSCOhost
  • eBooks on EBSCOhost
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote

Library Locations

    • Massasoit Community College Brockton CampusBorrow it
      1 Massasoit Blvd., Brockton, MA, 02301, US
      42.07562679999999 -70.99027629999999
    • Nease Library - Eastern Nazarene College Borrow it
      23 East Elm Ave. , Quincy, MA, 02170, US
      42.271089 -71.012428
    • Quincy College Library Borrow it
      1250 Hancock St. 3rd Fl Rm#347, Quincy, MA, 02169, US
      42.2513682 -70.9962875
Processing Feedback ...