SlideShare a Scribd company logo
Notes on Communication (1): Some fundamentals Jean-Lou Dupont jl @ jldupont . com http://www.jldupont.com/  
Story board - context setting Communication  between a  source  and  sink (s) requires one of more interconnected ( network )  medium  to  forward  the  information  that constitutes the  communication-instance . The process by which information is  transported  from a source to the destination sink(s) requires  resources  and  addressing . The resources can either be  dedicated  to the a communication-instance or  shared  amongst communication-instances. Sharing resources (effectively) require  coordination  and thus  protocols . In this presentation, we will not be focusing on the transport of information which is encoded in a physical structure (e.g. transport by plane of information contained in a book).
Key Points Communication requires Medium air/vacuum, metal  strings , optical  strings   Medium  is composed of  Dimensions Time, Frequency, Power Dimension  access is either dedicated or shared   Information  transport is structured stream of symbols, stream of packets (group of symbols) Sharing  implies  Coordination  implies  protocol
Definition Channel:   (sometimes called  communications channel ) refers to the  medium  used to  convey   information  from a  sender  (or source, transmitter) to a  receiver  (or sink). Communication-instance :  a specific communication between a source and a sink. Forwarding Process :  a component of a system responsible for the transport of information. Partition:   Generally, a  partition  is a splitting of something into parts. In communications we further assume that partitions can only interact with each other (i.e. exchange information) by established interfaces.  Source :  aka transmitter Sink :  aka receiver
Resources Resource  usage can either be  dedicated  or  shared Dedicated : the client of the resource controls the said resource for a period of time (either bounded or un-bounded) Shared : multiple clients  compete  to access & use the said resource using a coordination protocol (or apparent lack thereof :-) Dedicated access is just a special case of Shared access: nothing is really dedicated for an unbounded time period, more likely "leased" for a bounded time period (by a  master  process).
Medium - Dimensions A  medium  consists of 3 domains: Frequency Domain Time Domain Power Domain   ALL  dimensions  ALWAYS  present Often, the power dimension is assumed and abstracted from diagrams   Frequency:  change in Time Domain change  includes  matter  level change   e.g. finger over braille text
Dimensions - Examples Example 1: Medium is divided in the frequency domain - total isolation between dimensions  Example 2: ( CDMA ) Medium is divided using "codes" in the Freq+Power  plane  - no total isolation
Medium - Partitioning E.g.  air/vacuum : can be spatially partitioned (see figure) can be temporally partitioned ( time domain multiplexed ) a combination of the above
Medium For communication to take place, one or several  medium  must be used between  source (s) and  sink (s). A medium can either be dedicated or shared Dedicated 1 source, m sinks (where m>=1) Special case of  shared Shared n sources, m sinks Requires a coordination protocol (e.g. CS MA /CD)
Medium - Access Multiple Access (i.e. shared access) requires a coordination protocol active between the sources Manage Information Merging => Loss
Information 3 fundamental properties: Information can be  copied Information can be  modified Information can be  measured Note: Erase ~ no copy
Information Property: Copy Medium: air/vacuum By nature  broadcast Use of electro-magnetic wave =>  copy  is natural Partitioning is possible ( spatial, temporal ) Medium: metal / fiber strings Can be used in "broadcast" configuration too Easier to  dedicate
Information Property: Modify 2 fundamental types: Intentional => the usual purpose behind a communication Un-intentional => environmental cause etc. => yields to loss
Information Property: Measure Measurement: Information Entropy Algorithmic Entropy ( Kolmogorov ) Complexity of the algorithm that describes the Information
Information Copy: role of Power Distance => power @ each sink => power
Forwarding Forwarding can take place in 2 fundamental types of channel: Destination Un-Aware Destination Aware
Channel - Destination Un-aware Representation of a  broadcast  channel A) one source accessing the channel @ time t B) two sources accessing the channel @ time t  => loss
Channel - Destination Aware Representation of a  destination aware  channel: A) Information copied to 1 egress B) Information copied to multiple egresses
Forwarding - Identifier Types 2 fundamental types: Address Label Ultimately, the forwarding process requires an unambiguous way of delivering the information Note : we are not concerned here with the trivial case "identifier-less broadcast" 
Address Types Unicast ==> 1 destination Multicast ==> n destination(s) where n>=0 Broadcast ==> 'all' Anycast ==> 1 destination from a set
Label Type A "label" is meant to be  interpreted : can refer to a  sequence of hops  to a destination can refer to a  communication-instance  (aka connection) Indirection towards a destination
Connection Types 2 types: Non-merging (aka Transport Connection) Merging   Merging: when multiple sources  merge  their traffic Result: can't identify individual sources
Merging Merging  is undesirable: Noise  merges  into channels ==> loss of information Requires additional information (e.g. overhead) to mitigate against merging ==> less efficient Root Cause analysis difficult ==> higher OPEX
Merging - Management Aspect In order to manage communication (e.g. in a network), it is highly desirable to have the capability to find the  root cause  of faults. Noise is always present If higher than  usual , need to  locate  and mitigate Noise can (sometimes) have a signature ==> identifiable Packet Switching is prone to merging multipoint-to-point constructs configuration errors routing errors

More Related Content

PDF
New strategy to optimize the performance of spray and wait routing protocol
PDF
PDF
PDF
Shannon1948
PDF
Packet Loss and Overlay Size Aware Broadcast in the Kademlia P2P System
PPS
Lab Seminar 2009 06 17 Description Based Ad Hoc Networks
PDF
On minimizing data forwarding schedule in multi transmit receive wireless mes...
PDF
Gk2411581160
New strategy to optimize the performance of spray and wait routing protocol
Shannon1948
Packet Loss and Overlay Size Aware Broadcast in the Kademlia P2P System
Lab Seminar 2009 06 17 Description Based Ad Hoc Networks
On minimizing data forwarding schedule in multi transmit receive wireless mes...
Gk2411581160

What's hot (20)

PPT
Lecture 14
PDF
Bu4301411416
PPT
Multiplexing : Wave Division Multiplexing
PDF
I046054549
PDF
Ijcnc050204
PPTX
Geo-Cast Routing Protocol
PDF
Comparison of Various Unicast-Multicast Routing Protocols for Mobile Ad-Hoc N...
PPTX
Ch 20 UNICAST ROUTING SECTION 2
PPTX
Physical organization of parallel platforms
PDF
OPTIMAL POWER ALLOCATION FOR MULTIPLE ACCESS CHANNEL
DOCX
Bca3040– data communication
PDF
Ijarcet vol-2-issue-7-2351-2356
PDF
G0544650
PDF
C04501027035
PPT
PPTX
Ch 18 intro to network layer - section 1
PDF
International Journal of Computational Engineering Research(IJCER)
PDF
Z02417321735
PDF
Jcomss 8358 final
PDF
Solving QoS multicast routing problem using ACO algorithm
Lecture 14
Bu4301411416
Multiplexing : Wave Division Multiplexing
I046054549
Ijcnc050204
Geo-Cast Routing Protocol
Comparison of Various Unicast-Multicast Routing Protocols for Mobile Ad-Hoc N...
Ch 20 UNICAST ROUTING SECTION 2
Physical organization of parallel platforms
OPTIMAL POWER ALLOCATION FOR MULTIPLE ACCESS CHANNEL
Bca3040– data communication
Ijarcet vol-2-issue-7-2351-2356
G0544650
C04501027035
Ch 18 intro to network layer - section 1
International Journal of Computational Engineering Research(IJCER)
Z02417321735
Jcomss 8358 final
Solving QoS multicast routing problem using ACO algorithm
Ad

Viewers also liked (8)

PPTX
Notes About Networks and Technology
PDF
Computer Networks Foundation - Study Notes
PPTX
Hardware & networking
PDF
Computer Networks Lecture Notes
PPT
ATM Networking Concept
PPS
Pulse modulation
PPT
OSI Model
PPT
BASIC CONCEPTS OF COMPUTER NETWORKS
Notes About Networks and Technology
Computer Networks Foundation - Study Notes
Hardware & networking
Computer Networks Lecture Notes
ATM Networking Concept
Pulse modulation
OSI Model
BASIC CONCEPTS OF COMPUTER NETWORKS
Ad

Similar to Notes On Networking 1 (20)

PPTX
Basics of data communications.pptx
PDF
Comp science notes
PPT
Communication model
PPTX
Chapter 1 introduction haramaya
PPT
Notes On Networking 2
PPTX
chapter 1 dc ppt.pptx
PPT
ODP
komdat3
PPTX
Networking: A Beginner's Guide
PPT
Stoe Noll Westin Data Transmission Presentation
PDF
optical_fiber_communication_by_gerd_keiser.pdf
PDF
optical_fiber_communication_by_gerd_keiser.pdf
PDF
optical_fiber_communication_by_gerd_keiser.pdf
PPTX
Unit_1_CN NAK.pptx Introduction to network and physical network
PDF
transmission modes for networking students.pdf
PPTX
Presentation on data communication
PPT
lecture2.ppt
PPTX
Data Representation in Data Communication (1).pptx
PPTX
Railway Internship presentation for b.tech.pptx
PPT
HSC Communication systems
Basics of data communications.pptx
Comp science notes
Communication model
Chapter 1 introduction haramaya
Notes On Networking 2
chapter 1 dc ppt.pptx
komdat3
Networking: A Beginner's Guide
Stoe Noll Westin Data Transmission Presentation
optical_fiber_communication_by_gerd_keiser.pdf
optical_fiber_communication_by_gerd_keiser.pdf
optical_fiber_communication_by_gerd_keiser.pdf
Unit_1_CN NAK.pptx Introduction to network and physical network
transmission modes for networking students.pdf
Presentation on data communication
lecture2.ppt
Data Representation in Data Communication (1).pptx
Railway Internship presentation for b.tech.pptx
HSC Communication systems

Recently uploaded (20)

PPTX
KOM of Painting work and Equipment Insulation REV00 update 25-dec.pptx
PDF
DP Operators-handbook-extract for the Mautical Institute
PDF
DASA ADMISSION 2024_FirstRound_FirstRank_LastRank.pdf
PDF
A novel scalable deep ensemble learning framework for big data classification...
PDF
Mushroom cultivation and it's methods.pdf
PDF
Approach and Philosophy of On baking technology
PPTX
Chapter 5: Probability Theory and Statistics
PPTX
1. Introduction to Computer Programming.pptx
PDF
Zenith AI: Advanced Artificial Intelligence
PDF
Assigned Numbers - 2025 - Bluetooth® Document
PPTX
OMC Textile Division Presentation 2021.pptx
PDF
Hybrid model detection and classification of lung cancer
PDF
NewMind AI Weekly Chronicles - August'25-Week II
PPTX
A Presentation on Touch Screen Technology
PDF
Building Integrated photovoltaic BIPV_UPV.pdf
PPTX
A Presentation on Artificial Intelligence
PPTX
SOPHOS-XG Firewall Administrator PPT.pptx
PDF
Microsoft Solutions Partner Drive Digital Transformation with D365.pdf
PPTX
Programs and apps: productivity, graphics, security and other tools
PDF
Encapsulation_ Review paper, used for researhc scholars
KOM of Painting work and Equipment Insulation REV00 update 25-dec.pptx
DP Operators-handbook-extract for the Mautical Institute
DASA ADMISSION 2024_FirstRound_FirstRank_LastRank.pdf
A novel scalable deep ensemble learning framework for big data classification...
Mushroom cultivation and it's methods.pdf
Approach and Philosophy of On baking technology
Chapter 5: Probability Theory and Statistics
1. Introduction to Computer Programming.pptx
Zenith AI: Advanced Artificial Intelligence
Assigned Numbers - 2025 - Bluetooth® Document
OMC Textile Division Presentation 2021.pptx
Hybrid model detection and classification of lung cancer
NewMind AI Weekly Chronicles - August'25-Week II
A Presentation on Touch Screen Technology
Building Integrated photovoltaic BIPV_UPV.pdf
A Presentation on Artificial Intelligence
SOPHOS-XG Firewall Administrator PPT.pptx
Microsoft Solutions Partner Drive Digital Transformation with D365.pdf
Programs and apps: productivity, graphics, security and other tools
Encapsulation_ Review paper, used for researhc scholars

Notes On Networking 1

  • 1. Notes on Communication (1): Some fundamentals Jean-Lou Dupont jl @ jldupont . com http://www.jldupont.com/  
  • 2. Story board - context setting Communication between a source and sink (s) requires one of more interconnected ( network )  medium to forward the information that constitutes the communication-instance . The process by which information is transported from a source to the destination sink(s) requires resources and addressing . The resources can either be dedicated to the a communication-instance or shared amongst communication-instances. Sharing resources (effectively) require coordination and thus protocols . In this presentation, we will not be focusing on the transport of information which is encoded in a physical structure (e.g. transport by plane of information contained in a book).
  • 3. Key Points Communication requires Medium air/vacuum, metal strings , optical strings   Medium is composed of Dimensions Time, Frequency, Power Dimension access is either dedicated or shared   Information transport is structured stream of symbols, stream of packets (group of symbols) Sharing implies Coordination implies  protocol
  • 4. Definition Channel:   (sometimes called  communications channel ) refers to the  medium  used to  convey   information  from a  sender  (or source, transmitter) to a  receiver  (or sink). Communication-instance : a specific communication between a source and a sink. Forwarding Process : a component of a system responsible for the transport of information. Partition:   Generally, a  partition  is a splitting of something into parts. In communications we further assume that partitions can only interact with each other (i.e. exchange information) by established interfaces.  Source :  aka transmitter Sink :  aka receiver
  • 5. Resources Resource usage can either be dedicated or shared Dedicated : the client of the resource controls the said resource for a period of time (either bounded or un-bounded) Shared : multiple clients compete  to access & use the said resource using a coordination protocol (or apparent lack thereof :-) Dedicated access is just a special case of Shared access: nothing is really dedicated for an unbounded time period, more likely "leased" for a bounded time period (by a master process).
  • 6. Medium - Dimensions A medium consists of 3 domains: Frequency Domain Time Domain Power Domain   ALL dimensions ALWAYS present Often, the power dimension is assumed and abstracted from diagrams Frequency:  change in Time Domain change  includes matter level change   e.g. finger over braille text
  • 7. Dimensions - Examples Example 1: Medium is divided in the frequency domain - total isolation between dimensions Example 2: ( CDMA ) Medium is divided using "codes" in the Freq+Power plane - no total isolation
  • 8. Medium - Partitioning E.g.  air/vacuum : can be spatially partitioned (see figure) can be temporally partitioned ( time domain multiplexed ) a combination of the above
  • 9. Medium For communication to take place, one or several  medium  must be used between  source (s) and  sink (s). A medium can either be dedicated or shared Dedicated 1 source, m sinks (where m>=1) Special case of shared Shared n sources, m sinks Requires a coordination protocol (e.g. CS MA /CD)
  • 10. Medium - Access Multiple Access (i.e. shared access) requires a coordination protocol active between the sources Manage Information Merging => Loss
  • 11. Information 3 fundamental properties: Information can be copied Information can be modified Information can be measured Note: Erase ~ no copy
  • 12. Information Property: Copy Medium: air/vacuum By nature broadcast Use of electro-magnetic wave => copy is natural Partitioning is possible ( spatial, temporal ) Medium: metal / fiber strings Can be used in "broadcast" configuration too Easier to dedicate
  • 13. Information Property: Modify 2 fundamental types: Intentional => the usual purpose behind a communication Un-intentional => environmental cause etc. => yields to loss
  • 14. Information Property: Measure Measurement: Information Entropy Algorithmic Entropy ( Kolmogorov ) Complexity of the algorithm that describes the Information
  • 15. Information Copy: role of Power Distance => power @ each sink => power
  • 16. Forwarding Forwarding can take place in 2 fundamental types of channel: Destination Un-Aware Destination Aware
  • 17. Channel - Destination Un-aware Representation of a broadcast channel A) one source accessing the channel @ time t B) two sources accessing the channel @ time t  => loss
  • 18. Channel - Destination Aware Representation of a destination aware channel: A) Information copied to 1 egress B) Information copied to multiple egresses
  • 19. Forwarding - Identifier Types 2 fundamental types: Address Label Ultimately, the forwarding process requires an unambiguous way of delivering the information Note : we are not concerned here with the trivial case "identifier-less broadcast" 
  • 20. Address Types Unicast ==> 1 destination Multicast ==> n destination(s) where n>=0 Broadcast ==> 'all' Anycast ==> 1 destination from a set
  • 21. Label Type A "label" is meant to be interpreted : can refer to a sequence of hops to a destination can refer to a communication-instance (aka connection) Indirection towards a destination
  • 22. Connection Types 2 types: Non-merging (aka Transport Connection) Merging   Merging: when multiple sources merge their traffic Result: can't identify individual sources
  • 23. Merging Merging is undesirable: Noise merges into channels ==> loss of information Requires additional information (e.g. overhead) to mitigate against merging ==> less efficient Root Cause analysis difficult ==> higher OPEX
  • 24. Merging - Management Aspect In order to manage communication (e.g. in a network), it is highly desirable to have the capability to find the  root cause  of faults. Noise is always present If higher than usual , need to locate and mitigate Noise can (sometimes) have a signature ==> identifiable Packet Switching is prone to merging multipoint-to-point constructs configuration errors routing errors