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

Verify vlans and trunking - ccna, Verify VLANs and trunking. Use the sh...

Verify VLANs and trunking. Use the show ip interface trunk command on S1 and the show vlan command on S2 to determine that the switches are trunking correctly and the proper VL

Shortest path - network layer and routing , Shortest path  The  dijkst...

Shortest path  The  dijkstra algorithms  four steps to discover what it called  the shortest path  tree . a.The algorithm  beings  to build  the tree identifying  its root.

Give examples of the application layer, Pretty much any end-user program is...

Pretty much any end-user program is an best example of the Application Layer.

LAN, categories of LAN

categories of LAN

What is sliding window, What is Sliding Window? The sliding window is a...

What is Sliding Window? The sliding window is an abstract method that explains the range of sequence numbers that is the concern of the sender and receiver. In other words, he

Which decision called socket base, IP plus port (IP on layer 3 and port on ...

IP plus port (IP on layer 3 and port on Layer 4 - In Encapsulation, socket base decision on Network Layer -Layer 3)

What is the difference between csma/cd and csma/ca, What is the difference ...

What is the difference between CSMA/CD and CSMA/CA? CSMA/CD, or Collision Detect, retransmits data frames when a collision occurred. CSMA/CA, or Collision Avoidance, will first

Linked list for parallel algorithms, Linked List A linked list is a dat...

Linked List A linked list is a data structure composed of zero or extra nodes linked by pointers. Each node consists of two parts, as shown in Figure: info field having specifi

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