Ask Question, Ask an Expert

+1-415-315-9853

info@mywordsolution.com

Ask Computer Engineering Expert

problem 1: A multiplexer combines four 100-Kbps channels using a time slot of 4 bits (see figure below). Each Frame has the size of 16 bits.

a) Show the output with the four inputs as shown in the figure below.

[Note: only show the output from the visual diagram illustrated]

b) What is the frame rate?

c) What is the frame duration?

572_multiplexer.jpg

problem 2:

i) Assume that frames are 1250 bytes long comprising 25 bytes of overhead. Also suppose that ACK frames are 25 bytes long.

a) Compute the efficiency of stop-and-wait ARQ in a system that transmits at R = 1 Mbps and reaction time 2(Tprop + Tproc) of the following: 1ms, 10ms, 100ms and 1 second. 
b) Repeat if R = 1Gbps.

ii) Please discuss what options does an ARQ protocol have when it detects a frame with the errors?

iii) In a Stop-and-Wait ARQ system, the bandwidth of the line is 1 Mbps and 1 bit takes 20 ms to make a round trip.

a) What is the bandwidth-delay product? 
b) If the system data frames are 1000 bits in length, find out the utilization percentage of the link? 
c) Find out the utilization percentage of the link if the link uses Go-Back-N ARQ with a 15-frame sequence?

problem 3:

i) Consider a system by using flooding with hop counter. Assume that the hop counter is originally set to the ‘diameter’ (number of hops in the longest path without traversing any node twice) of the network. When the hop count reaches zero, the packet is discarded apart from at its destination.

Does this always make sure that a packet will reach its destination if there at least one functioning path (to the destination) that may exist? Why or why not?

[Suppose that a packet will not be dropped unless its hop count goes to zero]

ii) Consider the network shown in figure below. Using Dijkstra’s algorithm and showing your work by using tables.

a) find out the shortest paths from A to all network nodes.
b) find out the shortest paths from B to all network nodes.

688_dijkstra alorithm.jpg

problem 4:

i) Assume that N stations are connected to an extended Ethernet LAN, as shown in figure below, operating at the rate of 10 Mbps. Suppose that the efficiency of each Ethernet is 80 percent. Also suppose that each station transmits frames at the average rate of R bps, and each frame is equally likely to be destined to any station (including to itself).

a) What is the maximum number of stations, N, that can be supported if R is equivalent to 100 kbps? 
b) If the bridge is replaced with a repeater, what is the maximum number of stations that can be supported? (Suppose that the efficiency of the whole Ethernet is still 80 percent.)

2321_ethernet lan.jpg

problem 5:

i) Assume there are exactly five packet switches (figure shown below) between a sending host and a receiving host connected by a virtual circuit line (shown as dotted line in figure below). The transmission rates between the different network elements are as follows:

Between sending host and the 1st switch the rate is 2R1; 
Between the 1st and the 2nd switch the rate is 3R2; 
Between the 2nd and the 3rd switch the rate is R3. 
Between the 3rd and the 4th switch the rate is 3R2;
Between the 4th and the 5th switch the rate is R1;
Between the 5th and the receiving host the rate is R1;

Find out the total end-to-end delay to send a packet of length 2L?

1542_virtual circuit line.jpg

ii) Consider an application which transmits data at a steady rate (for illustration, the sender generates an N-bit unit of data every k time units, where k is small and fixed). Also, when such an application begins, it will continue running for a relatively long period of time. Answer the given problems briefly justifying your answer:

a) Would a packet-switched or circuit-switched network be more suitable for the application? Why?
b) Assume that a packet-switched network is used and the only traffic in this network comes from such applications as describeed above. Furthermore, assume that the sum of the application data rates is less than the capacities of each and every link. Is some form of congestion control required? Why?

iii) Recall that ATM uses 53-byte packets consisting of five header bytes and 48 payload bytes. 53 bytes is unusually small for fixed-length packets; most networking protocols (IP, Ethernet, Frame Relay and so on) use packets that are, on average, significantly larger. One of the drawbacks of a small packet size is that a large fraction of link bandwidth is consumed by overhead bytes; in case of ATM, around 10% of the bandwidth is ‘wasted’ by the ATM header. In this problem we investigate why such a small packet size was selected.

a) Consider sending a digitally encoded voice source over ATM. Assume that the source is encoded at a constant rate of 64 Kbps. Assume each cell is completely filled before the source sends the cell into the network. The time needed to fill a cell is the packetization delay in milliseconds. In terms of L (bytes), find out the packetization delay in milliseconds.

b) Packetization delays greater than 20 msec can cause a noticeable and unpleasant echo. Find out the packetization delay for

i) L = 1,500 bytes (roughly corresponding to a maximum-sized Ethernet packet) and for:

ii) L = 53 (corresponding to an ATM cell).

c) Compute the transmission delay at a single ATM switch for a link rate of: R = 155 Mbps for:

i) L = 1500 bytes
ii) L = 53 bytes.

d) Comment on the advantages of using a small ATM cell.

Computer Engineering, Engineering

  • Category:- Computer Engineering
  • Reference No.:- M91741
  • Price:- $120

Guranteed 48 Hours Delivery, In Price:- $120

Have any Question? 


Related Questions in Computer Engineering

Design and implement a word-searching algorithm that on

Design and implement a word-searching algorithm that on finding a mismatch with the current word simply reads characters to the start of the next word before attempting a match again.

Using the extended euclidean algorithm compute the greatest

Using the extended Euclidean algorithm, compute the greatest common divisor and the parameters s,t of 1. 198 and 243 2. 1819 and 3587 For every problem check if sr0 +t r1 = gcd(r0,r1) is actually fulfilled. The rules are ...

1 prove that an n x n haar transform matrix is orthogonal

1. Prove that an N x N Haar transform matrix is orthogonal and can be implemented in 0 (N) operations on an N x 1 vector. 5.21 Using the recursive formula for generating the slant transforms prove that these matrices are ...

1 compare and contrast the ideas of virtual memory and

1. Compare and contrast the ideas of virtual memory and virtual machines. How do the goals of each compare? What are the pros and cons of each? List a few cases where virtual memory is desired, and a few cases where virt ...

1 implement a loop that prompts a user to enter a number

1. Implement a loop that prompts a user to enter a number between 1 and 10, giving three tries to get it right 2. Sometimes students write programs with instructions such as "Enter data, 0 to quit" and that exit the data ...

A robot must find the shortest path between a starting

A robot must find the shortest path between a starting point. s. and a goal location. g. in the two-dimensional space populated by polygonal obstacles shown here. Assume the robot is of infinitesimal size. The path can b ...

1 draw a network map that shows the topology of the mfn and

1. Draw a network map that shows the topology of the MFN and how the main components are connected. 2. What other information would you gather to improve your map and add more detail?

Alice has a video clip that bob is interested in getting

Alice has a video clip that Bob is interested in getting; Bob has another video clip that Alice is interested in getting. Bob creates a web page and runs an HTTP server. How can Alice get Bob's clip? How can Bob get Alic ...

The registration area has just opened at large convention

The registration area has just opened at large convention of building contractors in New York. There are 600 people arriving per hour (exponential interarrival times), and their cost of waiting in queue is valued at $40 ...

Create a simple model that includes some agents a rule for

Create a simple model that includes some agents, a rule for birth of agents (see hatch primitive) and a rule for death of agents (see die primitive). It is often useful to include a rule for agent movement. The agents ca ...

  • 4,153,160 Questions Asked
  • 13,132 Experts
  • 2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

WalMart Identification of theory and critical discussion

Drawing on the prescribed text and/or relevant academic literature, produce a paper which discusses the nature of group

Section onea in an atwood machine suppose two objects of

SECTION ONE (a) In an Atwood Machine, suppose two objects of unequal mass are hung vertically over a frictionless

Part 1you work in hr for a company that operates a factory

Part 1: You work in HR for a company that operates a factory manufacturing fiberglass. There are several hundred empl

Details on advanced accounting paperthis paper is intended

DETAILS ON ADVANCED ACCOUNTING PAPER This paper is intended for students to apply the theoretical knowledge around ac

Create a provider database and related reports and queries

Create a provider database and related reports and queries to capture contact information for potential PC component pro