Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Modern networks are not implemented as a single piece of software; that would render the task of dealing with multiple technologies and manufacturers virtually impossible. The solution for this problem is to structure computer networks as stacks of different protocols. A protocol can be seen as a "language" in which two entities (computers, routers, etc) communicate with each other. Typically, one protocol is created to solve a predetermined set of networking tasks, such as being able to send ?xed-length messages, or guaranteeing message order, etc. The capability of a protocol to solve these tasks makes it a "black box" that can be used by protocols on the level immediately above; similarly, the protocol itself can make use of the capabilities provided by the protocol on the level immediately below. Thus, all modern networks are implemented as a stack of abstractions, all of which are implemented as composable protocols; we say that the layer N provides services to layer N+1 and uses the services from layer N-1.
As an example, consider the stack presented in Figure in this example we show how the HTTP protocol (or, similarly, SMTP and ssh) can be implemented using the services provided by the TCP protocol. Also, the TCP protocol is implemented using the services of the IP layer, which itself uses the services provided by the Ethernet layer. Notice that one advantage of this type of architecture is that if we were to build a new functionality (say, wireless connections, instead of Ethernet), it would suf?ce for us to implement this new layer and to guarantee that it provides, to the IP level, the same services that were once provided by the Ethernet level. Nowhere would we need to care about the details of TCP, HTTP, or, for that matter, any of the top-level protocols.
Question: (a) The following table (table 1.0) gives the length of the CPU burst time in milliseconds of processes P 1 to P 4 . Assume the processes arrived in the order P 1 ,
Q. What merit is there in having different time-quantum sizes on different levels of a multilevel queuing system? Answer: Processes that require more frequent servicing for ins
define semaphore. how can we use semaphore to deal with n-process critical section problem.
Define properties of Time sharing operating system Time sharing:- T his systems uses CPU scheduling and multiprogramming to provide economical interactive use of a system. The
What are the different methods for handling deadlocks? Deadlock detection and recovery: Permit the system to enter a deadlock state, detect it and after that rec
FIXED PARTITIONING In a fixed partitioning, the operating system inhabiting some fixed portion of main memory is available for use of multiple processes -Using fixed partit
Explain about deadlock detection? In deadlock situation, the system must provide An algorithm that verifies the state of the system to verify whether a deadlock has occu
What is scheduler? A process migrates among the various scheduling queues throughout its life time. The OS must choose processes from these queues in some fashion. This selecti
What is meant by arm-stickiness? If one or a few processes have a high access rate to data on single track of a storage disk, then they might be monopolizing the device by repe
Compare contiguous-memory allocation with pure paging in the following aspects: 1. In support of dynamic memory allocation: most systems allow programs to allocate more memory t
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd