Basic network routing pdf

In addition, instruction and training are provided in the proper care, maintenance, and use of networking software, tools, and equipment and all local, state, and federal safety, building, and environmental codes and regulations. Course Objectives The CCNA certification indicates knowledge of networking for the small-office, home-office SOHO market and the ability to work in small businesses or organizations whose networks have fewer than nodes.

Approximately 35 hours will be designated to lab activities and 35 hours on curriculum content. A case study on structured cabling is required, but format and timing are determined by the Local Academy. What has changed from CCNA versions 2. Course Outline Module 1. Introduction to Networking Overview 1. Networking Fundamentals Overview 2. Networking Media Overview 3. Cable Testing Overview 4. Ethernet Fundamentals Overview 6.

Ethernet Switching Overview 8. IP v6 9. Routing Decisions? Establish IP Routing-table Dinesh Nagal. Adriano Dos Santos Arruda. Bikram Basnet. Chad EverydayI'mhustlin Rudolph. Elizabeth Arnold. Khaja Shaikh Sabina Centre. Vidhya Ds. Jhonard Montemayor Lanit. Haru Harshu. Captain America. Mandeep Kaur. Iqra zaib. Ali Abd. Sarah Borgi. Mahmood Al Shukaili. AG Network Resources. HC Introduction to Transmission Media. Afri Yanto. Popular in Internet Standards.

Bang Allen. Ajay Aji. Balan Wv. Muhammad Alim. Manuja Maniyan. Repends Man. By using our site, you agree to our collection of information through the use of cookies. To learn more, view our Privacy Policy. To browse Academia. Log in with Facebook Log in with Google.

Remember me on this computer. Enter the email address you signed up with and we'll email you a reset link. Need an account? Click here to sign up. Download Free PDF.

Nhat duy Dinh. A short summary of this paper. Recently, routing on dBG has been investigated as shortest path and fault tolerant routing but investigation into shortest path in failure mode on dBG has been non-existent.

Furthermore, dBG based broadcasting has been studied as local broadcasting and arc-disjoint spanning trees based broadcasting. However, their broadcasting algo- rithms can only work in dBG 2,k. In this paper, we investigate shortest path routing algorithms in the condition of existing failure, based on the Bidirectional de Bruijn graph BdBG. And we also investigate broad- casting in BdBG for a degree greater than or equal to two1. Liu and T. Sung [1] proposed eight cases shortest paths in BdBG.

Nevertheless, Z. However, his algorithm can tolerate only one failure node in binary de Bruijn networks and it cannot achieve shortest path if there is failure node on the path.

Broadcasting problems on dBG have been investigated as local broadcasting[6] and arc-disjoint spanning trees[7][8]. Nonetheless, the above can only work in a binary de Bruijn network dBG 2,k. Considering limitations of routing and broadcasting in dBG, we intend to investigate shortest path routing in the condition of failure existence and broad- casting in BdBG with a degree greater than or equal to two. Two Fault Free Shortest Path FFSP routing algorithms and one broadcasting algorithm for one-to-all broadcasting in the all port communication model are proposed.

Our study shows that the max- imum time steps to finish broadcast procedure is k regardless of the broadcast originator, time complexity at each node is 0 32 d , and no overhead happens in the broadcast message.

Background is discussed in section 2. In section 3, FFSP routing algorithms are presented. Performance analysis for FFSP routing algorithms is carried in section 4.

Section 5 discuss about broadcasting algorithm in dBG d,k. Finally, some conclusions will be given in Section 6. If we represent a node by d0 d Subscripts of these sub-paths can be omitted if no ambiguity will occur, e. Shift string of a node A is a binary string 0 for left shift and 1 for right shift which represents path from originator to A. Subsequently, the informed vertices call their neighboring vertices and the process continues until all vertices in the graph are informed.

Basically, this mechanism is like flooding phenomenon. Note that the interval during which a call takes place will be referred to as a time step or simply step. In flooding broadcasting FB , level of a node A is the number of steps by which a message from originator reaches A or shortest path length between A and originator. The following fig. The gray areas are the maximum substring between source s and destination d.

The number inside each block represents the number of bits in the block. Then FFSP is found among those paths. Therefore, the following concepts are proposed. For those, we assume that there is a separately protocol which detects failure nodes and then let other nodes know in periodically. Lemma 1: DSm is fault free. It contradicts with definition 1.

Following inductive method, lemma 2 is proved. By assigning source node S to DS1 , then expanding to the higher level, we have the following theorem. Proof: we use inductive method to prove this theorem. It contradicts definition 1.