Scribd
Upload
5 views4 pages

Assignmen #5

Uploaded by

ae912380
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views4 pages

Assignmen #5

Uploaded by

ae912380
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Question #1

IPv6 packets are encapsulated within IPv4 packets but we Use it when there are IPv4-only
routers between IPv6-enabled routers

Question #2
A) Yes

Example:
1. Consider a network:
o A—B—C, where link costs are: A-B = 1, B-C = 1.
o Initially, A’s cost to C is 2 (via B).
2. If the link between B and C breaks, B marks C as unreachable (cost = infinity).
However, A still thinks C is reachable via B with cost 2.
3. A updates its table:
o A → B → C with cost 2.
o B updates its table using A’s outdated information: B → A → C with cost 3.
4. This cycle continues, and the costs keep increasing indefinitely, leading to the count-
to-infinity problem.

B) This situation does not lead to a count-to-infinity problem because new links reduce
distance metrics. Adding a link creates new, shorter paths, and the network converges
quickly to the updated topology without looping or metric escalation.

Question #3

Step N’ D(b)p(b) D(c)P(c) D(d)P(d) D(e)P(e) D(f)P(f) D(g)P(g)


0 a 2,a 4,a 1,a ∞ ∞ ∞
1 ab 2,a 4,a 1,a 12,b ∞ ∞
2 abc 2,a 1,a 12,b 8,c ∞
3 abcd 3,d 3,d 5,d
4 abcde 1,a
5 abcdef
6 abcdefg
Question #4
(a)
 Similarity: Both classic Internet and SDNs have control and data planes for routing
and packet forwarding.
 Difference: In the classic Internet, control and data planes are tightly coupled, while in
SDNs, the control plane is centralized, and the data plane is distributed.

(b)
 No, because:
o Real-time packet forwarding requires low latency, which is impractical with a
centralized data plane.
o Centralizing the data plane creates scalability and performance bottlenecks.
 Instead, the control plane is centralized, and the data plane remains distributed for
efficiency.

Question #5

Node Source Destination Source IP Destinatio Source Destination


Port port n IP MAC MAC
A 8080 80 10.0.0.1 1.2.3.8 MAC 1 MAC X
NAT 12000 80 1.2.3.8 3.4.5.8 MAC Y MAC 2
Router B 12000 80 1.2.3.8 3.4.5.8 MAC 3 MAC 4
Router C 12000 80 1.2.3.8 3.4.5.8 MAC 5 MAC 6
D
Node Source Destination Source IP Destination Source Destination
Port port IP MAC MAC
D 80 12000 3.4.5.8 1.2.3.8 MAC 6 MAC 5
Router C 80 12000 3.4.5.8 1.2.3.8 MAC 4 MAC 3
Router B 80 12000 3.4.5.8 1.2.3.8 MAC 2 MAC Y
NAT 80 8080 3.4.5.8 10.0.01 MAC X MAC 1
A

Question #6

Constraints:
 BGP routers are constrained by policies and business agreements (inter-AS routing).
 Intra-AS routers are constrained by metrics like hop count or cost (intra-AS routing).
Criteria:
 BGP builds routes based on policies and path attributes.
 Intra-AS routers use metrics to find the shortest or most efficient paths.
Justification:
BGP focuses on policy compliance, while intra-AS routing prioritizes path efficiency.

Question #7
a)
To w: The cost is the direct link c(x,w)=2c(x, w) = 2c(x,w)=2.
To y: The cost is the direct link c(x,y)=5c(x, y) = 5c(x,y)=5.
To u: Consider the paths through www and yyy:
 Through www: c(x,w)+D(w,u)=2+5=7c(x, w) + D(w, u) = 2 + 5 = 7c(x,w)
+D(w,u)=2+5=7.
 Through yyy: c(x,y)+D(y,u)=5+6=11c(x, y) + D(y, u) = 5 + 6 = 11c(x,y)
+D(y,u)=5+6=11.
 The shortest path is via www with a cost of 7.
from x:
w=2 , y=5, u=7

b) .
To trigger an update from xxx to its neighbors, you can either:
Increase c(x,w)c(x, w)c(x,w) to a value greater than 5
Decrease c(x,y)c(x, y)c(x,y) to a value less than 2.

c) Decreasing c(x,y) or increasing c(x,w).

Question #8
Yes, BGP allows Z to implement a policy where it transfers Y's traffic but not X's traffic. This
is because BGP allows autonomous systems to implement traffic filtering and routing policies
based on route attributes such as the AS path and Z can inspect the AS path in the BGP
announcements to determine whether traffic originated from X and reject routes that include
X in the AS path. This selective routing is a key feature of BGP that provides ASs with the
flexibility to enforce policies based on their business agreements.

Question #9
Connectionless Demultiplexing:
 Each segment is treated independently, without maintaining any persistent state.
 Demultiplexing is based on the destination port number in the segment header.
 Example protocol: UDP.
 Does not provide guarantees for delivery, order, or reliability.
Connection-Oriented Demultiplexing:
 A connection is established and maintained, with state information tracked at both
sender and receiver.
 Demultiplexing is based on a quadruple: source IP address, source port, destination IP
address, and destination port.
 Example protocol: TCP.
 Provides reliable, ordered delivery of data with error detection and retransmission.

You might also like