Clear & accurate answers to a small series of networking questions.
Answer all of the following questions accurately and show how you determined your answers: 1. DATA LINK PROTOCOLS 1.1 Frame Relay [url removed, login to view] a network of four nodes in different cities interconnected via real point-to-point circuits with a frame relay network using virtual circuits. If we require that each point-to-point connection be direct, that is not going through another node on its way to its destination, how many physical circuits will we have to provision in each case? [url removed, login to view] What physical parameter limits the maximum data rate of a frame relay virtual circuit? How does this relate to the contracted "Committed Information Rate" or CIR. What can happen if data is consistantly transmitted above the CIR? 1.2 The following are 3 mutually orthoganal chip sequences used in a CDMA system. 1 0 0 1 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 1 1 1 1 1 1.2.1 Using bipolar signaling ( 0 = -1), please demonstrate that the first two sequences are orthoganal. 1.2.2 Your receiver, assigned to sequence 2, receives the following sequence: [url removed, login to view] LAYER PROTOCOLS The packet network below uses the "minimum hop" routing criteria established by exchanging hop count vectors with adjacent nodes. This packet network is described by the connection list below. This is easier to send than a diagram. Connection list (all are two-way trunks) Node 1 to 2 Node 1 to 3 Node 2 to 3 Node 2 to 5 Node 3 to 4 Node 4 to 5 Hop vectors received at node 1 from adjacent nodes. Note that this protocol uses a minimum hop criterion, rather than minimum delay as in some of our examples. Further note that for minimum delay we needed to start with our last guess of delay to our neighbors, while for hop count that is not necessary (how many hops to a neighbor, by definition of neighbor??). DESTINATION NODE 2 NODE 3 1 1 1 2 0 2 3 2 0 4 2 1 5 1 2 2.1 What is the hop vector node 1 sends to its adjacent nodes. 2.2 Which link is not operating. 2.3. What is the successor vector (routing table) for node 1? 3. INTERNETWORKING 3.1 A newbie network designer is faced with a large Ethernet which has very poor performance. He measures the throughput and discovers that there are many collisions because the attempted throughput is too high. He decides that separating into two Ethernet segments connected by a smart bridge will solve the problem. 3.1.1. Could this help? If so how? 3.1.2. Our designer is surprised to find that his design did not help. He has put the user community on one segment and the machine room with all the printers, servers and external network interfaces on the other. Why will this design not make an improvement? How should he have designed it. 3.2 Your Ethernet sniffer observes a packet with the following destination address in "dotted decimal notation": [url removed, login to view] 3.2.1 What "class" IP network is this addressed to? ________ 3.2.2 What network is this packet routed to? _______________ 3.2.3 How many hosts could be on this network? _______________ 3.2.4 What is the significance of this host address and how many hosts could receive this message? ____________ 3.3 Please provide a brief description of the primary advantages of each of the following packet routing approaches, please focus on efficiency and network overhead. 3.3.1 Static routes. 3.3.2 Adaptive - Distributed (neighbor-neighbor exchange) 3.3.3 Adaptive Measurements and updates sent from control center (Centralized Route Processing)
Text email, .txt or .doc file.