**Vehicular Traffic Networks**Recall that *latency* is the time it takes to get from one place to another (measured in seconds, minutes, or hours), and *bandwidth* is the amount of something that can pass through a point in a given amount of time (measured in cars per minute, bits per second, etc.).Consider this road network with six cities. Single lines represent one lane in each direction, and double lines represent two lanes in each direction.[Diagram Description: A network graph connects the following points, representing cities]- A to B through four possible routes: ACDB, AEFB, ADB, AEB.- Distances: A to C = 3 mi, C to D = 6 mi, D to B = 3 mi, A to E = 5 mi, E to F = 8 mi, F to B = 5 mi, A to D = 9 mi, E to D = 9 mi.1. **There are four different routes to get from A to B (without going in circles). What are the four routes?** (In graph theory language, you would say there are four distinct paths that go from A to B without cycles.)2. **What is the total length of the shortest route?**3. Assume all the roads have a speed limit of 30 miles per hour. - a. **What is the latency of a car traveling from A to B along route ACDB?** - b. **What is the latency of a car traveling from A to B along route AEDB?** 4. Assume everyone follows the 2-second rule for following distance. - a. **What is the bandwidth of the route ACDB?** *(Hint: the bandwidth of a route is limited by the lowest bandwidth of any link in the path.)* - b. **What is the bandwidth of the route AEDB?**5. **Challenge problem:** Now suppose we want to build a house in city B using materials in city A. We have 10,000 bricks that we have to get from A to B as fast as possible. Assume a car can carry 10 bricks, cars always follow the 2-second rule, and there is no other traffic on the road. What is the total time it will take to get all the bricks from A to B? You will have to consider both latency and bandwidth **Data Networks**Latency and bandwidth are used to measure speed in computer networks. The latency (sometimes called the ping) is how long it takes one bit to get across the network. The bandwidth is how many bits can go by in a second. The bandwidth is analogous to the 2-second rule in the vehicular traffic example.Suppose two computers (A and B) are connected in a network. - The latency of the connection is 20 ms (0.020 seconds), and the bandwidth of the connection is 40 kbps (40000 bits per second). (This is a pretty typical latency, but it’s a very low bandwidth these days. It’s like dial-up rate.) 6. How long does it take 1 bit to get from A to B? 7. How long does it take 2 bits to get from A to B? Hint: The second bit can follow right after the first bit. You don’t have to wait for the first bit to reach B before A sends the second bit.The formula to find the total amount of time it takes to get a file across the network is: For example, if you are sending an 80000 bit file across the network described above, the formula says the time required is 2.02 seconds: This formula works because it takes 0.02 seconds for the first bit to get across the network (the latency). Then all the other bits are following right after it, one after the other as fast as the bandwidth allows. Since the bandwidth is 40 kbps, 40000 bits are arriving at computer B every second. In this example, it takes 2 full seconds to get all the bits into computer B.**Diagram Explanation:** A diagram is shown with two icons representing a computer network and numbers representing latency and bandwidth. - **Latency:** 10 ms- **Bandwidth:** - 1 MB file - 80 kbpsNow suppose you want to send a 1-megabyte file across the computer network above. 8. How many bytes are in the file? 9. How many bits are in the file? 10. Use the formula to find the total amount of time it will take to send the file over the network. Make sure the units are consistent.

NOTE- according to policy we can provide answers for first 3 question (in case of multiple question)…

Answered: Consider this road network with six…

Consider this road network with six cities. Single lines represent 1 lane in each direction, and double lines represent 2 lanes in each direction. 6 mi 3 mi 3 mi 9 mi A 5 mi 5 mi 8 mi F

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: 5.01-2. Dijkstra's Algorithm (1, part 2). Consider the network shown below, and Dijkstra’s…

A: Dijkstra’s shortest path algorithm is used to compute the shortest path from one node to all network…

Q: 31. Consider the network shown below, and assume that each node initially knows the costs to each of…

A: Distance-Vector algorithm is iterative, asynchronous and distributed algorithm. The algorithm is…

Q: What three conditions must be fulfilled for a network to operate optimally? Please describe one to…

A: What is network: A network is a collection of interconnected devices, such as computers, servers,…

Q: A cell-phone carrier is allocated 642 radio frequencies to operate in a city with a hexagon pattern…

A: The incentive for N is a component of what proportion variable a conveyable or base station will…

Q: B 10 A 1 4 8 7 9 3. C 2 E Show the steps to find the shortest path between A and G and write its…

A: The steps to find the shortest path between A and G with its cost

Q: Find the shortest route from vy to vy. 1 2 4 1 3. 2.

A: According to the graph given:- We have to find the shortest route.

Q: Recall Pigou’s example discussed in class, where there are two roads that connect a source, s, and…

A: In Pigou's example, we consider a scenario where there are two roads connecting a source, s, and a…

Q: Develop a system of linear equations for the network by writing an equation for each router (A, B,…

A: MATLAB stand for MATrix Laboratory. Matlab was developed by MathWorks. As per rules, I answered only…

Q: Dijkstra's Algorithm (1, part 3). Consider the network shown below, and Dijkstra’s link-state…

A: SOLUTION -Dijkstra’s shortest path algorithm is used to compute the shortest path from one node to…

Q: Two blue armies are each poised on opposite hills preparing to attack a single red army in the…

Q: 5.01-1. Dijkstra's Algorithm (1, part 1). Consider the network shown below, and Dijkstra's link-stat…

A: Dijkstra's algorithm is used to find shortest path between two vertices and it is a greedy…

Q: Below is the graph representing cities named A, B, C, D, E, and F, with the edge weights…

A: In computer science, a graph is a collection of nodes (also known as vertices) and edges that…

Q: Implement a convex optimization project for a computer network (use YALMIP and CVXPY Python toolbox…

A: Note that the above code is just an example and may need to be modified to fit your specific…

Q: An office with 7 rooms will connect with electric wire. All possible connecting are showed in a…

Q: Use K-Maps to simplify each of the following: 1. ~X~у~z+~ху~z+x~y~z+ ху~z 2. ~у~z +~yz + ху~z

A: Note: We are authorized to answer one question at a time, since you have not mentioned which…

Concept explainers

Network transmission cabling

A network is a collection of devices connected by communication links. A device can be a computer or any instrument capable of sending and receiving data or information formed by other nodes toward the network. A channel that connects people or things is known as a network. It sends the data from one place to another. It is the basic concept of a computer, network, and data communications.

Question

**Vehicular Traffic Networks**

Recall that *latency* is the time it takes to get from one place to another (measured in seconds, minutes, or hours), and *bandwidth* is the amount of something that can pass through a point in a given amount of time (measured in cars per minute, bits per second, etc.).

Consider this road network with six cities. Single lines represent one lane in each direction, and double lines represent two lanes in each direction.

[Diagram Description: A network graph connects the following points, representing cities]
- A to B through four possible routes: ACDB, AEFB, ADB, AEB.
- Distances: A to C = 3 mi, C to D = 6 mi, D to B = 3 mi, A to E = 5 mi, E to F = 8 mi, F to B = 5 mi, A to D = 9 mi, E to D = 9 mi.

1. **There are four different routes to get from A to B (without going in circles). What are the four routes?**
(In graph theory language, you would say there are four distinct paths that go from A to B without cycles.)

2. **What is the total length of the shortest route?**

3. Assume all the roads have a speed limit of 30 miles per hour.
- a. **What is the latency of a car traveling from A to B along route ACDB?**
- b. **What is the latency of a car traveling from A to B along route AEDB?**

4. Assume everyone follows the 2-second rule for following distance.
- a. **What is the bandwidth of the route ACDB?**
*(Hint: the bandwidth of a route is limited by the lowest bandwidth of any link in the path.)*
- b. **What is the bandwidth of the route AEDB?**

5. **Challenge problem:** Now suppose we want to build a house in city B using materials in city A. We have 10,000 bricks that we have to get from A to B as fast as possible. Assume a car can carry 10 bricks, cars always follow the 2-second rule, and there is no other traffic on the road. What is the total time it will take to get all the bricks from A to B? You will have to consider both latency and bandwidth

**Data Networks**

Latency and bandwidth are used to measure speed in computer networks. The latency (sometimes called the ping) is how long it takes one bit to get across the network. The bandwidth is how many bits can go by in a second. The bandwidth is analogous to the 2-second rule in the vehicular traffic example.

Suppose two computers (A and B) are connected in a network.
- The latency of the connection is 20 ms (0.020 seconds), and the bandwidth of the connection is 40 kbps (40000 bits per second). (This is a pretty typical latency, but it’s a very low bandwidth these days. It’s like dial-up rate.)

6. How long does it take 1 bit to get from A to B?

7. How long does it take 2 bits to get from A to B? Hint: The second bit can follow right after the first bit. You don’t have to wait for the first bit to reach B before A sends the second bit.

The formula to find the total amount of time it takes to get a file across the network is:

For example, if you are sending an 80000 bit file across the network described above, the formula says the time required is 2.02 seconds:

This formula works because it takes 0.02 seconds for the first bit to get across the network (the latency). Then all the other bits are following right after it, one after the other as fast as the bandwidth allows. Since the bandwidth is 40 kbps, 40000 bits are arriving at computer B every second. In this example, it takes 2 full seconds to get all the bits into computer B.

**Diagram Explanation:**
A diagram is shown with two icons representing a computer network and numbers representing latency and bandwidth.

- **Latency:** 10 ms
- **Bandwidth:**
- 1 MB file
- 80 kbps

Now suppose you want to send a 1-megabyte file across the computer network above.
8. How many bytes are in the file?

9. How many bits are in the file?

10. Use the formula to find the total amount of time it will take to send the file over the network. Make sure the units are consistent.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

need help for the part B!
Part c) Please Part c) Please
Bakery X distributes 30% of cakes to Cake Shop P and 70% of cakes to Cake Shop Q. Bakery Y distributes 60% of cakes to Cake Shop P and 40% of cakes to Cake Shop Q. Bakery Z distributes 50% of cakes to Cake Shop P and 50% of cakes to Cake Shop Q. Draw a network diagram, with input nodes X, Y and Z and output nodes P and Q, that represents the distribution of cakes from each bakery, and write down the matrix that represents it.
16. A 1 Ꭰ Step 0 1 2 3 4 5 1 N' 1 Consider the following network. 7 5 --F 1) With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from D to all network nodes. Show how the algorithm works by filling in the following table, where d(x) is the cost of the least-cost path from the source node D destination x as of the current iteration of the algorithm, p(x) is the previous node (neighbor of x) along the current least-cost path from the source D to x, N' is the subset of nodes whose shortest path from the source D has definitely been known. d(A),p(A) d(B),p(B) d(C),p(C) d(E),p(E) d(F),p(F) -B 2) According to the table computed in 1), show the shortest path tree rooted at D. 3) According to the results from 1) and 2), create the forwarding table, in which each row consists of two fields, destination and next hop.
1. Develop a system of linear equations for the network by writing an equation for each router (A, B, C, D, and E). Make sure to write your final answer as Ax=b where A is the 5x5 coefficient matrix, x is the 5x1 vector of unknowns, and b is a 5x1 vector of constants. 2. construct the augmented matrix [A b] and then perform row reduction using the rref() function. Write out your reduced matrix and identify the free and basic variables of the system. 3. Use MATLAB to compute the LU decomposition of A, i.e., find A = LU. For this decomposition, find the transformed set of equations Ly = b, where y = Ux. Solve the system of equations Ly = b for the unknown vector y. 4. Compute the inverse of U using the inv() function. 5. Compute the solution to the original system of equations by transforming y into x, i.e., compute x = inv(U)y 6. Check your answer for x1 using Cramer’s Rule. Use MATLAB to compute the required determinants using the det() function.
Subject : Algorithm and Data Structure
Question 2 a) Given the following undirected graph: LO 5 1 3 LO 5 Represent the graph as: (i) Adjacency matrix (ii) Adjacency list (iii) Incidence matrix 4 2 6 15 20 2 4 10 7 3 3 2
3. Consider the following network of Hawaii Island, which shows the location of various facilities within a youth camp and the distances (in tens of yards) between each facility. 4 6. 13 2 3. 6 11 2 15 4 3 4 8 3 17 2 4 12 1 3 16 4 2 5 4 7 10 3 14 5 Walking trails will be constructed to connect all the facilities. In order to preserve the natural beauty of the camp (and to minimize the construction time and cost), the directors want to determine which paths should be constructed. Use this network to determine which paths should be built to connect all facilities with the minimum distance. LO 21 3.
1, 2, 3
Intersections in England are often constructed as one-way "roundabouts," such as the one shown in the figure. Assume that traffic must travel in the directions shown. Find the general solution of the network flow. Find the smallest possible value for X8- X₁ = X3 X4 = X5 X is free X₁ = X₂ is free X₂ = X4 = X5 is free X8 is free 60 >>> Find the smallest possible value for xg. The smallest possible value for X is 100 B, *24 A X₁ 120 140 %3 What is the general solution of the network flow? Choose the correct answer below and fill in the answer boxes to complete your choice. A. B. C. D. x₁ is free is free x2 = X₂ is free X₂ is free X5 = X is free D * *1 E x5 F -80 100 X₂ sm X4 = 5 X is free
A six-story office building has 10 adjacent offices per floor. Each office contains a wall socket for a terminal in the front wall, so the sockets form a rectangular grid in the vertical plane, with a separation of 3 m between sockets, both horizontally and vertically. Assuming that it is feasible to run a straight cable between any pair of sockets, horizontally, vertically, or diagonally, how many meters of cable are needed to connect all sockets using a star configuration with a single router in the middle?
Dijkstra Algorithm