Token Passing - Controlled Access Protocol

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/HEXAWARE-PREPARATION/computer-networks/dll-access-control/controlled-access/asset-token-passing-controlled-access-protocol after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Speed Mathematics and Basic Mathematics, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Number System, HCF LCM, Data Interpretation, Age Problems, Mixture and Alligation, Partnership, Algebra, Sequence and Series (Series), Mensuration and Geometry, Arithmetic
  2. Reasoning Ability: Puzzle Solving (Puzzles), Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Syllogisms, Data Sufficiency, Ranking, Order and Sequence, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning), Data Arrangement, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Vocabulary, Sentence Completion (Fill in the blanks), Active Passive Voice (Voice), Direct and Indirect Speech, Subject Verb Agreement (Verb Noun Agreement), Tenses, Preposition, Articles, Sentence Correction (Error Correction)
  4. Programming Basics (MCQs + Interview): C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  5. OOPs (MCQs + Interview): Object Oriented Programming (OOPS)
  6. DBMS (MCQs + Interview): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Transaction Management, Decomposition Properties & 4NF, Concurrency Control, Database Recovery, File Organization & Indexing, Relational Algebra, Database Security & Authorization
  7. SQL (MCQs + Interview): SQL
  8. Operating Systems (MCQs + Interview): Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Process Synchronization, Disc Scheduling, File Management, Security
  9. Computer Networks (MCQs + Interview): 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  10. Coding: Coding Questions by Yash Sir
  11. HR Interview: MR & HR Interview Preparation
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces Token Passing as a controlled access protocol where network stations are organized in a logical ring structure. The instructor explains that each station has a predecessor and successor, with access rights passed sequentially after data transmission. Visual aids display four distinct network topologies: Physical ring, Dual ring, Bus ring, and Star ring. A special packet called a token circulates through the ring, granting the holder the right to access the channel and send data. When a station finishes transmitting or has no more data, it releases the token for the next successor in the sequence. The diagrams illustrate how data flows between numbered stations across different physical layouts, emphasizing that logical ring organization can exist on various physical configurations.

Chapters

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

    The lecture begins by defining Token Passing as a controlled access protocol where stations form a logical ring. The instructor explains predecessor and successor relationships, noting that access rights transfer after data transmission. Visual aids show four topologies labeled a through d: Physical ring, Dual ring, Bus ring, and Star ring. The presenter gestures toward diagrams while explaining how the token circulates through the network structure.

  2. 2:00 – 4:10 02:00-04:10

    The instructor elaborates on token circulation mechanics, stating that a special packet called a token grants channel access rights. The slide text reads: "In this method, a special packet called a token circulates through the ring." Diagrams illustrate data flow paths between numbered stations. The speaker points to each topology diagram while explaining how the token moves from one station to its successor, ensuring orderly access without collisions.

Token Passing operates as a controlled access protocol where network stations are logically arranged in a ring, regardless of their physical layout. The core mechanism involves circulating a token—a special packet that grants transmission rights—to each station in sequence. Stations must wait for the token before sending data, preventing collisions and ensuring fair access. The lecture demonstrates that this logical ring can be implemented across four physical topologies: Physical ring, Dual ring, Bus ring, and Star ring. Each topology maintains the logical predecessor-successor relationship essential for token circulation.

Loading lesson…