Packets and time division multiplexing (tdm), Operating System

Broken data into small packets allow time division multiplexing. In TDM every packet leaves the sender and is switched on the shared interaction channel through a multiplexer. At the receiver end the packet is switched through a demultiplexer to the destination. In the diagram this process is explained with a multiplexing circuit given.

 

901_packet and TDM.png

Posted Date: 7/30/2012 5:22:09 AM | Location : United States







Related Discussions:- Packets and time division multiplexing (tdm), Assignment Help, Ask Question on Packets and time division multiplexing (tdm), Get Answer, Expert's Help, Packets and time division multiplexing (tdm) Discussions

Write discussion on Packets and time division multiplexing (tdm)
Your posts are moderated
Related Questions
General graph directory The serious problem with using an acyclic-graph structure is ensuring that there are no cycles. When we insert links to an existing tree-structured dire

How is it different from the unbounded buffer algorithm ? Explain.

Extend task 1 so that the requests are issued by the clients instead of the server. The server now do not use the "all_requests.dat" file. Instead every client thread reads from

FIFO page replacement This is the easiest page replacement algorithm. Here the 1 st page toward the inside is the 1 st to leave that is the oldest page leaves. To execute th

Question : The file system is the most visible aspect of an operating system. It provides the mechanism for on-line storage and access to both data and programs of the operatin

Briefly discuss on Bankers algorithm? The resource-allocation graph algorithm is not applicable to a resource-allocation system with multiple examples  for each resource type.

How can a user program disturb the normal operation of the system? a) Issuing illegal I/O operation. b) By accessing memory locations within the OS itself. c) Refusing to

Q. Most WANs utilize only a partially connected topology. Why is this subsequently Answer: Cost. A completely connected network requires a link between every node in the netw

What are the requirements for solution of critical section problems? Mutual exclusion : If process p is implementing in its critical section then no other processes can be exe

Explain Belady's Anomaly? Also called FIFO anomaly. Usually, on enhancing the number of frames allocated to a process virtual memory, the process implementation is faster, beca