Chapter 4: Problem 30
How does BGP use the NEXT-HOP attribute? How does it use the AS-PATH attribute?
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
Chapter 4: Problem 30
How does BGP use the NEXT-HOP attribute? How does it use the AS-PATH attribute?
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for freeConsider the two basic approaches identified for achieving broadcast, unicast emulation and network-layer (i.e., router-assisted) broadcast, and suppose spanning-tree broadcast is used to achive network-layer broadcast. Consider a single sender and 32 receivers. Suppose the sender is connected to the receivers by a binary tree of routers. What is the cost of sending a broadcast packet, in the cases of unicast emulation and network-layer broadcast, for this topology? Here, each time a packet (or copy of a packet) is sent over a single link, it incurs a unit of cost. What topology for interconnecting the sender, receivers, and routers will bring the cost of unicast emulation and true network-layer broadcast as far apart as possible? You can choose as many routers as you'd like.
Suppose there are three routers between a source host and a destination host. Ignoring fragmentation, an IP datagram sent from the source host to the destination host will travel over how many interfaces? How many forwarding tables will be indexed to move the datagram from the source to the destination?
Describe how a network administrator of an upper-tier ISP can implement policy when configuring BGP.
It has been said that when IPv6 tunnels through IPv4 routers, IPv6 treats the IPv4 tunnels as link-layer protocols. Do you agree with this statement? Why or why not?
Suppose ASs \(\mathrm{X}\) and \(\mathrm{Z}\) are not directly connected but instead are connected by AS Y. Further suppose that \(\mathrm{X}\) has a peering agreement with \(\mathrm{Y}\), and that \(\mathrm{Y}\) hasa peering agreement with Z. Finally, suppose that Z wants to transit all of Y's traffic but does not want to transit X's traffic. Does BGP allow Z to implement this policy?
What do you think about this solution?
We value your feedback to improve our textbook solutions.