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 45.
2. lappuse
... message to be delivered from source to destination . Throughput is the data rate which is maintained in the network . Both latency and throughput are strongly dependent on the network topology and routing algorithm . In this section ...
... message to be delivered from source to destination . Throughput is the data rate which is maintained in the network . Both latency and throughput are strongly dependent on the network topology and routing algorithm . In this section ...
11. lappuse
... Messages between processing nodes are routed through the 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 ...
... Messages between processing nodes are routed through the 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 ...
12. lappuse
... message can move forward , and deadlock results . Avoiding deadlock is critical in the data routing problem . We will discuss deadlock avoidance methods in Sec . 1.4 . Livelock The livelock situation occurs when a packet circulates in a ...
... message can move forward , and deadlock results . Avoiding deadlock is critical in the data routing problem . We will discuss deadlock avoidance methods in Sec . 1.4 . Livelock The livelock situation occurs when a packet circulates in a ...
13. lappuse
... message as soon as the header has been decoded and the next node on the route has been decided . If the header is blocked , the following flits are distributed in the intermediate nodes along the path . Virtual Cut - Through Routing ...
... message as soon as the header has been decoded and the next node on the route has been decided . If the header is blocked , the following flits are distributed in the intermediate nodes along the path . Virtual Cut - Through Routing ...
16. lappuse
... messages can be forwarded from one buffer to the next according to a loop - free directed buffer graph which accommodates all the possible message routes ?? . The buffers can be organized so that they form a partial order . When a ...
... messages can be forwarded from one buffer to the next according to a loop - free directed buffer graph which accommodates all the possible message routes ?? . The buffers can be organized so that they form a partial order . When a ...
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
Bibliogrāfiskā informācija
| Nosaukums | Network Performance Modeling and Simulation |
| Redaktori | Jean Walrand, Kallol Bagchi, George Zobrist |
| Izdevējs | CRC Press, 2019 |
| ISBN | 100071750X, 9781000717501 |
| Apjoms | 332 lappuses |
| Eksportēt avotu | BiBTeX EndNote RefMan |