Final Flashcards

(34 cards)

1
Q

Social Issues of computer networks

A
  • Content ownership (DMCA takedowns)
  • Privacy (Web tracking)
  • Malicious software (Theft, phishing)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Types of networks classified by their scale (5), with examples

A
  • PAN (Personal Area Network).
    Ex: Bluetooth keyboard & mouse connected to computer)
  • LAN (Local Area Network)
    Ex: Connect devices in a home or office building
  • MAN (Metropolitan Area Network)
    Ex: Connect devices over a metropolitan area. Houses on a street connect to junction box that connects to antenna and internet.
  • WAN (Wide Area Network)
    Ex: Connected devices over a country. ISP network, customers buy connectivity to use
  • The Internet (network of all networks)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Service vs Protocol

A

Service: Layer talks vertically to the other
Protocol: Layer talks to its peer horizontally

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

OSI 7 layers and their functions

A
  1. Application Layer
    - Provides functions needed by users
  2. Presentation Layer
    - Translates, encrypts, and compresses data
  3. Session Layer
    - Manages task dialogues
  4. Transport Layer
    - Provides end-to-end message delivery and error recovery
  5. Network Layer
    - Sends packets from source host to destination host
  6. Data Link Layer
    - Organizes bits into frames, provides hop-to-hop delivery
  7. Physical Layer
    - Sends bits as signals from one hop to the next
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Types of data deliveries

A

Node to node: Data link layer
Host to host: Network layer
Process to process: Transport layer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

TCP model layers used in course (5)

A
  1. Application
  2. Transport
  3. Network
  4. Link
  5. Physical
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Channelization definition and the 3 protocols

A

Def: multiple access method in which the available bandwidth of a link is shared in time, frequency, or code, between different stations.

  1. Frequency-Division Multiple Access (FDMA)
  2. Time-Division Multiple Access (TDMA)
  3. Code-Division Multiple Access (CDMA)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

2 Basic rules of a Walsh table, & how to find the number of sequences

A
  1. W1=(+1)
  2. W2N = WN WN WN /WN

Number sequences need to be N = 2^k were k is an integer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Find the chips for a network with two stations and four stations

A

2: [+1+1] and [+1-1]
4: [+1+1+1+1], [+1-1+1-1], [+1+1-1-1] and [+1-1-1+1]

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

CDMA: What is the number of sequences if we have 90 stations in our network?

A

Needs to = 2^k

2^7 = 128 sequences

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Random Access definition and the 4 protocols

A

Def: No station is superior to another station, and no station controls another in allowing it to send or not send. Each station uses a protocol to make a decision on whether or not to send

  1. ALOHA
  2. Carrier Sense Multiple Access
  3. Carrier Sense Multiple Access with Collision Detection
  4. Carrier Sense Multiple Access with Collision Avoidance
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Explain the procedure for pure ALOHA protocol

A

Send Frame ->Wait Time-Out Time (2xTp)->Ack Received?->no-> K=K+1-> check if K>Kmax, if not->Choose random number R between 0 & 2^k-1 ->Wait Tb Time (R x Tp/Tfr)-> restart

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the vulnerable time for pure ALOHA Protocol?

A pure ALOHA network transmits a 200-bit frame on a shared channel of 200kbps, what is the time requirement to make this frame collision-free?

A

Vulnerable time = 2 x Tfr

Tfr= 200bits/200kbps = 1ms
2 x 1ms = 2ms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is the vulnerable time in CSMA?

A

Vulnerable time = propagation time

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What are the 3 persistence methods and their flow diagrams

A
  1. 1-persistent. Highest chance of collision
    Channel:
    Idle = Station can transmit
    Busy = Restart
  2. Non-persistent. Reduces chance of collision, less efficient
    Channel:
    Idle = Station can transmit
    Busy = Wait randomly
  3. p-persistent. Reduces the chance of collision and improves efficiency.
    Channel:
    Idle = Probability Outcome?
    - ≤ p = Station can transmit
    - > p = Wait a slot
    - Channel:
    • Idle = back to probability outcome
    • Busy = Use back-off process as if collision occurred
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

A network using CSMA/CD has a bandwidth of 10 Mbps, if the maximum propagation time is 25.6 ms, what is the minimum size of the frame?

A

Tfr= 2 x Tp = 2 x 25.6 = 51.2 ms to detect collision

Size of frame = 10mbps x 51.2 ms = 512 bits or 64 bytes

17
Q

What is controlled-access? Explain each of the 2 popular methods.

A

Def: Stations consult one another to find which station has the right to send. A station cannot send unless authorized by other stations.

  1. Polling.
    - Poll each station
  2. Token Passing. Connects all stations.
    - Physical ring
    - Dual ring
    - Bus ring
    - Star ring
18
Q

How does a machine detect collisions in CSMA/CD protocol?

A

By measuring the energy level of the channel. If the measured energy level is almost twice the normal level then a collision is detected

19
Q

What is the motivation for creating the CSMA/CA protocol?

A

Because detecting collisions (CSMA/CD) is very hard in wireless communications, since much of the energy is lost in transmission. The collision may add 5% to 10% additional energy.

20
Q

What are the rules for IPv4 addresses? (4)

A
  1. There must be no leading zeros
  2. There can be no more than four numbers
  3. Each number needs to be less than or equal to 255
  4. A mixture of binary notation and dotted-decimal notation is not allowed
21
Q

Explain the 2 ways of finding the first and last addresses in a block? How to find the number of addresses in the block?

A
  1. Set 32-n rightmost bits to 0 for first address, set 32-n bits to 1 for last address
  2. AND the address with the mask in binary form (28 means 28 1s and 4 0s) for first address, OR the address with the mask complement in binary form for the last address

Find # of addresses in a block:

  1. 2^(32-n)
  2. Complement the mask, interpret as decimal, add 1
22
Q

What address changes from hop-to-hop, and what address usually remains the same?

A

Physical addresses change from hop-to-hop, Logical and port addresses usually remain the same

23
Q

Explain NAT

A

Network Address Translation

  • enables a user to have a large set of addresses internally and one address or a set of addresses externally.
  • Fixes the issue of limited addresses
  • NAT router replaces the source address in the packet with the global NAT address
24
Q

Hubs vs Switches

A

Hubs

  • Physical-layer repeaters
  • Bits from one link go to all other links at the same rate without buffering

Switches

  • Operates at the link layer
  • Has multiple ports, each connected to a computer
  • Forwards frames only to the destination computer since it knows the MAC address of each
25
What is Address Resolution Protocol? How does it function?
- Used to assign a logical address with a physical address - Used to find the physical address of the node when its internet address is known 1. ARP sends a request to all nodes for a physical address with a specific IP address 2. ARP replies with the the physical address to the system that requested
26
What do packet sniffers do? How can they be used?
'Read' information traversing a network ``` Can be use to analyze a network - Monitor network usage - Filter network traffic - Analyze problems Can be used maliciously - Steal information - Analyze network information to prepare an attack ```
27
What is the difference between glassful and classless addressing in IPv4? Why are most of the addresses in class A wasted, and why do medium or large corporations avoid class C addresses?
1. Classful addressing assigns an org a class A,B,C block of addresses, while classless addressing assigns an organization a block of contiguous addresses based on their needs 2. Class A is too big for most, meaning addresses are wasted. Class C is too small for most orgs.
28
What is the sequence number after sending N frames of a bit sequence?
= N mod (bit sequence into decimal+1)
29
What is the bandwidth for each FDMA, TDMA, & CDMA
FDMA: available bandwidth of the common channel is divided into bands that are separated by guard bands TDMA: bandwidth is just one channel that is timeshared between different stations CDMA: One channel carries all transmissions simultaneously
30
What is the vulnerable time for slotted ALOHA protocol?
Vulnerable time = Tfr (average transmission time)
31
How many netid and hostid bytes does each classful addressing class have? How are the classes divided?
``` A: 1 net id byte, 3 hostid bytes 0------- B: 2 net id bytes, 2 hostid bytes 10------ C: 3 net id bytes, 1 hostid byte 110----- D: 1110---- ```
32
Why are MAC addresses used by orgs?
- Utilize MAC addresses to identify computers on their network - Can be reconfigured by network interface driver software
33
Explain how computer A sends data from port address 'a' (of 3) to computer P port address 'j' (of 2). Show layer by layer functions.
1. Application layer: Data 2. Transport layer: Adds destination address 'j' and source address 'a' 3. Network layer: Adds physical address 'A' & 'P' 4. Data link layer: Adds header and trailer
34
What are the addresses reserved for private networks?
10. 0.0.0 to 10.255.255.255 172. 16.0.0. to 127.31.255.255 192. 168.0.0 to 192.168.255.255