直连网(directly-connected networks)个数的计算

直连网分为两种,point-to-point link和multiple access link, 如图:

对一个网络数直连网个数时,以上两种link都要计算。例子如下:

1. How many directly-connected networks are there on the route from host A to host B in the following figure?

我们将AB间的point-to-point link和 multiple access link都标出来:

其中,红色方框框住的是multiple access link, 蓝色框框住的是point-to-point link。

所以,答案自然是2+1=3啦。(其中2为AB间multiple access link数, 1为AB间point-to-point link数)

时间: 2024-11-03 20:49:11

直连网(directly-connected networks)个数的计算的相关文章

从控制台输入一个数,计算从0加到这个数的和

// 功能:从控制台输入一个数,计算从0加到这个数的和 import java.io.*; public class Jisuan{   public static void main (String args[])    {      try      {        InputStreamReader isr = new InputStreamReader(System.in);        BufferedReader br = new BufferedReader(isr); Sys

python 练习题:接收一个或多个数并计算乘积

以下函数允许计算两个数的乘积,请稍加改造,变成可接收一个或多个数并计算乘积 def product(x, y): return x * y # -*- coding: utf-8 -*- def prodouct(*num): n = 1 for x in num: n = n * x return n # 测试 print('print(5)=',prodouct(5)) print('print(5,6)=',prodouct(5,6)) print('print(5,6,7)=',prod

循环队列(循环数组)中元素个数的计算

队列头指针为front,队列尾指针为rear(指向队尾元素),after_rear为队尾元素的后一位置(按顺时针方向),队列容量为maxsize   如果用 front == rear 来表示队列为空,也就是说front和rear指向同一个位置,那么: 队列满时:(rear+1) mod maxsize == front 队列中元素个数为:(rear-front+maxsize) mod maxsize   如果用 rear == (front-1+maxsize) mod maxsize 来表

三角形个数的计算

设n为正整数,求三边长a<=b<=c=n的三角形的个数?这道题的特殊在于用图像法分析计数 用图像解,当n为奇数时,得到:f(3)=1+3f(5)=1+3+5f(7)=1+3+5+7..得到公式:f(n)=f(n-2)+n(其中n>=3) 当n为偶数时,得到:

Part3 &ndash; OPENVSWICH &ndash; Campus Model with Layer2 Access built with Open-Source Applications

In part one we showed how to create Openvswitch extension and submit it to Microcore repository. There were also presented after-install steps for Openvswitch adapted for specific Core needs. http://brezular.com/2011/09/03/part1-openvswich-creating-a

LAB – CCNP Single-Area OSPF Link Costs and Interface priorities

Single-Area OSPF Link Costs and Interface Priorities Topology Objectives: Configure single-area OSPF on a router. Advertise loopback interfaces in to OSPF Verify OSPF adjacencies. Verify OSPF routing information exchange. Modify OSPF link costs. Chan

1. Routing Conceps

The primary route functions:(选择最优路径 & 转发数据包) Determining the best path to send packets (routing table) Forwarding packets toward their destination Packet Forwarding Mechanisms: Router Switching Mechanisms Routing table-driven switching - The first an

socket原理详解

1.什么是socket 我们知道进程通信的方法有管道.命名管道.信号.消息队列.共享内存.信号量,这些方法都要求通信的两个进程位于同一个主机.但是如果通信双方不在同一个主机又该如何进行通信呢?在计算机网络中我们就学过了tcp/ip协议族,其实使用tcp/ip协议族就能达到我们想要的效果,如下图(图片来源于<tcp/ip协议详解卷一>第一章1.3) .  图一 各协议所处层次 当然,这样做固然是可以的,但是,当我们使用不同的协议进行通信时就得使用不同的接口,还得处理不同协议的各种细节,这就增加了

poj 1523 SPF【点双连通求去掉割点后bcc个数】

SPF Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 7246   Accepted: 3302 Description Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer basis, a