Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

networks > Chapters 5-6 > Flashcards

Chapters 5-6 Flashcards

1
Q

Where the overarching control of network routing happens when considering the routing between near or distant nodes.

A

The Network Control Plane

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

Each router determines its own forwarding table by communicating with other router in the local network

A

Per-Router control

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

Routers talk to a centralized routing controller which determines the routing and tells the routers how to route traffic by providing tables

A

Logically centralized control

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

Looks at other nodes and chooses the path with the least immediate cost that has not been visited yet

A

Dijkstra’s algorithm (Link-State)

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

Link-State protocol that uses Dijkstra’s algorithm, and also addresses the problem of scale in the internet, while guaranteeing security and autonomy

A

OSPF (Open Shortest Path First)

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

Each domain has a router that links to other domains, which deals with traffic coming into and out of the domain it manages

A

Border Gateway Protocol (BGP)

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

Select route with the least cost to the next hop router

A

Hot Potato Routing

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

Length of a MAC address

A

48 bits

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

Length of a TCP header

A

16 bits

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

Length of a UDP header

A

8 bits

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

Length of an IPv4 address

A

32 bits

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

Length of an IPv6 address

A

128 bits

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

hosts, routers, switches, and Wi-Fi access points

A

Nodes

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

encapsulating the network-layer datagram with a link-layer frame before transmitting. A frame has a data field which is the network-layer datagram, a header, and a tail which contains a checksum for error correction

A

Framing

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

When there is a single sender and single receiver on the link this is a simple matter, but when there are multiple nodes on the link then protocols (such as the MAC protocol) help sort out the messages

A

Link access

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

Acknowledgement and retransmission over high-error-rate links (e.g. Wi-Fi), but may not offer reliable delivery service over more reliable links

A

Reliable delivery

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

Detect single bit errors

A

Single bit parity

18
Q

Two-dimensional bit parity

A

Detect and correct single bit errors

19
Q

The value of k-bit integers added together to form a sum used to check for flipped bits during transmission

A

Checksum

20
Q

Length of TCP and UDP checksums

A

16 bits

21
Q

Each node assigned a code that it uses to encode data

A

Code Division Multiple Access(CDMA)

22
Q

All nodes transmit frames of the same length all at the beginning of a slot, if there is a collision it detects it and transmits again before the end of the slot

A

Slotted ALOHA

23
Q

Listen before speaking, if someone else is speaking at the same time stop for a random amount of time. More propagation delay more likely collisions will occur

A

Carrier Sense Multiple Access (CSMA)

24
Q

Node stops transmitting when it senses that another node is transmitting at the same time

A

CSMA/CD (Collision Detection)

25
Q

After c number of collisions retransmission is delayed by a random number of slot times between 0 and 2^c -1

A

Binary Exponential Backoff

26
Q

A master polls each node in turn to see if it has data to transmit, soliciting
transmissions

A

Polling protocol

27
Q

A special purpose frame, known as a token, is passed between the nodes in
some fixed sequence. If a node has a frame to transmit, it must wait until it
has the token before transmitting. If it does not have a frame, it passes the
token to the next node

A

Token-passing protocol

28
Q

Internet of cable service which combines aspects of channel partitioning protocols, random access protocols, and taking turns protocols

A

DOCSIS

29
Q

MAC Broadcast address

A

FF-FF-FF-FF-FF-FF

30
Q

Translates IP address to MAC address by asking machines to self-
identify

A

Address Resolution Protocol

31
Q

Way to have more than one LAN on a single switch

A

VLAN

32
Q

A building dedicated to the mass amounts of computer storage

A

Data center

33
Q

A switch plugged into a server rack

A

TOR (top of rack)

34
Q

A switch that is plugged into multiple TOR switches

A

Tier-2 switch

35
Q

A switch that is plugged into multiple tier-2 switches

A

Tier-1 switch

36
Q

Layer 5

A

Application

37
Q

Layer 4

A

Transport

38
Q

Layer 3

A

Network

39
Q

Layer 2

A

Data link

40
Q

Layer 1

A

Physical

networks (3 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions