Mesh Topology

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/computer-networks/introduction-to-cn/network-topologies/asset-mesh-topology after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces physical network topology, defining it as the geometric representation of links and devices. It then focuses on mesh topology, where every device has a dedicated point-to-point link to every other device. The instructor derives the formula n(n-1)/2 for duplex-mode links, illustrates it with a five-node pentagon diagram, and calculates 4950 links for 100 nodes. Advantages include dedicated links avoiding traffic problems, while disadvantages cover difficult installation, wiring bulk, and high cost.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces physical topology, with the whiteboard stating it 'Refers to the way in which a network is laid out physically.' A second line defines topology as 'the geometric representation of the relationship of all the links and linking devices to one another.' The slide then displays seven labeled diagrams: Point to Point, Bus, Ring, Star, Tree, Mesh, and Hybrid. The Mesh diagram shows a central blue hub with curved links to surrounding computer icons.

  2. 2:00 – 5:00 02:00-05:00

    The instructor points to the Tree layout before transitioning to a dedicated 'Mesh Topology' slide. Five desktop computers are connected by crossing lines in an interlinked pentagon pattern. A bullet point states 'In a mesh topology, every device has a dedicated point-to-point link to every other device.' The instructor points with a pen at the circled top node and highlights a single link in red, emphasizing that each connection is dedicated.

  3. 5:00 – 8:48 05:00-08:48

    The lecture presents the formula 'n (n-1)/2, duplex-mode links, where n is number of node.' A numerical example calculates 100 x 99 / 2 = 4950 links. Advantages are discussed, with 'traffic problems' underlined in red to show dedicated links carry their own data load. Disadvantages include 'installation and reconnection are difficult,' 'the sheer bulk of the wiring can be greater than the available space,' and high hardware costs.

The lecture progresses from a general definition of physical topology to the specific case of mesh topology. The central concept is that every device connects directly to every other, requiring n(n-1)/2 duplex links. The five-node pentagon diagram visually demonstrates this complete interconnection. The numerical example (100 nodes = 4950 links) reinforces the formula's practical implication: link count grows quadratically. The key trade-off is reliability versus cost: dedicated links avoid traffic congestion, but the wiring bulk and hardware expense make mesh topology impractical for large networks. Students should remember the formula, the pentagon diagram, and the three main disadvantages.

Loading lesson…