Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

cs6250 - exam 1 updated version latest upload, Exams of Advanced Education

Cheyney University of PennsylvaniaAdvanced Education

cs6250 - exam 1 updated version latest upload

Typology: Exams

2025/2026

Available from 06/12/2026

tizian-mwangi
tizian-mwangi šŸ‡ŗšŸ‡ø

4.1

(8)

29K documents

1 / 14

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1 / 14
cs6250 - exam 1 updated version latest upload
1. How did Licklider and his team in the early 1960s experiment
with a precur-
sor to the internet?: Connecting two computers over a dial-up
telephone line
2. What is the Domain Name System (DNS) designed to do
primarily?:
Translate
domain names into IP addresses
3. What is the architectural design of the Internet protocol stack
based on?: -
Layers
4.
T/F: Both the data link and transports layer protocols may
provide error correction:
True
5.
What allows for communication between the applications
layer and the
transport layer: Sockets
6.
Which of the following protocols belong to the application
layer? [ether-net/DNS/UDP/IP]: DNS
7. Which two protocols belong to the transport layer?
[IP/TCP/UDP/HTTP]: TCP, UDP
8. When an application sends a packet of information across the
network, this packet travels down the IP stack and undergoes what
process: Encapsulation
9. According to the end-to-end principle, where should most of the
Internet's functionality/intelligence be implemented?: At the edges of the
network
10. What is the difference between hubs, bridges, and routers?:
They operate on
ditterent layers of the IP stack
11. T/F: the UDP and TCP protocols have a large overlap of
functionality: false
12.
T/F: the transport layer protocols offer a logical
connection between processes, only if the hosts reside in the
same network:
false
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe

Partial preview of the text

Download cs6250 - exam 1 updated version latest upload and more Exams Advanced Education in PDF only on Docsity!

1 / 14

cs6250 - exam 1 updated version latest upload

  1. How did Licklider and his team in the early 1960s experiment with a precur-sor to the internet?: Connecting two computers over a dial-up telephone line
  2. What is the Domain Name System (DNS) designed to do primarily?: Translate domain names into IP addresses
  3. What is the architectural design of the Internet protocol stack based on?: - Layers
  4. T/F: Both the data link and transports layer protocols may provide error correction: True
  5. What allows for communication between the applications layer and the transport layer: Sockets
  6. Which of the following protocols belong to the application layer? [ether-net/DNS/UDP/IP]: DNS
  7. Which two protocols belong to the transport layer? [IP/TCP/UDP/HTTP]: TCP, UDP
  8. When an application sends a packet of information across the network, this packet travels down the IP stack and undergoes what process: Encapsulation
  9. According to the end-to-end principle, where should most of the Internet's functionality/intelligence be implemented?: At the edges of the network
  10. What is the difference between hubs, bridges, and routers?: They operate on ditterent layers of the IP stack
  11. T/F: the UDP and TCP protocols have a large overlap of functionality: false
  12. T/F: the transport layer protocols offer a logical connection between processes, only if the hosts reside in the same network: false

2 / 14

  1. T/F: a sender host receives a message from the application layer it encapsu-lates it with the transport layer header before passing it down to the network layer: true
  2. T/F: an application running on a host can bind to multiple sockets simulta-neously: true
  3. T/F: a host cannot maintain a TCP socket and a UDP socket simultaneous-ly: false
  4. T/F: the identifier of a UDP socket is a tuple of destination IP address and port: true
  5. T/F: the identifier of a TCP socket is a tuple of source IP address and port: false
  6. T/F: UDP is considered more lightweight than TCP: true
  7. T/F: when two hosts use UDP to send and receive messages, they need to signal the end of sending data to each other when they are done: false
  8. T/F: one of the functionalities that UDP offers is to increase or decrease the pace with which the sender sends data to the receiver: false
  9. T/F: UDP offers basic error checking: true
  10. T/F: assume hosts A, B, and C. Host A has a UDP socket with port 123. Hosts B and C each send their own UDP segment to Host A. Hosts B and C cannot use the same destination port 123 for sending their UDP segment: false
  11. T/F: TCP offers in order delivery of packets, flow control, and congestion control: true
  12. T/F: TCP detects packet loss using timeouts and triple duplicate acknowl-edgements: true
  13. T/F: flow control is a rate control mechanism to protect the receiver's buffer from overflowing: true
  14. T/F: congestion control is a rate control mechanism to protect the network from congestion: true
  15. T/F: in TCP, the number of unacknowledged segments that a sender can have is the minimum of the congestion window and the receive window: true

4 / 14 ness; would AIAD, MIAD, or MIMD converge? how would their convergence behavior differ from AIMD?: MIAD will converge; AIAD and MIMD will oscillate over the full bandwidth utilization line, but will not converge; the other policies are not as stable, decrease policy in AIAD/MIAD is not as aggressive to address congestion control, and increase policy in MIAD and MIMD is too aggressive

  1. explain how in TCP cubic the congestion window growth becomes indepen- dent of RTTs: in cubic, the window growth only depends on the time between two consecutive congestion events; one congestion event is the time when TCP undergoes fast recovery, allowing cubic flows competing in the same bottleneck to have approx. same size window independent of RTTs, achieving good RTT fairness (based on time since last loss event, not RTTs or acks)
  2. T/F: "routing" and "forwarding" are interchangeable terms: false
  3. T/F: consider a source and destination host; before packets leave the source host, the host needs to define the path over which the packets will travel to reach the destination host: false
  4. T/F: intra-domain routing refers to routing that takes place among routers that belong to the same administrative domain. in contrast, when routers be- long to different administrative domains, we refer to routing as inter- domain routing: true
  5. T/F: consider the link-state routing protocol; the link costs are known to all nodes: true
  6. T/F: consider the link-state routing protocol; the network topology is known to all nodes: true
  7. T/F: consider the link-state routing protocol and a node u as our source node; the goal of the algorithm is to compute the least-cost paths from the source node u to every other node in the network: true
  8. T/F: consider the link-state routing protocol with a node u as our source node; consider the initialization of the algorithm; we initialize the least-cost path from node u to directly attached

5 / 14 neighbors to be the cost of the direct links, and for non-directly attached neighbors, we initialize the least-cost path to be infinity: true

  1. T/F: the distance vector routing algorithm continues iterating as long as neighbors send new updates to each other: true
  2. the distance vector routing algorithm is an example of a algorithm:

decentralized

  1. T/F: the distance vector routing algorithm requires synchronization be-tween routers: false
  2. T/F: in the distance vector routing algorithm, each node maintains and updates its own view of the network: true
  3. consider the distance vector routing algorithm; which is used by each node to update the node's distance vector: bellman ford equation
  4. T/F: the count-to-infinity problem states that good news propagates slowly among nodes in the network: false
  5. T/F: the poison reverse technique solves the count-to- infinity problem for all network topologies: false
  6. T/F: the routing information protocol (RIP) is based on the distance vector protocol: true
  7. T/F: open shortest path first (OSPF) is based on the link state routing algorithm: true
  8. T/F: the number of egress points that a network has is upper bounded: false
  9. T/F: consider a network with multiple egress points. further consider that these egress points offer different paths to the same external conditions. then these paths must have different costs: false
  10. T/F: according to the hot potato routing technique it is in a network's best interest to route the traffic so that it exits the network at the router geographically closest to the one

7 / 14

  • an intra-domain routing algorithm
  1. T/F: there may be multiple egress points from an administrative domain to an external destination: true
  2. T/F: hot potato routing always selects the egress point that is geographical-ly closest to the ingress point: false
  3. hot potato routing: technique/practice of choosing a path within the network by choosing the closest egress point based on intra-domain path cost (IGP cost)
  4. the internet topology has been evolving from a structure into a structure: hierarchical, flat
  5. T/F: an autonomous system is a group of routers that operate under the same administrative authority: true
  6. T/F: autonomous systems implement their own set of policies, make their own traffic engineering decisions and interconnection strategies, and deter-mine how traffic leaves and enters the network: true
  7. T/F: BGP protocol is used within an AS and focuses on optimizing a path metric within the network; examples of BGP protocol are (OSPF) and RIP: false
  8. T/F: in a peering relationship, the traffic exchanged between the two peers must be highly asymmetric so that there is enough incentive for both parties to peer with each other: false
  9. T/F: a customer-provider relationship between ASes is based on a financial settlement, which determines how much the customer will pay the provider; the provider takes care of connecting the customer network with destinations found in the provider's routing table; the customer pays regardless of the direction of traffic: true
  10. T/F: there is no incentive for smaller ISPs to peer with each other: false
  11. T/F: provider ASes have a financial incentive to forward as much of their customers' traffic as possible: true
  12. what is the correct order for an AS to import its routes based on their incentive: routes are learned from: customers --> peers --> providers

8 / 14

  1. what is the difference between iBGP and eBGP?: - both flavors take care of disseminating external routes
  • an eBGP session is established between two border routers that belong to ditterent ASes
  • an iBGP session is established between routers that belong to the same AS
  • once a router hears about a route that is learned from eBGP, then it disseminates that route to other internal routers in the same AS, using iBGP
  1. what is the difference between iBGP and IGP?: - IGP-like protocols are used to establish paths between the internal routers of an AS based on specific costs within the AS
  • iBGP is only used to disseminate external routes within the AS
  1. T/F: a router within the AS decides which route to export by first applying import policies to exclude routes entirely from further consideration: true
  2. the LocalPref attribute is used to prefer routes learned through a specific AS over other ASes for traffic: outbound
  3. assume AS_X learns of a route to the same destination DEST_A via AS_Y and AS_Z; if AS_X prefers to route its traffic through AS_Z due to peering or business, it can assign a LocalPref value to routes it learns from AS_Z, and thus using LocalPref, AS_X can control where traffic exits the AS: higher
  4. the MED (multi-exit discriminator) value is used by ASes connected by multi- ple links to designate which of those links are preferred for traffic: inbound
  5. assume that AS_X prefers routes advertised to AS_Y to go through R1 instead of R2; for AS_Y to be influenced to choose R1 to forward traffic to AS_X, R1 must have a MED value, assuming that all other attributes are equal: lower
  6. one of the services offered by IXPs is protection against attacks: DDoS

10 / 14

  1. T/F: when a large provider or CDN joins an IXP, this can act as an incentive for other networks to join as well: true
  2. T/F: at an IXP, the members have the choice to peer privately or publicly: true
  3. T/F: IXPs leading incentive to establish route servers was to charge the participants for using it: false
  4. T/F: an IXP route server does not need to run the BGP protocol to facilitate the establishment of multi-lateral peering sessions: false
  5. T/F: for multi-lateral BGP peering sessions at an IXP, the participants have the choice to advertise routes, either directly to other participants, or to the route server: false
  6. t he data plane functions of a traditional router are implemented in - : hardware
  7. the control plane functions of a traditional router are implemented in : software
  8. which plane operates on a shorter timescale?: data
  9. classify as operation of data plane or control plane: computing paths based on a protocol: control plane
  10. classify as operation of data plane or control plane: forwarding packets at Layer 3: data plane
  11. classify as operation of data plane or control plane: switching packets at Layer 2: data plane
  12. classify as operation of data plane or control plane: running protocols to build a routing table: control plane
  13. classify as operation of data plane or control plane: running the spanning tree protocol: control plane
  14. classify as operation of data plane or control plane: decrementing time to live (TTL): data plane
  15. classify as operation of data plane or control plane: computing an IP header checksum: data plane
  16. classify as operation of data plane or control plane: running

11 / 14 a protocol/log-ic to configure a middle box device for load balancing: control plane

  1. classify as operation of data plane or control plane: forwarding packets according to installed rules in a middle box device: data plane
  2. what type of switching can send multiple packets across the fabric in parallel?: interconnection network/crossbar
  3. determine the mask for the address: 192.168.0.1/24: 255.255.255.
  4. a multi-bit trie is than a uni-bit trie representing same prefix database and requires memory accesses to perform a lookup: shorter, fewer

13 / 14 parallel iterative matching: true

  1. T/F: with parallel iterative matching, the input links are "matched" with output links in a fixed manner that stays the same as the rounds are progress-ing: false

14 / 14

  1. T/F: with the token bucket traffic approach, we can still have bursts of traffic entering the network, but these bursts are capped: true
  2. T/F: with the leaky bucket approach, we only allow the traffic to enter the network in a configured rate: true
  3. T/F: traffic policers target to limit traffic bursts to a configured max, where-as traffic shapers aim to smooth out the overall rate: true
  4. T/F: with the leaky bucket approach, we can still have discarded packets: - true