SlideShare a Scribd company logo
3
Most read
5
Most read
7
Most read
P Consider the network below.
a.Suppose that this network is a datagram network. Show the forwarding table in router
A, such that all traffic destined to host H3 is forwarded through interface 3.
b. Suppose that this network is a datagram network. Can you write down a forwarding
table in router A, such that all traffic from HI destined to host H3 is forwarded through
interface 3, while all traffic from H2 destined to host H3 is forwarded through
interface 4? (Hint: this is a trick question.)
c.Now suppose that this network is a virtual circuit network and that there is one ongoing
call between HI and H3, and another ongoing call between H2 and H3. Write down a
forwarding table in router A, such that all traffic from HI destined to host H3 is
forwarded through interface 3, while all traffic from H2 destined to host H3 is
forwarded through interface 4.
d. Assuming the same scenario as (c), write down the forwarding tables in nodes B, C,
and D.
Solution:
a) For Router A, data destined to host H3 is forwarded through interface 3.
Distention address Link interface
H3 #3
b) No, because, for datagram networks, forwarding rule is only based only on destination
address (not the source address).
c) One possible configuration for Router A is:
Incoming interface Incoming VC# Outgoing Interface Outgoing VC#
1 12 3 22
2 63 4 18
Note, that the two flows could actually have the same VC numbers.
d) One possible configuration is: for Router B
Incoming interface Incoming VC# Outgoing Interface Outgoing VC#
1 22 2 24
COMPUTER NETWORKS
Our online Tutors are available 24*7 to provide Help with Computer Networks Homework/Assignment
or a long term Graduate/Undergraduate Computer Networks Project. Our Tutors being experienced
and proficient in Computer Networks ensure to provide high quality Computer Networks Homework
Help. Upload your Computer Networks Assignment at ‘Submit Your Assignment’ button or email it
to info@assignmentpedia.com. You can use our ‘Live Chat’ option to schedule an Online Tutoring
session with our Computer Networks Tutors.
For Router C
Incoming interface Incoming VC# Outgoing Interface Outgoing VC#
1 18 2 50
For Router D
Incoming interface Incoming VC# Outgoing Interface Outgoing VC#
1 24 3 70
2 50 3 76
P Suppose two packets arrive at different input ports of a router at exactly the same time.
Also suppose there are no other packets in the router.
a. Suppose the two packets are to be forwarded to two different output ports. Is it
possible to forward the two packets through the switch fabric at the same time when
the fabric uses a shared bus?
b. Suppose the two packets are to be forwarded to two different output ports. Is it
possible to forward the two packets through the switch fabric at the same time when
the fabric uses a crossbar?
c. Suppose the two packets are to be forwarded to the same output port. Is it possible to
forward the two packets through the switch fabric at the same time when the fabric
uses a crossbar?
Solution:
a) No, you can only transmit one packet at a time over a shared bus.
b) Yes, as long as the two packets use different input busses and different output busses,
they can be forwarded in parallel.
c) No, in this case the two packets would have to be sent over the same output bus at the
same time, which is not possible.
1
2
3
4
1
2
3 4
2
3 4
1
P Consider the switch shown below. Suppose that all datagrams have the same fixed
length, that the switch operates in a slotted, synchronous manner, and that in one time
slot a datagram can be transferred from an input port to an output port. The switch fabric
is a crossbar so that at most one datagram can be transferred to a given output port in a
time slot, but different output ports can receive datagrams from different input ports in a
single time slot. What is the minimal number of time slots needed to transfer the packets
shown from input ports to their output ports, assuming any input queue scheduling order
you want? What is the largest number of slots needed, assuming the worst-case scheduling
order you can devise, assuming that a non-empty input queue is never idle?
Solution:
Assuming FIFO queue scheduling.
The minimal number of time slots needed is 3. The scheduling is as follows.
Slot 1: send X in top input queue, send Y in middle input queue.
Slot 2: send X in middle input queue, send Y in bottom input queue
Slot 3: send Z in bottom input queue.
Largest number of slots is still 3. Actually, based on the assumption that a non-empty input
queue is never idle, we see that the first time slot always consists of sending X in the top input
queue and Y in either middle or bottom input queue, and in the second time slot, we can
always send two more datagram, and the last datagram can be sent in third time slot.
NOTE: Actually, if the first datagram in the bottom input queue is X, then the worst case would
require 4 time slots.
P Consider a datagram network using 32-bit host addresses. Suppose a router has four
links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as
follows:
Destination Address Range Link Interface
11100000 00000000 00000000 00000000
through 0
11100000 00111111 11111111 11111111
11100000 01000000 00000000 00000000
through 1
11100000 01000000 11111111 11111111
11100000 01000001 00000000 00000000
through 2
11100001 01111111 11111111 11111111
otherwise 3
a. Provide a forwarding table that has four entries, uses longest prefix matching, and
forwards packets to the correct link interfaces.
b. Describe how your forwarding table determines the appropriate link interface for
datagrams with destination addresses:
11001000 10010001 01010001 01010101
11100001 01000000 11000011 00111100
11100001 10000000 00010001 01110111
Solition:
a)
Range Range covered by the mask Prefix Match Interface
11100000
11100000
00000000
00111111
00000000
11111111
00000000
11111111
11100000
11100000
00000000
00111111
00000000
11111111
00000000
11111111
11100000 00 0
11100000
11100000
01000000
01000000
00000000
11111111
00000000
11111111
11100000
11100000
01000000
01000000
00000000
11111111
00000000
11111111
11100000 01000000 1
11100000
11100001
01000001
01111111
00000000
11111111
00000000 (1)
11111111
11100000
11100000
00000000
01000000
00000000
11111111
00000000
11111111
11100000 0 (2)
Already
included in
0 & 1
11100000
11100001
01000001
01111111
00000000
11111111
00000000
11111111
1110000 2
11100001
11100001
10000000
11111111
00000000
11111111
00000000
11111111
11100001 1 (3)
3
Otherwise Otherwise 3
(1) The prefix 1110000 covers more range than needed. We need to make sure that the range in (2) and the range in (3) are not forwarded
to interface#2.
Prefix Match Link Interface
11100000 00 0
11100000 01000000 1
1110000 2
11100001 1 3
otherwise 3
b) Prefix match for first address is 5th
entry: link interface 3
Prefix match for second address is 3nd
entry: link interface 2
Prefix match for third address is 4th
entry: link interface 3
P Consider a router that interconnects three subnets: Subnet 1, Subnet 2, and Subnet 3.
Suppose all of the interfaces in each of these three subnets are required to have the prefix
223.1.17/24. Also suppose that Subnet 1 is required to support up to 60 interfaces, Subnet 2
is to support up to 90 interfaces, and Subnet 3 is to support up to 12 interfaces. Provide
three network addresses (of the form a.b.c.d/x) that satisfy these constraints.
Solution:
The parent network address is 223.1.17/24.
24 bits are prefix for the network. 8 bits can be used for subnet portions & host portions.
Start with the largest required subnet (Subnet 2)
 Subnet #2 (90 interfaces)
Subnet
portion
Host portion
128 64 32 16 8 4 2 1
With 7 bits, we can get 128 addresses (126 usable host addresses + 1 subnet address
+ 1 subnet broadcast address), which is > 90.
1 bit is left for the subnet portion (we can have 2 subnets, each with 128 addresses)
223.1.17.0/25 (range 223.1.17.0 to 223.1.17. 127)
223.1.17.128/25 (range 223.1.17.128 to 223.1.17. 255)
We assign one of those subnets to our Subnet #2 and further subnet the other range
for out Subnet #1 & Subnet #3.
Subnet #2 223.1.17.128/25 , Mask 255.255.255.128
Subnet ID  223.1.17.128 , Subnet broadcast address  223.1.17.255
Hosts  223.1.17.129 to 223.1.17.254
 Subnet #1 (60 interfaces)
The parent network 223.1.17.0/25 (32-25= 7 bits can be used for subnet portions &
and host portions)
Prefix
to 0
Subnet
portion
Host portion
128 64 32 16 8 4 2 1
We can have 2 subnets, each with 64 addresses:
223.1.17.0/26 (range 223.1.17.0 to 223.1.17. 63)
223.1.17.64/26 (range 223.1.17.64 to 223.1.17. 127)
Subnet #1 223.1.17.0/26 , Mask 255.255.255.0
Subnet ID  223.1.17.0 , Subnet broadcast address  223.1.17.63
Hosts  223.1.17.1 to 223.1.17.62
 Subnet #3 (12 interfaces)
The parent network is 223.1.17.64/26
Prefix
to 0
Prefix
to 1
Subnet
portion
Host portion
128 64 32 16 8 4 2 1
We can have 4 subnets, each with 16 addresses:
223.1.17.64/28 (range 223.1.17.64 to 223.1.17. 79)
223.1.17.80/28 (range 223.1.17.80 to 223.1.17. 95)
223.1.17.96/28 (range 223.1.17.96 to 223.1.17. 111)
223.1.17.112/28 (range 223.1.17.112 to 223.1.17. 127)
We assign one of these to our Subnet #3
Subnet #3 223.1.17.96/28 , Mask 255.255.255.96
Subnet ID  223.1.17.96 , Subnet broadcast address  223.1.17.111
Hosts  223.1.17.97 to 223.1.17.110
P Consider a subnet with prefix 128.119.40.128/26. Give an example of one IP address (of
form xxx.xxx.xxx.xxx) that can be assigned to this network. Suppose an ISP owns the block of
addresses of the form 128.119.40.64/26. Suppose it wants to create four subnets from this
block, with each block having the same number of IP addresses. What are the prefixes (of
form a.b.c.d/x) for the four subnets?
Solution:
Any IP address in range 128.119.40.128 to 128.119.40.191 can be an example.
Four equal size subnets:
128.119.40.64/28,
128.119.40.80/28,
128.119.40.96/28,
128.119.40.112/28
visit us at www.assignmentpedia.com or email us at info@assignmentpedia.com or call us at +1 520 8371215

More Related Content

What's hot (20)

PDF
computer networking a top down approach 6 th edition solutions to review ques...
ssuser83d26a1
 
PPTX
Ford Fulkerson Algorithm
Adarsh Rotte
 
PDF
Elementary Differential Equations 11th Edition Boyce Solutions Manual
MiriamKennedys
 
PPT
Application layer protocols
JUW Jinnah University for Women
 
PPTX
Dijkstra's algorithm
Anaya Zafar
 
PPTX
The medium access sublayer
Lal Bahadur Gehlot
 
PPT
Topic: Virtual circuit & message switching
Dr Rajiv Srivastava
 
PDF
Answers computer networks 159334 assignment_2_2010
Lakshmi Gupta
 
PPT
Operators
Devi Pradeep Podugu
 
PDF
Notes on Equation of Plane
Herbert Mujungu
 
PDF
Genetic Algorithm (1).pdf
AzmiNizar1
 
PDF
Chap 8 The stack and introduction to procedures & Chapter 9 multiplication an...
warda aziz
 
PPTX
PageRank Algorithm In data mining
Mai Mustafa
 
PPTX
Introduction to Graph Theory
Premsankar Chakkingal
 
PDF
Advanced Comuter Architecture Ch6 Problem Solutions
Joe Christensen
 
PPTX
Matrix Representation Of Graph
Abhishek Pachisia
 
DOCX
CDMA - USE WALSH TABLE TO GENERATE CHIP SEQUENCE
0586umer
 
PPTX
Euler’s formula
Rahul Sharma
 
PPTX
Presentation Routing algorithm
Basit Hussain
 
PPTX
Directed Acyclic Graph Representation of basic blocks
Mohammad Vaseem Akaram
 
computer networking a top down approach 6 th edition solutions to review ques...
ssuser83d26a1
 
Ford Fulkerson Algorithm
Adarsh Rotte
 
Elementary Differential Equations 11th Edition Boyce Solutions Manual
MiriamKennedys
 
Application layer protocols
JUW Jinnah University for Women
 
Dijkstra's algorithm
Anaya Zafar
 
The medium access sublayer
Lal Bahadur Gehlot
 
Topic: Virtual circuit & message switching
Dr Rajiv Srivastava
 
Answers computer networks 159334 assignment_2_2010
Lakshmi Gupta
 
Notes on Equation of Plane
Herbert Mujungu
 
Genetic Algorithm (1).pdf
AzmiNizar1
 
Chap 8 The stack and introduction to procedures & Chapter 9 multiplication an...
warda aziz
 
PageRank Algorithm In data mining
Mai Mustafa
 
Introduction to Graph Theory
Premsankar Chakkingal
 
Advanced Comuter Architecture Ch6 Problem Solutions
Joe Christensen
 
Matrix Representation Of Graph
Abhishek Pachisia
 
CDMA - USE WALSH TABLE TO GENERATE CHIP SEQUENCE
0586umer
 
Euler’s formula
Rahul Sharma
 
Presentation Routing algorithm
Basit Hussain
 
Directed Acyclic Graph Representation of basic blocks
Mohammad Vaseem Akaram
 

Similar to Computer Networks Homework Help (20)

PDF
Prb#5
Ahmad Osama
 
PDF
Cisco.actualtests.200 120.v2013-12-10.by.watson.314q (2 new q)
keiko277
 
PDF
Cisco.exactquestions.200 120.v2014-12-23.by.konrad.338q
keiko277
 
PDF
CISCO Exact Questions By: Konard
Eng. Emad Al-Atoum
 
PPT
Ip
jhadinu
 
PDF
00-105 Interconnecting Cisco Networking Devices Part 1 (ICND1.pdf
Fiona Phillips
 
PDF
CCNA Exam Question
Eng. Emad Al-Atoum
 
PDF
Ccna 200-120 Exam Dumps
Eng. Emad Al-Atoum
 
PDF
Uccn1003 -may2010_-_mid_term_01_-_part2of2
Shu Shin
 
PPT
Network (FE)
Tanat Tonguthaisri
 
PDF
Cisco discovery drs ent module 10 - v.4 in english.
igede tirtanata
 
PDF
Inter quiz
kmanishuli
 
PPT
Final exam review answer(networking)
welcometofacebook
 
PPTX
Computer Networking Assignment Help
Computer Network Assignment Help
 
PDF
1 using default
guest10184a
 
PDF
1 using default
guest10184a
 
PDF
DLL-Files Fixer 3.3.91.3080 Crack Full + License Key 2025 [Latest]
shahban786ajmal
 
PDF
Grand Theft Auto GTA 5 Free Download for PC Crack Full Latest Version 2025
shahban786ajmal
 
PDF
Wondershare DemoCreator Crack Latest Version Full Download 2025
shahban786ajmal
 
PDF
Wondershare Filmora 14.3.2 Crack + License Key Free Latest 2025
shahban786ajmal
 
Cisco.actualtests.200 120.v2013-12-10.by.watson.314q (2 new q)
keiko277
 
Cisco.exactquestions.200 120.v2014-12-23.by.konrad.338q
keiko277
 
CISCO Exact Questions By: Konard
Eng. Emad Al-Atoum
 
00-105 Interconnecting Cisco Networking Devices Part 1 (ICND1.pdf
Fiona Phillips
 
CCNA Exam Question
Eng. Emad Al-Atoum
 
Ccna 200-120 Exam Dumps
Eng. Emad Al-Atoum
 
Uccn1003 -may2010_-_mid_term_01_-_part2of2
Shu Shin
 
Network (FE)
Tanat Tonguthaisri
 
Cisco discovery drs ent module 10 - v.4 in english.
igede tirtanata
 
Inter quiz
kmanishuli
 
Final exam review answer(networking)
welcometofacebook
 
Computer Networking Assignment Help
Computer Network Assignment Help
 
1 using default
guest10184a
 
1 using default
guest10184a
 
DLL-Files Fixer 3.3.91.3080 Crack Full + License Key 2025 [Latest]
shahban786ajmal
 
Grand Theft Auto GTA 5 Free Download for PC Crack Full Latest Version 2025
shahban786ajmal
 
Wondershare DemoCreator Crack Latest Version Full Download 2025
shahban786ajmal
 
Wondershare Filmora 14.3.2 Crack + License Key Free Latest 2025
shahban786ajmal
 
Ad

More from Assignmentpedia (20)

PDF
Transmitter side components
Assignmentpedia
 
PDF
Single object range detection
Assignmentpedia
 
PDF
Sequential radar tracking
Assignmentpedia
 
PDF
Resolution project
Assignmentpedia
 
PDF
Radar cross section project
Assignmentpedia
 
PDF
Radar application project help
Assignmentpedia
 
PDF
Parallel computing homework help
Assignmentpedia
 
PDF
Network costing analysis
Assignmentpedia
 
PDF
Matlab simulation project
Assignmentpedia
 
PDF
Matlab programming project
Assignmentpedia
 
PDF
Links design
Assignmentpedia
 
PDF
Image processing project using matlab
Assignmentpedia
 
PDF
Help with root locus homework1
Assignmentpedia
 
PDF
Transmitter subsystem
Assignmentpedia
 
PDF
Theory of computation homework help
Assignmentpedia
 
PDF
Econometrics Homework Help
Assignmentpedia
 
PDF
Video Codec
Assignmentpedia
 
PDF
Radar Spectral Analysis
Assignmentpedia
 
PDF
Pi Controller
Assignmentpedia
 
PDF
Help With Digital Communication Project
Assignmentpedia
 
Transmitter side components
Assignmentpedia
 
Single object range detection
Assignmentpedia
 
Sequential radar tracking
Assignmentpedia
 
Resolution project
Assignmentpedia
 
Radar cross section project
Assignmentpedia
 
Radar application project help
Assignmentpedia
 
Parallel computing homework help
Assignmentpedia
 
Network costing analysis
Assignmentpedia
 
Matlab simulation project
Assignmentpedia
 
Matlab programming project
Assignmentpedia
 
Links design
Assignmentpedia
 
Image processing project using matlab
Assignmentpedia
 
Help with root locus homework1
Assignmentpedia
 
Transmitter subsystem
Assignmentpedia
 
Theory of computation homework help
Assignmentpedia
 
Econometrics Homework Help
Assignmentpedia
 
Video Codec
Assignmentpedia
 
Radar Spectral Analysis
Assignmentpedia
 
Pi Controller
Assignmentpedia
 
Help With Digital Communication Project
Assignmentpedia
 
Ad

Recently uploaded (20)

PDF
Peak of Data & AI Encore AI-Enhanced Workflows for the Real World
Safe Software
 
PPTX
Digital Circuits, important subject in CS
contactparinay1
 
DOCX
Python coding for beginners !! Start now!#
Rajni Bhardwaj Grover
 
PDF
Go Concurrency Real-World Patterns, Pitfalls, and Playground Battles.pdf
Emily Achieng
 
PPTX
AI Penetration Testing Essentials: A Cybersecurity Guide for 2025
defencerabbit Team
 
PDF
Agentic AI lifecycle for Enterprise Hyper-Automation
Debmalya Biswas
 
PDF
“NPU IP Hardware Shaped Through Software and Use-case Analysis,” a Presentati...
Edge AI and Vision Alliance
 
PDF
Future-Proof or Fall Behind? 10 Tech Trends You Can’t Afford to Ignore in 2025
DIGITALCONFEX
 
PPTX
Designing_the_Future_AI_Driven_Product_Experiences_Across_Devices.pptx
presentifyai
 
PPTX
Seamless Tech Experiences Showcasing Cross-Platform App Design.pptx
presentifyai
 
PDF
“Squinting Vision Pipelines: Detecting and Correcting Errors in Vision Models...
Edge AI and Vision Alliance
 
PPTX
New ThousandEyes Product Innovations: Cisco Live June 2025
ThousandEyes
 
PDF
Automating Feature Enrichment and Station Creation in Natural Gas Utility Net...
Safe Software
 
PDF
SIZING YOUR AIR CONDITIONER---A PRACTICAL GUIDE.pdf
Muhammad Rizwan Akram
 
PDF
Reverse Engineering of Security Products: Developing an Advanced Microsoft De...
nwbxhhcyjv
 
PPT
Ericsson LTE presentation SEMINAR 2010.ppt
npat3
 
PDF
“Voice Interfaces on a Budget: Building Real-time Speech Recognition on Low-c...
Edge AI and Vision Alliance
 
PDF
“Computer Vision at Sea: Automated Fish Tracking for Sustainable Fishing,” a ...
Edge AI and Vision Alliance
 
PDF
How do you fast track Agentic automation use cases discovery?
DianaGray10
 
PPTX
The Project Compass - GDG on Campus MSIT
dscmsitkol
 
Peak of Data & AI Encore AI-Enhanced Workflows for the Real World
Safe Software
 
Digital Circuits, important subject in CS
contactparinay1
 
Python coding for beginners !! Start now!#
Rajni Bhardwaj Grover
 
Go Concurrency Real-World Patterns, Pitfalls, and Playground Battles.pdf
Emily Achieng
 
AI Penetration Testing Essentials: A Cybersecurity Guide for 2025
defencerabbit Team
 
Agentic AI lifecycle for Enterprise Hyper-Automation
Debmalya Biswas
 
“NPU IP Hardware Shaped Through Software and Use-case Analysis,” a Presentati...
Edge AI and Vision Alliance
 
Future-Proof or Fall Behind? 10 Tech Trends You Can’t Afford to Ignore in 2025
DIGITALCONFEX
 
Designing_the_Future_AI_Driven_Product_Experiences_Across_Devices.pptx
presentifyai
 
Seamless Tech Experiences Showcasing Cross-Platform App Design.pptx
presentifyai
 
“Squinting Vision Pipelines: Detecting and Correcting Errors in Vision Models...
Edge AI and Vision Alliance
 
New ThousandEyes Product Innovations: Cisco Live June 2025
ThousandEyes
 
Automating Feature Enrichment and Station Creation in Natural Gas Utility Net...
Safe Software
 
SIZING YOUR AIR CONDITIONER---A PRACTICAL GUIDE.pdf
Muhammad Rizwan Akram
 
Reverse Engineering of Security Products: Developing an Advanced Microsoft De...
nwbxhhcyjv
 
Ericsson LTE presentation SEMINAR 2010.ppt
npat3
 
“Voice Interfaces on a Budget: Building Real-time Speech Recognition on Low-c...
Edge AI and Vision Alliance
 
“Computer Vision at Sea: Automated Fish Tracking for Sustainable Fishing,” a ...
Edge AI and Vision Alliance
 
How do you fast track Agentic automation use cases discovery?
DianaGray10
 
The Project Compass - GDG on Campus MSIT
dscmsitkol
 

Computer Networks Homework Help

  • 1. P Consider the network below. a.Suppose that this network is a datagram network. Show the forwarding table in router A, such that all traffic destined to host H3 is forwarded through interface 3. b. Suppose that this network is a datagram network. Can you write down a forwarding table in router A, such that all traffic from HI destined to host H3 is forwarded through interface 3, while all traffic from H2 destined to host H3 is forwarded through interface 4? (Hint: this is a trick question.) c.Now suppose that this network is a virtual circuit network and that there is one ongoing call between HI and H3, and another ongoing call between H2 and H3. Write down a forwarding table in router A, such that all traffic from HI destined to host H3 is forwarded through interface 3, while all traffic from H2 destined to host H3 is forwarded through interface 4. d. Assuming the same scenario as (c), write down the forwarding tables in nodes B, C, and D. Solution: a) For Router A, data destined to host H3 is forwarded through interface 3. Distention address Link interface H3 #3 b) No, because, for datagram networks, forwarding rule is only based only on destination address (not the source address). c) One possible configuration for Router A is: Incoming interface Incoming VC# Outgoing Interface Outgoing VC# 1 12 3 22 2 63 4 18 Note, that the two flows could actually have the same VC numbers. d) One possible configuration is: for Router B Incoming interface Incoming VC# Outgoing Interface Outgoing VC# 1 22 2 24 COMPUTER NETWORKS Our online Tutors are available 24*7 to provide Help with Computer Networks Homework/Assignment or a long term Graduate/Undergraduate Computer Networks Project. Our Tutors being experienced and proficient in Computer Networks ensure to provide high quality Computer Networks Homework Help. Upload your Computer Networks Assignment at ‘Submit Your Assignment’ button or email it to [email protected]. You can use our ‘Live Chat’ option to schedule an Online Tutoring session with our Computer Networks Tutors.
  • 2. For Router C Incoming interface Incoming VC# Outgoing Interface Outgoing VC# 1 18 2 50 For Router D Incoming interface Incoming VC# Outgoing Interface Outgoing VC# 1 24 3 70 2 50 3 76 P Suppose two packets arrive at different input ports of a router at exactly the same time. Also suppose there are no other packets in the router. a. Suppose the two packets are to be forwarded to two different output ports. Is it possible to forward the two packets through the switch fabric at the same time when the fabric uses a shared bus? b. Suppose the two packets are to be forwarded to two different output ports. Is it possible to forward the two packets through the switch fabric at the same time when the fabric uses a crossbar? c. Suppose the two packets are to be forwarded to the same output port. Is it possible to forward the two packets through the switch fabric at the same time when the fabric uses a crossbar? Solution: a) No, you can only transmit one packet at a time over a shared bus. b) Yes, as long as the two packets use different input busses and different output busses, they can be forwarded in parallel. c) No, in this case the two packets would have to be sent over the same output bus at the same time, which is not possible. 1 2 3 4 1 2 3 4 2 3 4 1
  • 3. P Consider the switch shown below. Suppose that all datagrams have the same fixed length, that the switch operates in a slotted, synchronous manner, and that in one time slot a datagram can be transferred from an input port to an output port. The switch fabric is a crossbar so that at most one datagram can be transferred to a given output port in a time slot, but different output ports can receive datagrams from different input ports in a single time slot. What is the minimal number of time slots needed to transfer the packets shown from input ports to their output ports, assuming any input queue scheduling order you want? What is the largest number of slots needed, assuming the worst-case scheduling order you can devise, assuming that a non-empty input queue is never idle? Solution: Assuming FIFO queue scheduling. The minimal number of time slots needed is 3. The scheduling is as follows. Slot 1: send X in top input queue, send Y in middle input queue. Slot 2: send X in middle input queue, send Y in bottom input queue Slot 3: send Z in bottom input queue. Largest number of slots is still 3. Actually, based on the assumption that a non-empty input queue is never idle, we see that the first time slot always consists of sending X in the top input queue and Y in either middle or bottom input queue, and in the second time slot, we can always send two more datagram, and the last datagram can be sent in third time slot. NOTE: Actually, if the first datagram in the bottom input queue is X, then the worst case would require 4 time slots.
  • 4. P Consider a datagram network using 32-bit host addresses. Suppose a router has four links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as follows: Destination Address Range Link Interface 11100000 00000000 00000000 00000000 through 0 11100000 00111111 11111111 11111111 11100000 01000000 00000000 00000000 through 1 11100000 01000000 11111111 11111111 11100000 01000001 00000000 00000000 through 2 11100001 01111111 11111111 11111111 otherwise 3 a. Provide a forwarding table that has four entries, uses longest prefix matching, and forwards packets to the correct link interfaces. b. Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses: 11001000 10010001 01010001 01010101 11100001 01000000 11000011 00111100 11100001 10000000 00010001 01110111 Solition:
  • 5. a) Range Range covered by the mask Prefix Match Interface 11100000 11100000 00000000 00111111 00000000 11111111 00000000 11111111 11100000 11100000 00000000 00111111 00000000 11111111 00000000 11111111 11100000 00 0 11100000 11100000 01000000 01000000 00000000 11111111 00000000 11111111 11100000 11100000 01000000 01000000 00000000 11111111 00000000 11111111 11100000 01000000 1 11100000 11100001 01000001 01111111 00000000 11111111 00000000 (1) 11111111 11100000 11100000 00000000 01000000 00000000 11111111 00000000 11111111 11100000 0 (2) Already included in 0 & 1 11100000 11100001 01000001 01111111 00000000 11111111 00000000 11111111 1110000 2 11100001 11100001 10000000 11111111 00000000 11111111 00000000 11111111 11100001 1 (3) 3 Otherwise Otherwise 3 (1) The prefix 1110000 covers more range than needed. We need to make sure that the range in (2) and the range in (3) are not forwarded to interface#2. Prefix Match Link Interface 11100000 00 0 11100000 01000000 1 1110000 2 11100001 1 3 otherwise 3 b) Prefix match for first address is 5th entry: link interface 3 Prefix match for second address is 3nd entry: link interface 2 Prefix match for third address is 4th entry: link interface 3
  • 6. P Consider a router that interconnects three subnets: Subnet 1, Subnet 2, and Subnet 3. Suppose all of the interfaces in each of these three subnets are required to have the prefix 223.1.17/24. Also suppose that Subnet 1 is required to support up to 60 interfaces, Subnet 2 is to support up to 90 interfaces, and Subnet 3 is to support up to 12 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraints. Solution: The parent network address is 223.1.17/24. 24 bits are prefix for the network. 8 bits can be used for subnet portions & host portions. Start with the largest required subnet (Subnet 2)  Subnet #2 (90 interfaces) Subnet portion Host portion 128 64 32 16 8 4 2 1 With 7 bits, we can get 128 addresses (126 usable host addresses + 1 subnet address + 1 subnet broadcast address), which is > 90. 1 bit is left for the subnet portion (we can have 2 subnets, each with 128 addresses) 223.1.17.0/25 (range 223.1.17.0 to 223.1.17. 127) 223.1.17.128/25 (range 223.1.17.128 to 223.1.17. 255) We assign one of those subnets to our Subnet #2 and further subnet the other range for out Subnet #1 & Subnet #3. Subnet #2 223.1.17.128/25 , Mask 255.255.255.128 Subnet ID  223.1.17.128 , Subnet broadcast address  223.1.17.255 Hosts  223.1.17.129 to 223.1.17.254  Subnet #1 (60 interfaces) The parent network 223.1.17.0/25 (32-25= 7 bits can be used for subnet portions & and host portions) Prefix to 0 Subnet portion Host portion 128 64 32 16 8 4 2 1 We can have 2 subnets, each with 64 addresses: 223.1.17.0/26 (range 223.1.17.0 to 223.1.17. 63) 223.1.17.64/26 (range 223.1.17.64 to 223.1.17. 127)
  • 7. Subnet #1 223.1.17.0/26 , Mask 255.255.255.0 Subnet ID  223.1.17.0 , Subnet broadcast address  223.1.17.63 Hosts  223.1.17.1 to 223.1.17.62  Subnet #3 (12 interfaces) The parent network is 223.1.17.64/26 Prefix to 0 Prefix to 1 Subnet portion Host portion 128 64 32 16 8 4 2 1 We can have 4 subnets, each with 16 addresses: 223.1.17.64/28 (range 223.1.17.64 to 223.1.17. 79) 223.1.17.80/28 (range 223.1.17.80 to 223.1.17. 95) 223.1.17.96/28 (range 223.1.17.96 to 223.1.17. 111) 223.1.17.112/28 (range 223.1.17.112 to 223.1.17. 127) We assign one of these to our Subnet #3 Subnet #3 223.1.17.96/28 , Mask 255.255.255.96 Subnet ID  223.1.17.96 , Subnet broadcast address  223.1.17.111 Hosts  223.1.17.97 to 223.1.17.110
  • 8. P Consider a subnet with prefix 128.119.40.128/26. Give an example of one IP address (of form xxx.xxx.xxx.xxx) that can be assigned to this network. Suppose an ISP owns the block of addresses of the form 128.119.40.64/26. Suppose it wants to create four subnets from this block, with each block having the same number of IP addresses. What are the prefixes (of form a.b.c.d/x) for the four subnets? Solution: Any IP address in range 128.119.40.128 to 128.119.40.191 can be an example. Four equal size subnets: 128.119.40.64/28, 128.119.40.80/28, 128.119.40.96/28, 128.119.40.112/28 visit us at www.assignmentpedia.com or email us at [email protected] or call us at +1 520 8371215