Question: In a hierarchical network, multiplexing is used at various levels of hierarchy to carry end - user data, which is all digitized voice ( that
In a hierarchical network, multiplexing is used at various levels of hierarchy to carry enduser data, which is all digitized voice that is phone lines The sound of a voice is sampled times each second by an AnalogtoDigitalConverter in the telephone, each sample being converted to an bit number. of these digitized voice data streams are TDM multiplexed onto a Level network, whose links are just fast enough to carry all this data. The multiplexing is carried out on a per sample basis; that is one sample from one voice data stream is succeeded by one sample from a different voice stream, etc. The data from such Level networks are multiplexed into a Level network using FDM; each Level network is given its own frequency channel. The Level channels are seen to take up only of the usable frequency bandwidth of the links of the Level network; the extra capacity of the Level links is left free for future expansion. Ignore all overheads connected with headers etc.
a What is the bitrate capability of a Level network link? Answer in Mbps assuming Mbps bps
L bitrate: samples second x bits bps
The capacity for L is streams so x bps Mbps
b What would be the bitrate capability of a Level link if all its bandwidth were entirely used for a single data channel?
If the bitrate capability of L is Mbps and it takes L networks to use of Ls bandwidth, then the bitrate capability of a L link is Mbps x Mbps
c Due to a malfunction, the Level network drops all data injected into it for a duration of s This causes a small disruption in each phone conversation whose data got lost. What is the minimum number of conversations which got disrupted?
Mbps x microseconds bits bits conversations.
d With same conditions, what is the maximum number of disrupted conversations?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
