Blocking and non-blocking network, Computer Engineering

Blocking and Non-Blocking network

In non-blocking networks the route from any free input node to any free output node can always be offered. Crossbar is an best example of non-blocking network. In a blocking network instantaneous route establishment among a pair of nodes may not be possible. There may be condition where blocking can occur. Blocking refers to the condition where one switch is necessary to establish more than one connection concurrently and end-to-end path cannot be established even if the input nodes and output nodes are free. Example of this is a blocking multistage network.


Posted Date: 3/2/2013 4:40:26 AM | Location : United States

Related Discussions:- Blocking and non-blocking network, Assignment Help, Ask Question on Blocking and non-blocking network, Get Answer, Expert's Help, Blocking and non-blocking network Discussions

Write discussion on Blocking and non-blocking network
Your posts are moderated
Related Questions
Explain the significance of init() and destroy( ) methods of an applet? Also explain two ways of invoking an applet. The init( ) method is utilized for fundamental initializati

The scope of the experts system is very limited. It cannot work outside the field it is being used. The users knowledge is required to adjust to new situation. To reduce

What are the factors determine the control signals? Contents of the control step counter Contents of the instruction register Contents of the condition code flag

What are the advantages and disadvantages of macro pre-processor? Advantages Any of existing conventional assembler can be improved in this way to incorporate macro proces

Programmable read only memory (PROM) A PROM is a memory chip on which data can be written only one time. Once a program has been written onto a PROM, it's permanent. Unlike RAM

Q. Define Wide Area Network? Wide Area Network (WAN): It takes a large geographical area and frequently owned by a state. Data transfer rate is low (few KBPS to 10 MBPS) and er

Explain non-pre-emptive algorithms?   Non preemptive algorithms: In this algorithm a job is provided to CPU for execution as long as the job is non-completed the CPU cannot

An established communication session among a server and a workstation.

This method is used to make sure that Swing components are updated by the event-dispatching thread.

The enableEvents() method is used to enable an event for a certain object. Normally, an event is enabled when a listener is added to an object for a certain event. The enableEvents