Question Bank

By -

1. Consider a packet-by-packet fair queuing system with three logical buffers and with a service rate of one unit / second. Show the sequence of transmissions for this system for the following packet arrival pattern:

(i) Buffer 1: arrival at time t=0, length =2 ;arrival at t=4, length= 1

(ii) Buffer 2: arrival at time t=1, length =3 ;arrival at t=2, length= 1

(iii) Buffer 3: arrival at time t=3, length =5 ;

(Jan 10, 10M)

2. With a neat diagram explain the internal network operation of the network.

3. What is congestion? Discuss the general principles of congestion control?

4. Explain the random early detection

5.Explain leaky bucket algorithm

6. Explain the Token bucket policy for the traffic shaping. (July 07, 5M)

7. A computer on a 6Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 1Mbps. It is initially filled to capacity with 8 megabits. How long the computer transmit at the full 6Mbps (July 07, 5M)

8. Explain FIFO and Priority Queues for the traffic management at the packet level

9. Explain Fair Queuing for the traffic management at the packet level

10. Explain Weighted-Fair Queuing for the traffic management at the packet level

11. Write short notes on admission control and policing.

12. Write short notes on traffic shaping

13. Distinguish between end-to-end and hop-by-hop closed loop control

14. Distinguish between implicit and explicit feedback

15. Give the differences between leaky bucket and token bucket algorithm

16. Write a note on Traffic management at the flow-aggregate level.

17. Explain with diagram the TCP/IP architecture

18. Explain IPV4 header. (Feb 06, 6M) (July 09, 6M) (Jan 10, 6M)

19. Explain the IP addressing scheme. (Feb 05, 6M)

20. Distinguish between address resolution protocol and reverse address resolution protocol. (Feb 05, Aug 05, 6M) (July 07, 5M)

21. Illustrate with a diagram the five address formats used in internet(AUG 05, 6M)

22. Briefly explain Address Resolution Protocol. (July05 5M)

23. What is ICMP? Explain the functions of ICMP. (Jan 08 5M)

24. A university has 150 LANs with 100 hosts in each LAN.

a. Suppose the university has one Class B address. Design an appropriate subnet addressing scheme.

b. Design an appropriate CIDR addressing scheme.

(Aug 06, 6M) (Jan 10, 6M)

25. A network on the internet has a subnet mask 255.255.240.0. What is the maximum no. of hosts it can handle? (AUG 05, 6M), (Feb 06, 6M)

26. A large number of consecutive IP address are available at 198.16.0.0. Suppose

that four organizations A, B, C and D request for 4000, 2000, 4000 and 8000 addresses respectively. For each of these, give the first IP address assigned, the last IP address assigned, and the mask in dotted decimal notation.

(Aug 06, 4M)

27. A large number of consecutive IP address are available starting at 200.40.160.0.

Suppose that 3 organizations A, B, and C request for 4000, 2000 and 1000 addresses respectively. For each of these, give the first IP address assigned, the

last IP address assigned, and the mask in dotted decimal notation.(Aug 09, 6M)

28. Write a note on CIDR

29. What is fragmentation? How packets are fragmented and reassembled by the IP?

30. Identify the address class of the following IP addresses: 200.58.20.165; 128.167.23.20; 16.196.128.50; 50.156.10.10; 250.10.24.96.

31. Convert the IP addresses in Problem above to their binary representation.

32. Identify the range of IPv4 addresses spanned by Class A, Class B, and Class C.

33. What are all the possible subnet masks for the Class C address space? List all the subnet masks in dotted-decimal notation, and determine the number of hosts per subnet supported for each subnet mask.

34. A host in an organization has an IP address 150.32.64.34 and a subnet mask

255.255.240.0. What is the address of this subnet? What is the range of IP addresses that a host can have on this subnet?

35. A small organization has a Class C address for seven networks each with 24 hosts. What is an appropriate subnet mask?

36. A packet with IP address 150.100.12.55 arrives at router R1 in Figure 8.8.

Explain how the packet is delivered to the appropriate host.

37. Perform CIDR aggregation on the following /24 IP addresses: 128.56.24.0/24; 128.56.25.0./24; 128.56.26.0/24; 128.56.27.0/24.

38. Perform CIDR aggregation on the following /24 IP addresses: 200.96.86.0/24; 200.96.87.0/24; 200.96.88.0/24; 200.96.89.0/24.

39. Suppose a router receives an IP packet containing 600 data bytes and has to forward the packet to a network with maximum transmission unit of 200 bytes. Assume that the IP header is 20 bytes long. Show the fragments that the router creates and specify the relevant values in each fragment header (i.e., total length, fragment offset, and more bit).

Comments

Post a Comment

Popular posts from this blog

Packet Switching Networks part2

By -
Image
ROUTING TABLES Routing Table for Virtual circuit networks • virtual circuit identifier determines the destination Routing table for datagram networks Specialized Routing Flooding · Principle of flooding : a node (or a packet switch) forwards an incoming packet to all ports except to the one it arrived on. · Each node (a switch) performs the flooding process such that the packet will reach the destination as long as at least one path exists between the source and the destination. · Flooding is a useful o when the information in the routing tables is not available, such as during system startup, o when survivability is required, such as in military networks. o when the source needs to send a packet to all hosts connected to the network (i.e., broadcast delivery). • Flooding generates vast numbers of duplicate packets In figure, initially one packet arriving at node 1 triggers three packets to nodes 2, 3, and 4. In the second phase nodes 2, 3, and 4 send two, two, and thre...
Read more

TCP/IP-II:OSPF Link State Update

By -
Image
OSPF Link State Update In response to LS request or trigger router will send new LS info trigger, using the LS update message Contents are composed of link state advertisements (LSA’s) LS update message is acknowledged using LS ack pkt to ensure that the flooding algorithm is reliable; Link state acknowledgement packets consist of a list of LSA headers. BGP (Border Gateway Protocol): The de facto standard for inter-AS routing, BGP: glues the whole Internet together   P ath Vector protocol Uses TCP (service port: 179) Similar to Distance Vector protocol. Each Border Gateway broadcast to neighbors (peers) e ntire path (i.e., sequence of AS’s) to destination BGP is an exterior gateway protocol (EGP), which means that it performs routing between multiple autonomous systems or domains and exchanges routing and reachability information with other BGP systems. The information exchanged among BGP routers allow a router to construct a graph of AS’s and each AS...
Read more

Packet Switching Networks:Traffic Management

By -
Image
Traffic Management · The main objectives of traffic management are efficient use of network resources & deliver QoS. · Traffic Management is classified into three levels that are Packet level, Flow level and  Flow aggregated level. Traffic Management at Packet Level o Queueing & scheduling at switches, routers and multiplexers. The path traversed by packet through a network can be modeled as sequence of Queueing systems as shown in above figure. A packet traversing network encounters delay and possible loss at various multiplexing points. End-to-end performance is sum of the individual delays experienced at each system. Average end-to-end delay is the sum of the individual average delay. To meet the QoS requirements of multiple services, a queueing system must implement strategies for controlling the transmission bit rates. The different strategies for Queue scheduling are:- 1. FIFO QUEUEING 2. PRIORITY QUEUEING 3. FAIR QUEUEING 4. WEIGHTED FAIR...
Read more