Brainscape's Knowledge GenomeTM

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


See full index

Networking > Content Distribution > Flashcards

Content Distribution Flashcards

1
Q

HTTP Request Line

A

Method (verb, POST HEAD etc.), URL, Version

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

Common HTTP headers

A

Referrer, User Agent

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

HTTP response status line

A

httpversion, response code, location , server, Allow, content-encoding, content-length, last modified

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

HTTP 100s

A

Information

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

HTTP 200s

A

Success

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

HTTP 300s

A

Move, redirect

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

HTTP 400s

A

Error 404 file not found

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

HTTP 500s

A

Server Error

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

How many TCP connection for request and response in early HTTP

A

1

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

Problem with Multiple short lived TCP connections

A

3-way handshake, slow start, servers in TIME_WAIT

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

Solution for the One TCP connection problem

A

Persistent Connections

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

What are presistent connections

A

Multiple request/response on a single TCP connection (multiplexed), Delimiters indicate the end of request, Content length

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

TIME_WAIT

A

he timeout in TIME_WAIT is just an amount of time after which we can safely assume that if the other end didn’t send anything, then it’s because he received the final ACK and closed the connection.

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

What is pipelining in persistent Connections

A

Client send request as soon as it encounters a reference object

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

Where can Caching occure

A

Client can cache, networks can cache and servers can cache

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

CDN

A

Content Distribution network

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

How does 304 relate to cache?

A

stands for NOT MODIFIED. The client should use the locally cached version.

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

Can DNS return near by servers

A

Yes, dig show this info

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

What is CDN

A

Overlay network of caches (Deliver content to client from optimal location) Geographically disparate servers

20
Q

Challenges in running a CDN

A

How?, Where?, HOw to find? How to choose server? how to direct clients?

21
Q

Goal of CDN

A

replicate content on many servers

22
Q

Server Selection

A

Which server? Lowest Load, Lowest Latency, Any “alive” servers

23
Q

Out of server selection which option is normally choosen

A

Lowest Latency

24
Q

Content routing

A

How to direct clients to a server

25
Q

Types of Content Routing

A

Routing (e.g. anycast (course)), application based (http redirect (delays)), Naming-based (eg DNS (fase))

26
Q

Benefits CDNs peer w/ISPs

A

better throughput (lower latency), redundancy, burstiness (lower transit cost)

27
Q

ISP peer w/CDNs

A

good performance for customers, lower transit costs

28
Q

Bittorrent

A

file sharing, large file distribution, fetch content from peers, file split among peers

29
Q

Seeders

A

Have a full copy of the file “Create the initial copies”

30
Q

leechers

A

Only have partial copy of the file

31
Q

freeloading

A

Disconnecting after the file has finished downloading

32
Q

Bittorrent solution for freeloading

A

Chocking

33
Q

Chocking

A

temporary refusal to upload chunks. If can’t download from a peer don’t upload to it. Eliminates freeloading problem

34
Q

How does bittorrent ensure chunks get swapped out

A

Rarest Piece first

35
Q

What s Rarest Piece first

A

Determine which pieces are most rare among clients download those first

36
Q

Since rarest piece may not be available initially what is used

A

Random piece first

37
Q

What is bittorrents end game?

A

Actively request missing pieces from all peers

38
Q

Distributed hash table is a form of?

A

Structured content overlay

39
Q

Types of distributed hash tables

A

CHORD consistent hashing

40
Q

CHORD

A

scalable distributed “lookup service” Key->value

41
Q

Benefits of chord

A

Scalable, Provable correctness, performance

42
Q

Chord Motivation

A

Scalable location of data in a large distributed system

43
Q

What is the key problem of chord?

A

key lookup

44
Q

Main idea of Consistent Hashing

A

Keys and nodes map to same ID space

45
Q

Two options when implementing consistent hashing

A

Option1: Every node know location of every other node. Lookups: O(1). Tables: O(N). Option2: Node knows only successor Table O(1), lookups O(n)

46
Q

chords solution to the key lookup problem

A

Finger table. (Read the chord paper)

Networking (8 decks)

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