The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | May 2017 |
| Last Sign in: | 398 Weeks Ago, 1 Day Ago |
| Questions Answered: | 66690 |
| Tutorials Posted: | 66688 |
MCS,PHD
Argosy University/ Phoniex University/
Nov-2005 - Oct-2011
Professor
Phoniex University
Oct-2001 - Nov-2016
1. a. Assume there is a wide-area network with N nodes, where N $ 2. What is the smallest number of point to point communication links such that every node in the network is able to talk to every other node? (Note: A network in which some nodes are unable to exchange messages with other nodes because there is no path between them is called disconnected.)
b. If you are worried about having a disconnected network, what type of interconnection structure should you use when configuring your network?
2. What happens to the store-and-forward protocol of if a packet M is repeatedly sent from node A to node B but never correctly arrives at B? (Perhaps the link from A to B is broken.) What modifications can we make to this protocol to handle this situation?
Hel-----------lo -----------Sir-----------/Ma-----------dam----------- Â----------- -----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------acq-----------uis-----------iti-----------on -----------of -----------my -----------sol-----------uti-----------on.-----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- ca-----------tch-----------