This question deals with the Poisson process and is formulated in terms of a subway station. It could as well be formulated in terms of a networking problem. A subway station where different train lines intersect is like switch/router in the communication network with the different train lines corresponding to what are called Labelled Switched Paths (LSPs). As for the trains, you can think of them as packets or burst of packets. One can draw this analogy also in optical networks which forms the core of the Internet backbone. Two one-way subway lines, the A train line and the B train line, intersect at a transfer station, A trains and B trains arrive at the station according to independently operating Poisson processes with rates λA = 3 trains/hr and λB = 6 trains/hr. We assume that passenger boarding and un-boarding occurs almost instantaneously. At a random time, Bart, a prospective passenger, arrives at the station, awaiting an A train. [Note that the superposition of two Poisson processes with rates λ1 and λ2 is also a Poisson process with rate λ1 + λ2.] • What is the probability that the station handles exactly 9 trains during any given hour? • If an observer counts the number of trains that the station handles each hour, starting at 8:00 A.M. on Tuesday, what is the expected number of hours until he or she will first count exactly 9 trains during an hour that commences ”on the hour”? (e.g., 9: 00 A.M., 10: 00 A.M., 2: 00 P.M.)

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
icon
Related questions
Question

This question deals with the Poisson process and is formulated in terms of a subway station. It could as well
be formulated in terms of a networking problem. A subway station where different train lines intersect is like
switch/router in the communication network with the different train lines corresponding to what are called
Labelled Switched Paths (LSPs). As for the trains, you can think of them as packets or burst of packets. One
can draw this analogy also in optical networks which forms the core of the Internet backbone.

Two one-way subway lines, the A train line and the B train line, intersect at a transfer station, A trains
and B trains arrive at the station according to independently operating Poisson processes with rates λA =
3 trains/hr and λB = 6 trains/hr. We assume that passenger boarding and un-boarding occurs almost
instantaneously. At a random time, Bart, a prospective passenger, arrives at the station, awaiting an A train.
[Note that the superposition of two Poisson processes with rates λ1 and λ2 is also a Poisson process with
rate λ1 + λ2.]
• What is the probability that the station handles exactly 9 trains during any given hour?
• If an observer counts the number of trains that the station handles each hour, starting at 8:00 A.M. on
Tuesday, what is the expected number of hours until he or she will first count exactly 9 trains during
an hour that commences ”on the hour”? (e.g., 9: 00 A.M., 10: 00 A.M., 2: 00 P.M.)

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Hyperlinks
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
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education