Bit-oriented protocol
Appearance
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Citation bot (talk | contribs) at 01:54, 18 June 2025 (Altered title. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Data transmission | #UCB_Category 156/181). The present address (URL) is a permanent link to this version.Revision as of 01:54, 18 June 2025 by Citation bot (talk | contribs) (Altered title. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Data transmission | #UCB_Category 156/181)
This article needs additional citations for verification . Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Bit-oriented protocol" – news · newspapers · books · scholar · JSTOR (February 2024) (Learn how and when to remove this message)
Find sources: "Bit-oriented protocol" – news · newspapers · books · scholar · JSTOR (February 2024) (Learn how and when to remove this message)
A bit-oriented protocol is a communications protocol that sees the transmitted data as an opaque stream of bits with no semantics, or meaning. Control codes are defined in terms of bit sequences instead of characters. Bit oriented protocol can transfer data frames regardless of frame contents. It can also be stated as "bit stuffing".
Synchronous framing High-Level Data Link Control may work like this:[1]
- Each frame begins and ends with a special bit pattern 01111110, called a flag byte.
- A bit stuffing technique is used to prevent the receiver from detecting the special flag byte in user data e.g. whenever the sender's data link layer encounters 5 consecutive 1 (one) in the data, it automatically stuffs 0 into the outgoing stream.
See also
[edit ]References
[edit ]- ^ Lam, Simon S., ed. (1984). Principles of Communication and Networking Protocols (PDF). IEEE Computer Society Press. p. 67. ISBN 0-8186-0582-0 . Retrieved February 11, 2024.
Stub icon
This computer science article is a stub. You can help Wikipedia by expanding it.