1 / 21

Solutions for Third Quiz

This article explores the process of how SSH authenticates a new server and evaluates its security. It also discusses the challenges and potential vulnerabilities in this process.

brettmurphy
Download Presentation

Solutions for Third Quiz

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Solutions forThird Quiz COSC 6360 Fall 2015

  2. First question How does SSH authenticate a new server? Is this process as secure as it should?

  3. First question How does SSH authenticate a new server? When the client contacts a server, the server replies with its public host key and its public server key. Client then decides to accept or reject these keys Is this process as secure as it should?

  4. First question How does SSH authenticate a new server? When client contacts a server, the server replies with its public host key and its public server key. Client decides to accept or reject these keys Is this process as secure as it should? No because clients rarely have the way to check the keys' authenticity

  5. Second question • Which steps will be taken by the Sprite LFS to retrieve a specific i-node when the system reboots after having been properly closed?

  6. Second question • Which steps will be taken by the Sprite LFS to retrieve a specific i-node when the system reboots after having been properly closed? • Access checkpoint areato get addresses of blocks of i-node map • Access i-node mapto get address of the i-node

  7. Third question • What is the cost of a write in the Sprite LFS system, when its segment cleaner has to clean four segments to produce two clean segments?

  8. Third question • What is the cost of a write in the Sprite LFS system, when its segment cleaner has to clean five segments to produce two clean segments? • Compute first segment utilization • U = (4 – 3)/4 = 0.75 • Apply formula • 2/(1-U) = 2/0.25 = 8

  9. Fourth question • According to Shah and Pâris, how should we modify BitTorrent tit-for-tat policy to let peers participate sooner in the video distribution?

  10. Fourth question • According to Shah and Pâris, how should we modify BitTorrent tit-for-tat policy to let peers participate sooner in the video distribution? • They proposed "a new randomized tit-for-tat peer selection policy that gives free tries to a larger number of peers and lets them participate sooner in the media distribution."

  11. Fifth question • What are the main advantage and the main disadvantage of using journaling with asynchronous log updates compared to using journaling with synchronous log updates?

  12. Fifth question • What are the main advantage and the main disadvantage of using journaling with asynchronous log updates compared to using journaling with synchronous log updates? • Main advantage: They are faster

  13. Fifth question • What are the main advantage and the main disadvantage of using journaling with asynchronous log updates compared to using journaling with synchronous log updates?) • Main advantage: They are faster • Main disadvantage: They do not guarantee the durability of updates

  14. Sixth question • What is the main motivation for tailpacking in journaling file systems?

  15. Sixth question • What is the main motivation for tailpacking in journaling file systems? • To save disk space by reducing internal fragmentation

  16. Seventh question • Consider a RAID level 6 disk array with ten disks? • How much of the total disk space is occupied by parity information? • Assume that we have to update a single data block in the array and already know the old value of the block being updated. How many disk reads and disk writes will be required to perform the update?

  17. Seventh question • Consider a RAID level 6 disk array with ten disks? • How much of the total disk space is occupied by parity information? • Each parity stripe will have ten disks • Eight of them will hold data • Two of them parity information • Twenty percent

  18. Seventh question • Consider a RAID level 6 disk array with ten disks. • Assume that we have to update a single data block in the array and already know the old value of the block being updated. How many disk reads and disk writes will be required to perform the update?

  19. The RAID level 6 array Equivalents of eight data disks Parity

  20. We update

  21. Seventh question • We will need to write to disk the new values of • The modified block B' • The modified parity blocks P' and Q' for a total of three writes • We already have in memory the old value B of the block but need to read in • The old values P and Q of the two parity blocks that is, two reads

More Related