Define congestion and grade of service, Computer Engineering

Assignment Help:

Define congestion and grade of service.

Congestion: This is uneconomic to give sufficient equipment to carry all the traffic which could possibly be offered to a telecommunication system. Inside a telephone exchange this is theoretically possible for all subscribers to make a call concurrently. A situation can hence arise that each of the trunks in a group of trunks are busy, and therefore this can accept further calls. This type of state is termed as congestion. Into a message-switched system, calls which arrive throughout congestion wait in a queue till an outgoing trunk becomes free. Therefore, they are delayed but not lost. These systems are so termed as queuing systems or delay system.  A telephone exchange, in a circuit-switched system all attempts to make calls over a congested group of trunks is successful. These systems are so termed as lost-call systems. In a lost-call system the result of congestion is which the traffic in fact carried is less than the traffic offered to the system. Therefore we may write:

Grade of Service: In loss systems, the traffic carried through the network is usually lower than the actual traffic offered to the network through the subscribers. The overload traffic is discarded and hence it is not carried with the network. The amount of traffic discarded by the network is an index of the quality of the facility offered through the network. It is known as Grade of Service (GOS) and is defined by the ratio of lost traffic to offered traffic. Offered traffic is the product of the average no. of calls generated through the users and the average holding time per call. Therefore, GOS is specified:

GOS = (A - A0)/A

Here

A= offered traffic

A0 = carried traffic

A-A0= lost traffic


Related Discussions:- Define congestion and grade of service

Function makestk-predicate function emptystk, 1. Create the following ADTs....

1. Create the following ADTs. (a) Write the constructor function makestk, predicate function emptystk and mutator functions pushstk and popstk: i. makestk returns a new stack

Describe the limitation of fat16, Q. Describe the Limitation of FAT16? ...

Q. Describe the Limitation of FAT16? DOS designers decided to use clusters with as a minimum four sectors in them (so a cluster size of at least 2KB) for all FAT16 hard disks.

Explain program level of parallel processing, Program Level This is nor...

Program Level This is normally the liability of OS (operating system) that runs processes simultaneously. Different programs are generally independent of each other. So paralle

How many two-input AND and OR gates are required to realize , How many two-...

How many two-input AND and OR gates are required to realize Y=CD+EF+G ? Ans. Y=CD+EF+G No. of two i/p AND gates=2 No. of two i/p OR gates = 2 One OR gate to OR CD and EF

Database management system, what is time out based schemes in concurrency c...

what is time out based schemes in concurrency control

The last character of the ldb name, The last character of the LDB name deno...

The last character of the LDB name denote?? Application

JSP, What is java server pages

What is java server pages

Describe about the forms-DBMS, Describe about the Forms- DBMS Forms ar...

Describe about the Forms- DBMS Forms are generally known as data entry screens as they are user interface that allows data in the tables to be viewed, edited or entered. Forms

Analysis of merge sort, i) The width of the sorting + merging circuit is eq...

i) The width of the sorting + merging circuit is equivalent to maximum number of devices needed in a phase is O(n/2). As in the above diagram maximum number of devices for a given

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