Home > Articles > Networking

This chapter is from the book

This chapter is from the book

Computer and Communication Networks, 2nd EditionComputer and Communication Networks, 2nd Edition

Learn More Buy

This chapter is from the book

This chapter is from the book

Computer and Communication Networks, 2nd EditionComputer and Communication Networks, 2nd Edition

Learn More Buy

1.8 Exercises

  1. We transmit data directly between two servers 6,000 km apart through a geostationary satellite situated 10,000 km from Earth exactly between the two servers. The data enters this network at 100Mb/s.

    1. Find the propagation delay if data travels at the speed of light (2.3 × 108 m/s).
    2. Find the number of bits in transit during the propagation delay.
    3. Determine how long it takes to send 10 bytes of data and to receive 2.5 bytes of acknowledgment back.

  2. We would like to analyze a variation of Exercise 1 where servers are placed in substantially closer proximity to each other still using satellite for communication. We transmit data directly between two servers 60 m apart through a geostationary satellite situated 10,000 km from Earth exactly between the two servers. The data enters this network at 100Mb/s.

    1. Find the propagation delay if data travels at the speed of light (2.3 × 108 m/s).
    2. Find the number of bits in transit during the propagation delay.
    3. Determine how long it takes to send 10 bytes of data and to receive 2.5 bytes of acknowledgment back.

  3. Stored on a flash memory device is a 200 megabyte (MB) message to be transmitted by an e-mail from one server to another, passing three nodes of a connectionless network. This network forces packets to be of size 10KB, excluding a packet header of 40 bytes. Nodes are 400 miles apart, and servers are 50 miles away from their corresponding nodes. All transmission links are of type 100Mb/s. The processing time at each node is 0.2 seconds.

    1. Find the propagation delays per packet between a server and a node and between nodes.
    2. Find the total time required to send this message.
  4. Equation (1.2) gives the total delay time for connection-oriented networks. Let tp be the packet propagation delay between each two nodes, tf1 be the data packet transfer time to the next node, and tr1 be the data packet processing time. Also, let tf2 be the control-packet transfer time to the next node, and tr2 be the control-packet processing time. Give an expression for D in terms of all these variables.

  5. Suppose that a 200MB message stored on a flash memory device attached to a server is to be uploaded to a destination server through a connection-oriented packet-switched network with three serially connected nodes. This network forces packets to be of size 10KB, including a packet header of 40 bytes. Nodes are 400 miles apart from each other and each server is 50 miles away from its corresponding node. All transmission links are of type 100Mb/s. The processing time at each node is 0.2 seconds. For this purpose, the signaling packet is 500 bits long.

    1. Find the total connection request/accept process time.
    2. Find the total connection release process time.
    3. Find the total time required to send this message.

  6. We want to deliver a 12KB message by uploading it to the destination’s Web site through a 10-node path of a virtual-circuit packet-switched network. For this purpose, the signaling packet is 500 bits long. The network forces packets to be of size 10KB including a packet header of 40 bytes. Nodes are 500 miles apart. All transmission links are of type 1Gb/s. The processing time at each node is 100 ms per packet and the propagation speed is 2.3 × 108 m/s.

    1. Find the total connection request/accept process time.
    2. Find the total connection release process time.
    3. Find the total time required to send this message.

  7. Consider five serial connected nodes A, B, C, D, E and that 100 bytes of data are supposed to be transmitted from node A to E using a protocol that requires packet headers to be 20 bytes long.

    1. Ignore tp, tr, and all control signals; and sketch and calculate total tf in terms of byte-time to transmit the data for cases in which the data is converted into 1 packet, 2 packets, 5 packets, and 10 packets.
    2. Put all the results obtained from part (a) together in one plot and estimate where the plot approximately shows the minimum delay (no mathematical work is needed, just indicate the location of the lowest delay transmission on the plot).

  8. To analyze the transmission of a 10,000-bit-long packet, we want the percentage of link utilization used by the data portion of a packet to be 72 percent. We also want the ratio of the packet header, h, to packet data, d, to be 0.04. The transmission link speed is s = 100 Mb/s.

    1. Find the link utilization, ρ.
    2. Find the link capacity rate, μ, in terms of packets per second.
    3. Find the average delay per packet.
    4. Find the optimum average delay per packet.

  9. Consider a digital link with a maximum capacity of s = 100 Mb/s facing a situation resulting in 80 percent utilization. Equal-sized packets arrive at 8,000 packets per second. The link utilization dedicated to headers of packets is 0.8 percent.

    1. Find the total size of each packet.
    2. Find the header and data sizes for each packet.
    3. If the header size is not negotiable, what would the optimum size of packets be?
    4. Find the delay for each optimally sized packet.
  10. Develop a signaling delay chart, similar to Figures 1.7 and 1.8, for circuit-switched networks. From the mentioned steps, get an idea that would result in the establishment of a telephone call over circuit-switched networks.

  11. In practice, the optimum size of a packet estimated in Equation (1.7) depends on several other contributing factors.

    1. Derive the optimization analysis, this time also including the header size, h. In this case, you have two variables: d and h.
    2. What other factors might also contribute to the optimization of the packet size?

  12. Specify the class of address and the subnet ID for the following cases:

    1. A packet with IP address 127.156.28.31 using mask pattern 255.255.255.0
    2. A packet with IP address 150.156.23.14 using mask pattern 255.255.255.128
    3. A packet with IP address 150.18.23.101 using mask pattern 255.255.255.128

  13. Specify the class of address and the subnet ID for the following cases:

    1. A packet with IP address 173.168.28.45 using mask pattern 255.255.255.0
    2. A packet with IP address 188.145.23.1 using mask pattern 255.255.255.128
    3. A packet with IP address 139.189.91.190 using mask pattern 255.255.255.128
  14. Apply CIDR aggregation on the following IP addresses: 150.97.28.0/24, 150.97.29.0/24, and 150.97.30.0/24.
  15. Apply CIDR aggregation on the following IP addresses: 141.33.11.0/22, 141.33.12.0/22, and 141.33.13.0/22.

  16. Use the subnet mask 255.255.254.0 on the following IP addresses, and then convert them to CIDR forms:

    1. 191.168.6.0
    2. 173.168.28.45
    3. 139.189.91.190

  17. A certain organization owns a subnet with prefix 143.117.30.128/26.

    1. Give an example of one of the organization’s IP addresses.
    2. Assume the organization needs to be downsized, and it wants to partition its block of addresses and create three new subnets, with each new block having the same number of IP addresses. Give the CIDR form of addresses for each of the three new subnets.

  18. A packet with the destination IP address 180.19.18.3 arrives at a router. The router uses CIDR protocols, and its table contains three entries referring to the following connected networks: 180.19.0.0/18, 180.19.3.0/22, and 180.19.16.0/20, respectively.

    1. From the information in the table, identify the exact network ID of each network in binary form.
    2. Find the right entry that is a match with the packet.

  19. Part of a networking infrastructure consists of three routers R1, R2, and R3 and six networks N1 through N6, as shown in Figure 1.17. All address entries of each router are also given as seen in the figure. A packet with the destination IP address 195.25.17.3 arrives at router R1.

    Figure 1.17

    Figure 1.17 Exercise 19 network example

    1. Find the exact network ID field of each network in binary form.
    2. Find the destination network for the packet (proof needed).
    3. Specify how many hosts can be addressed in network N1.

  20. Consider an estimated population of 620 million people.

    1. What is the maximum number of IP addresses that can be assigned per person using IPv4?
    2. Design an appropriate CIDR to deliver the addressing in part (a).

  21. A router with four output links L1, L2, L3, and L4 is set up based on the following routing table:

    Mask Result

    Link

    192.5.150.16

    L3

    192.5.150.18

    L2

    129.95.38.0

    L1

    129.95.38.15

    L3

    129.95.39.0

    L2

    Unidentified

    L4

    The router has a masking pattern of 255.255.255.240 and examines each packet using the mask in order to find the right output link. For a packet addressed to each of the following destinations, specify which output link is found:

    1. 192.5.150.18
    2. 129.95.39.10
    3. 129.95.38.15
    4. 129.95.38.149

  22. A router with four output links L1, L2, L3, and L4 is set up based on the following routing table:

    Mask Result

    Link

    192.5.150.0

    L1

    129.95.39.0

    L2

    129.95.38.128

    L3

    Unidentified

    L4

    The router has two masking patterns of 255.255.255.128 and 255.255.255.1 and examines each packet using these masks in the preceding order to find a right output link among L1, L2, and L3. If a mask finds one of the three outputs, the second mask is not used. Link L4 is used for those packets for which none of the masks can determine an output link. For a packet addressed to a destination having each of the following IP addresses, specify which mask pattern finds a link for the packet and then which output port (link) is found:

    1. 129.95.39.10
    2. 129.95.38.16
    3. 129.95.38.149

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020