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

1 you want to write a program in which you need to refer to

1. You want to write a program in which you need to refer to the InetAddress of the computer you are working with. Write a statement in Java to create the corresponding object. 2. You want to create all InetAddress objec ...

Design and implement an algorithm that inserts items on the

Design and implement an algorithm that inserts items on the end of a list. Your algorithm should not have to search the list to perform the insertion.

Consider an ethernet segment with propagation delay between

Consider an Ethernet segment with propagation delay between any two nodes at most 225 bit times. Assuming the smallest possible Ethernet frame to be 576 bits (which it is), can a host transmit a frame without detecting a ...

1 how many 16-byte cache blocks are needed to store all

1. How many 16-byte cache blocks are needed to store all 32-bit matrix elements being referenced? 2. References to which variables exhibit temporal locality? 3. References to which variables exhibit spatial locality? 4. ...

1 list and describe four vulnerability intelligence sources

1. List and describe four vulnerability intelligence sources. Of those that you listed, which seems the most effective? Why? 2. What does CERT stand for? Is there more than one CERT? What is the purpose of a CERT?

Fisch white and pooch 353 define four levels of log

Fisch, White, and Pooch [353] define four levels of log sanitization. a. Simple sanitization, in which all information except the commands issued by an intruder are deleted b. Information-tracking sanitization, in which ...

Given is the same curve as in 97 the order of this curve is

Given is the same curve as in 9.7. The order of this curve is known to be #E = 37. Furthermore, an additional point Q = 15 · P = (14,23) on this curve is given. Determine the result of the following point multiplications ...

1 at any moment a rip message may arrive at a router that

1. At any moment, a RIP message may arrive at a router that runs RIP as the routing protocol. Does it mean that the RIP process should be running all the time? 2. Why do you think RIP uses UDP instead of TCP? 3. We say t ...

1 given is a stream cipher which uses a single lfsr as key

1. Given is a stream cipher which uses a single LFSR as key stream generator. The LFSR has a degree of 256. 1. How many plaintext/ciphertext bit pairs are needed to launch a successful attack? 2. Describe all steps of th ...

1 write a regular expression that finds all the words in a

1. Write a regular expression that finds all the words in a string that contain double letters, such as "deep" and "book". 2. Write a regular expression that finds all the header tags (, , etc.) in a Web page. 3. Write a ...

  • 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

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

Describe what you learned about the impact of economic

Describe what you learned about the impact of economic, social, and demographic trends affecting the US labor environmen