Computer network simple homework

QUESTION 1

1.[Unit 6] If connectionless service is offered, packets are injected into the network individually and routed independently of each other. No advance setup is needed. In this context, the packets are frequently called __________.

A.

Frames

B.

Datagrams

C.

Independent Packets

D.

Virtual Circuit

QUESTION 2

1.[Unit 6] What is NOT a goal of routing algorithms?

A.

Stability

B.

Uniqueness

C.

Fairness

D.

Efficiency

QUESTION 3

1.[Unit 6] A ________________ operates by having each router maintain table giving the best known distance to each destination and which link to use to get there. These tables are updated by exchanging information with the neighbors. Eventually, every router knows the best link to reach each destination.

A.

Bellman-Ford routing algorithm

B.

Shortest path routing algorithm

C.

Distance vector routing algorithm

D.

Best link routing algorithm

QUESTION 4

1.[Unit 6] Variants of ______________ called IS-IS and OSPF are the routing algorithms that are most widely used inside large networks and the Internet today. The idea is fairly simple and can be stated as five parts. 1). Discover neighbors, learn network addresses. 2). Set distance/cost metric to each neighbor. 3). Construct packet telling all learned. 4). Send packet to, receive packets from other routers. 5). Compute shortest path to every other router.

A.

Link state routing

B.

Internet routing

C.

Shortest path routing

D.

Five state routing

QUESTION 5

1.[Unit 6] Hosts need to send messages to many or all other hosts. For example, a service distributing weather reports, stock market updates, or live radio programs might work best by sending to all machines and letting those that are interested read the data. Sending a packet to all destinations simultaneously iscalled __________________.

A.

Everycasting

B.

Broadcasting

C.

Multicasting

D.

Anycasting

QUESTION 6

1.[Unit 6] . In this routing protocol, routes to a destination are discovered on demand, that is, only when a somebody wants to send a packet to that destination. This saves much work that would otherwise be wasted when the topology changes before the route is used. At any instant, the topology of an ad hoc network can be described by a graph of connected nodes. What is this routing protocol called?

A.

Topological Routing

B.

Hierarchical Routing

C.

Anycast routing

D.

AODV

QUESTION 7

1.[Unit 6] What is NOT a category of QoS?

A.

Constant bit rate

B.

Available bit rate

C.

Packet bit rate

D.

Real-time variable bit rate

QUESTION 8

1.[Unit 6] Why each packet is routed independently on datagram networks?

QUESTION 9

1.[Unit 6] _________________ is a technique for regulating the average rate and burstiness of a flow of data that enters the network. The goal is to allow applications to transmit a wide variety of traffic that suits their needs, including some bursts, yet have a simple and useful way to describe the possible traffic patterns to the network.

QUESTION 10

1.[Unit 6] List three kinds of resources that can potentially be reservedfor different flows.

Place your order
(550 words)

Approximate price: $22

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency
Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

Read more

Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.

Read more

Privacy policy

Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.

Read more

Fair-cooperation guarantee

By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.

Read more
error: Content is protected !!