Network Performance Modeling and SimulationThis 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 42.
2. lappuse
new generation multiprocessors due to its low latency and low buffer cost . The rest of the chapter is organized as follows . Sec . 1.2 gives the overview of network interconnection for multiprocessors . Different network topologies are ...
new generation multiprocessors due to its low latency and low buffer cost . The rest of the chapter is organized as follows . Sec . 1.2 gives the overview of network interconnection for multiprocessors . Different network topologies are ...
12. lappuse
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 scheme ( Sec . 1.3.2 ) . When the circular waiting condition occurs ...
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 scheme ( Sec . 1.3.2 ) . When the circular waiting condition occurs ...
13. lappuse
Then the packet was forwarded to the next node on the path to the destination only when the next node had sufficient buffers to hold the packet and the channel was free . Wormhole Routing In a wormhole network , only the header flit ...
Then the packet was forwarded to the next node on the path to the destination only when the next node had sufficient buffers to hold the packet and the channel was free . Wormhole Routing In a wormhole network , only the header flit ...
14. lappuse
When Lp » Lj , the latency of wormhole routing is less sensitive to the distance D. Secondly , the buffer requirement is different for these three schemes . Store - and - forward and virtual cut - through routing require buffering of ...
When Lp » Lj , the latency of wormhole routing is less sensitive to the distance D. Secondly , the buffer requirement is different for these three schemes . Store - and - forward and virtual cut - through routing require buffering of ...
16. lappuse
In store - and - forward and virtual cutthrough routing , the critical resource is packet buffers , while in wormhole ... messages can be forwarded from one buffer to the next according to a loop - free directed buffer graph which ...
In store - and - forward and virtual cutthrough routing , the critical resource is packet buffers , while in wormhole ... messages can be forwarded from one buffer to the next according to a loop - free directed buffer graph which ...
Lietotāju komentāri - Rakstīt atsauksmi
Ierastajās vietās neesam atraduši nevienu atsauksmi.
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 |