Asynchronous or statistical time division multiplexing, Computer Networking

Assignment Help:

Asynchronous or Statistical Time Division Multiplexing

As we  have seen  synchronous  TDM does not  guarantee that the full capacity of a link in sued. In fact it is more likely  that only  a portion of the  time slots are in use at a given  instant. Because  the time  slots  are reassigned and  fixed whenever a connected device is not  transmitting, the  corresponding  slot is empty and that much   capacity of the path  is wasted. For  example imagine that we have multiplexed the output of 20 identical computer onto a single line. Suing synchronous TDM the speed  of that line must be at  least 20 times the speed of each input line. But  what  if only 10 computers  are in use at a time ? half of the capacity  of the line  is wasted.

Statistical  time  division  multiplexing is designed to avoid this type of waste. As with  the term  synchronous. The term  asynchronous means some  things   different  in multiplexing  that it  means  in other  areas of data communications. Here it  flexible  or not  fixed.

Like synchronous TDM asynchronous TDM allows  a number of lower  speed  input  lines  to be  multiplexed  to a single  higher speed  line. Unlike  synchronous  TDM however in asynchronous TDM the total  speed of the input  can be greater than  the capacity  of the path. In a synchronous systems if we have in  input  lines. The frame contains a fixed number of a least m time  slots. In  an asynchronous systems. If  we have  n input line the  frame contains no more  than  m slots with m less than n. In  this way asynchronous TDM supports  the same  number of input lines as synchronous TDM with a lower capacity  link or given the same  link. Asynchronous TDM can support more  devices  than  synchronous TDM.

1558_Asynchronous or Statistical Time Division Multiplexing.gif

figure Asynchronous TDM

The number  of time  slots in an asynchronous TDM fame is based on a statistical analysis of the number  of input lines that are likely to be transmitting at any given  time. Rather than being reassigned each slot  is available to any  of the attached input lines  that has data  to seen. The  multiplexer scans the input lines accept portions of data until a frame is felled and then sends the frame across the link. If  there are not enough data to  fill all the  slot s in a frame the frame a transmitted only partially filled thus full link capacity  may not be used 100 percent   of the time. But  the ability to allocate time slots  dynamically coupled with  the lower  ration of the slots  to input  greatly reduces the likelihood and degree  of waste.

 

 


Related Discussions:- Asynchronous or statistical time division multiplexing

Explain how the LAN model be developed, Explain how the lan model be develo...

Explain how the lan model be developed The LAN model can be developed incrementally. If LAN is just a long cable. it cannot be brought down by single failure (if servers are re

Create and simulate a network - netml system, Create and simulate a network...

Create and simulate a network similar to the one shown here, using the NetML system. The network is a little more complex, as depicted at the right. There is an extra node

Explain multipoint connection, Explain multipoint connection. A multipo...

Explain multipoint connection. A multipoint connection is a link among three or more devices. Historically, multipoint connections were used to attach central CPs to distribute

compute maximum current and properties of an ideal op-amp, Questions: ...

Questions: 1. A 5V Zener diode has a maximum power dissipation of 2W. What is the maximum current that can be safely passed through the device? 2. List three properties of a

What is horizontal and vertical parity, What is horizontal and vertical par...

What is horizontal and vertical parity A single error can cause both horizontal and vertical parity checks to be wrong. Two errors can also be easily detected. If they are not

Determine the mean node-node path, Mean node-node path The mean node-no...

Mean node-node path The mean node-node path is two times the mean node-root path.  Number the levels of the tree with the root as 1 and the deepest level as N.  The path from t

Determine downloading time when non persistent http is used, Assume that a ...

Assume that a user wants to download from a server a web page that references 3 objects. The base page and each of the objects are of the same size that requires 20 ms transmission

What is convergence time, Convergence time is slower for Distant Vector rou...

Convergence time is slower for Distant Vector routing and is faster for Link State routing.

Message passing libraries mpi and pvm, In this part, we shall talk about ab...

In this part, we shall talk about about message passing libraries. In history, various message passing libraries have been available since the 1980s. These executions differed subs

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd