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 81.
4. lappuse
Network Examples In this section , we will give a brief description of some popular networks and compare their characteristics as defined in the previous section . Linear Array and Ring Fig . 1.1 shows the topology of a linear array and ...
Network Examples In this section , we will give a brief description of some popular networks and compare their characteristics as defined in the previous section . Linear Array and Ring Fig . 1.1 shows the topology of a linear array and ...
17. lappuse
... the routing algorithms in the following sections . A routing algorithm decides where to send a packet according to its source , destination , and possibly local traffic conditions . An interconnection network , as defined in Sec .
... the routing algorithms in the following sections . A routing algorithm decides where to send a packet according to its source , destination , and possibly local traffic conditions . An interconnection network , as defined in Sec .
18. lappuse
We have the following definitions : Definition 1 Routing Function R A routing function R : N * N + P ( C ) , where P ( C ) is the set of communication channels C , provides a set of alternative output channels to send a packet from the ...
We have the following definitions : Definition 1 Routing Function R A routing function R : N * N + P ( C ) , where P ( C ) is the set of communication channels C , provides a set of alternative output channels to send a packet from the ...
19. lappuse
Definition 4 Channel Dependency For a given network and routing function R , the channel dependency graph D = ( C , E ) is defined as : the channels C are the vertices of D , and the edges are the pairs of channels connected by R ...
Definition 4 Channel Dependency For a given network and routing function R , the channel dependency graph D = ( C , E ) is defined as : the channels C are the vertices of D , and the edges are the pairs of channels connected by R ...
21. lappuse
... dependency graph , and it is deadlock - free . Fig . 1.13 shows examples of the dimension - order routing in a 2 - D torus . For the path ( 3,1 ) + ( 0,1 ) + ( 0,0 ) + ( 0,3 ) , the virtual channel values V defined by Eq . 1.4 are 3 ...
... dependency graph , and it is deadlock - free . Fig . 1.13 shows examples of the dimension - order routing in a 2 - D torus . For the path ( 3,1 ) + ( 0,1 ) + ( 0,0 ) + ( 0,3 ) , the virtual channel values V defined by Eq . 1.4 are 3 ...
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 |