Network Performance Modeling and SimulationJean Walrand, Kallol Bagchi, George Zobrist CRC Press, 2019. gada 16. aug. - 332 lappuses This book makes the argument that performance modeling and simulation have become central issues in computer science and engineering, in part due to applications to the structures comprising the Internet. Dealing primarily with theory, tools and techniques as related to communications systems, the volume provides tutorials and surveys and relates new important research results. Each chapter presents background information, describes and analyzes important work done in the field and provides direction to the reader on future work and further readings. The topics covered include traffic models for A TM networks, simulation environments, analytical methods, interprocessor communications, and an evaluation of process architectures. |
No grāmatas satura
1.5. rezultāts no 24.
4. lappuse
... dependency . Therefore , we need to develop different data routing algorithms to match the topologies . Scalability Ideally , the network performance should be linearly scaled with an increasing number of processors employed . For ...
... dependency . Therefore , we need to develop different data routing algorithms to match the topologies . Scalability Ideally , the network performance should be linearly scaled with an increasing number of processors employed . For ...
8. lappuse
... network is not very scalable in a large system . Network size node symmetry ܚܚܙ Linear array Ring Binary tree. ( a ) Omega network Figure 1.7 : Crossbar Network Figure 1.8 : Deadlock : circular dependency ( b ). 8 YEN - WEN LU.
... network is not very scalable in a large system . Network size node symmetry ܚܚܙ Linear array Ring Binary tree. ( a ) Omega network Figure 1.7 : Crossbar Network Figure 1.8 : Deadlock : circular dependency ( b ). 8 YEN - WEN LU.
12. lappuse
... dependency among the processes , then deadlock arises ( Fig . 1.8 ) . In data routing , the resources may be buffers ( in a store - and - forward network ) or channels ( in a wormhole network ) depending on the routing flow control ...
... dependency among the processes , then deadlock arises ( Fig . 1.8 ) . In data routing , the resources may be buffers ( in a store - and - forward network ) or channels ( in a wormhole network ) depending on the routing flow control ...
13. lappuse
... intermediate nodes along the path . Virtual Cut - Through Routing Virtual cut - through routing. Figure 1.8 : Deadlock : circular dependency ( b ) Several virtual channel FIFOS ( a ). WORMHOLE DATA ROUTING IN MULTIPROCESSORS 13.
... intermediate nodes along the path . Virtual Cut - Through Routing Virtual cut - through routing. Figure 1.8 : Deadlock : circular dependency ( b ) Several virtual channel FIFOS ( a ). WORMHOLE DATA ROUTING IN MULTIPROCESSORS 13.
16. lappuse
... dependency in the directed buffer graph may occur . In wormhole networks , channel dependency is used for resource allocation . To prevent deadlock we need to restrict the routing relation to make the channel dependency acyclic ...
... dependency in the directed buffer graph may occur . In wormhole networks , channel dependency is used for resource allocation . To prevent deadlock we need to restrict the routing relation to make the channel dependency acyclic ...
Saturs
| 1 | |
2 Reusability Techniques for Building a Simulation Environment and Modeling Communications Systems | 39 |
An Overview and an Example of Application | 59 |
4 Traffic Modeling for ATM Networks | 105 |
5 An Overview of Source Characterization in ATM Networks | 123 |
6 Procedures for Estimating and Guaranteeing Delays in High Speed Communication Networks | 151 |
7 BMAP Modeling of a Correlated Queue | 177 |
8 Hierarchical Performance Modeling of Computer Communication Systems | 197 |
9 A Framework for Measuring the Performance of Alternative Process Architectures for Parallelizing Communication Systems | 219 |
A Prototyping and Modeling Tool for Communication Networks and Protocols | 255 |
11 Network Reliability Evaluation | 275 |
Notes on the Contributors | 303 |
Author Index | 311 |
Subject Index | 313 |
Citi izdevumi - Skatīt visu
Network Performance Modeling and Simulation Jean Walrand,Kallol Bagchi,George Zobrist Ierobežota priekšskatīšana - 1998 |
Network Performance Modeling and Simulation Jean Walrand,Kallol Bagchi,George Zobrist Ierobežota priekšskatīšana - 2019 |
Bieži izmantoti vārdi un frāzes
adaptive aggregate algorithm analysis application approach approximation arrival associated batch behavior bound buffer called cell channel chapter color communication complete components Computer Condition connection consider context corresponding customers defined delay dependency described direct distribution equal evaluation example execution extended Figure flow frame function given graph GSPN IEEE immediate implemented increases input instance interarrival interface interval Italy layer length mean measured messages method Module nodes objects observed obtained operation output packet Parallelism parameters path performance period possible present probability process architectures protocol stack queue reduction reliability represents respect routing rule selection server shown shows simulation single solution specific station step Stream structure submodel SunOS switch synchronization tasks techniques tokens traffic transitions University virtual waiting