All categories

3 years ago

Computer Networks - Queues

Computers and Technology

1 answer:

lyudmila [28]3 years ago

4 0

Answer:

the average arrival rate \lambda in units of packets/second is 15.24 kbps

the average number of packets w waiting to be serviced in the buffer is 762 bits

Explanation:

Given that:

A single channel with a capacity of 64 kbps.

Average packet waiting time $T_w$ in the buffer = 0.05 second

Average number of packets in residence = 1 packet

Average packet length r = 1000 bits

What are the average arrival rate \lambda in units of packets/second and the average number of packets w waiting to be serviced in the buffer?

The Conservation of Time and Messages ;

E(R) = E(W) + ρ

r = w + ρ

Using Little law ;

r = λ × T_r

w = λ × T_w

r / λ = w / λ + ρ / λ

T_r =T_w + 1 / μ

T_r = T_w +T_s

where ;

ρ = utilisation fraction of time facility

r = mean number of item in the system waiting to be served

w = mean number of packet waiting to be served

λ = mean number of arrival per second

T_r =mean time an item spent in the system

T_w = mean waiting time

μ = traffic intensity

T_s = mean service time for each arrival

the average arrival rate \lambda in units of packets/second; we have the following.

First let's determine the serving time T_s

the serving time T_s $= \dfrac{1000}{64*1000}$

= 0.015625

now; the mean time an item spent in the system T_r = T_w +T_s

where;

T_w = 0.05 (i.e the average packet waiting time)

T_s = 0.015625

T_r = 0.05 + 0.015625

T_r = 0.065625

However; the mean number of arrival per second λ is;

r = λ × T_r

λ = r / T_r

λ = 1000 / 0.065625

λ = 15238.09524 bps

λ ≅ 15.24 kbps

Thus; the average arrival rate \lambda in units of packets/second is 15.24 kbps

b) Determine the average number of packets w waiting to be serviced in the buffer.

mean number of packets w waiting to be served is calculated using the formula

w = λ × T_w

where;

T_w = 0.05

w = 15238.09524 × 0.05

w = 761.904762

w ≅ 762 bits

Thus; the average number of packets w waiting to be serviced in the buffer is 762 bits

You might be interested in

Describe and compare imperative (C), functional (SML) and logic (Prolog) programming paradigms.

daser333 [38]

Answer:

Answered below

Explanation:

Imperative programming paradigm is a paradigm in which the programmer tells the machine how to change its state. It is divided into procedural programming, where programs are grouped as procedures, and object-oriented, where programs are grouped together with the properties they operate on.

Imperative paradigm is efficient, familiar and popular compared to others.

Functional programming paradigm implements all instructions as functions, in a mathematical sense. They take on an argument and return a single solution. The advantage of this, compared to other paradigms, is its abstraction and independence.

Logical programming, like functional programming, incorporates a declarative approach to problem solving. All known facts are first established before queries are made. Advantage of this paradigm is that programming steps are kept to a minimum.

6 0

3 years ago

Two boxes overlap if their interiors have at least one point in common. Give an O(n log n)-time algorithm that decides if there

GaryK [48]

Answer:

// Program is written in C++ programming language

// The program checks if two boxes overlap and prints both boxes

// Comments are used for explanatory purpose

// Program starts here

#include<bits/stdc++.h>

#include <graphics.h>

#include <conio.h>

// Define x and y axis

struct axis { int x, y; };

bool checkRect(Axis l1, Axis r1, Axis l2, Axis r2)

{ // l1, l2, r1 and r2 represent the left and right coordinates of both rectangles

// Check one rectangle is on left side of other

if (l1.x > r2.x || l2.x > r1.x) {

return false; }

// Check if one rectangle is above other

if (l1.y < r2.y || l2.y < r1.y) {

return false; }

return true;

}

// Main Method begins here

int main()

{

// Declare integer variables to enter rectangle coordinates

// For rectangle 1

int left1, left2, right1, right2;

cout<<"Enter First rectangle coordinates: "<<"\n";

cout<<"Top Left: "<<"\n";

cin>>left1;

cout<<"Bottom Left: "<<"\n";

cin>>left2;

cout<<"Top Right: "<<"\n";

cin>>right1;

cout<<"Bottom Right: "<<"\n";

cin>>right2;

// For rectangle 2

int left3, left4, right3, right4;

cout<<"Enter Second rectangle coordinates: "<<"\n";

cout<<"Top Left: "<<"\n";

cin>>left3;

cout<<"Bottom Left: "<<"\n";

cin>>left4;

cout<<"Top Right: "<<"\n";

cin>>right3;

cout<<"Bottom Right: "<<"\n";

cin>>right4;

Axis l1 = {left1, left2}, r1 = {right1, right2};

Axis l2 = {left3, left4}, r2 = {right3, right4};

if (checkRect(l1, r1, l2, r2)) {

cout<<"The Rectangles Overlap"; }

else {

cout<<"Rectangles Don't Overlap";}

// Print Rectangle 1

rectangle (left1, right1, left2, right2);

// Print Rectangle 2

rectangle (left3, right3, left4, right4);

return 0;

}

5 0

3 years ago

What are the advantages of using a vpn?

Fantom [35]

Answer:

Changing ip address to avoid ip ban. keeping your personal info safe while on public connections

Explanation:

Looked it up.

5 0

2 years ago

Consider this binary search tree:______.

Nitella [24]

Answer:

The new root will be 2.

Explanation:

The binary tree is not properly presented (See attachment)

To answer this; first, we need to order the nodes of the tree in a pre-order traversal.

We use pre-order because the question says if something is removed from the left child.

So, the nodes in pre-order form is: 14, 2, 1, 5, 4, 16.

The root of the binary tree is 14 and if 14 is removed, the next is 2.

<em>Hence, the new root will be 2.</em>

7 0

3 years ago

Write a class called Dragon. A Dragon should have a name, a level, and a boolean variable, canBreatheFire, indicating whether or

Alex Ar [27]

Answer: A dragon name could be name Holls and at level 14 and can breathe fire

Explanation:

4 0

3 years ago