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 34.
1. lappuse
... path , the remaining flits follow in a pipelined fashion . If the header is blocked , the following flits may either be blocked and distributed in the network or be collected in several nodes depending on the storage space in each node ...
... path , the remaining flits follow in a pipelined fashion . If the header is blocked , the following flits may either be blocked and distributed in the network or be collected in several nodes depending on the storage space in each node ...
2. lappuse
... path between any two nodes in the network . The diameter is the indication of latency in the worst case when the traffic load is low . A designer should keep the network diameter small to reduce latency . Bisection Width The network ...
... path between any two nodes in the network . The diameter is the indication of latency in the worst case when the traffic load is low . A designer should keep the network diameter small to reduce latency . Bisection Width The network ...
4. lappuse
... paths , and channel 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 ...
... paths , and channel 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 ...
8. lappuse
... paths in a MIN have the same latency , so the designer cannot take advantage of data locality in most applications . Crossbar A crossbar switch is an interconnection in which each input is connected to each output through a path that ...
... paths in a MIN have the same latency , so the designer cannot take advantage of data locality in most applications . Crossbar A crossbar switch is an interconnection in which each input is connected to each output through a path that ...
11. lappuse
... paths set up by switching nodes . A dynamic network is usually an indirect network . For example , a multi - stage network often has its processors ( or memory ) at both ends of the network , and has the intermediate stages as switches ...
... paths set up by switching nodes . A dynamic network is usually an indirect network . For example , a multi - stage network often has its processors ( or memory ) at both ends of the network , and has the intermediate stages as switches ...
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