Kuvempu University M.Sc. (IT)-4th Semester MSIT-42 Distributed Computin (DC) M!" M!

r#s$ %&

'ssi nment T'

(ote$ ')) *uestions !re Compu)sory 1. Select any case study of distributed application. Survey the case study with respect to distributed computing aspects. Analyze and understand applicability of distributed computing. - 10M 2. Select any case study of distributed application. Survey the case study with respect to challenges of distributed computing aspects. Analyze challenges li e heterogeneity! openness! security! scalability! failure handling and concurrency. - 10M

". #onduct a detailed study on commercially e$isting middleware products used in distributed environments.10M %. #onduct a detailed study on commercially e$isting firewalls products used in distributed environments. 10M

&. Select 2 case studies based on centralized and distributed system applications respectively. Analyze and understand applicability of distributed and centralized systems in detail. 10M

Kuvempu University M.Sc. (IT)-4th Semester MSIT-42 Distributed Computin (DC)

'ssi nment T+
,'-T - '
I. .i)) in the b)!n#s$ 1' Mobile computing is also called as pervasive computing. 2' (he two inds of system models are )))))))))))) and ))))))))))))))))) "' *M+ stands for Object Management Group %' ,#*M stands for Distributed Component Object Model &' User D!t! r!m ,rotoco) is the e$pansion for -,. /' 0. addressing has .ive number of classes. 1' Soc ets are software abstractions of ,orts used within running processes. 2' 3ava provides Three basic soc et classes. 4' (he e$panded form of 5M0 is Remote Method Invocation 10' ,6S stands for Distributed .i)e System 11' 6iles are an abstraction of ,erm!nent storage. 12' 7ardware activities are co-ordinated using ,hysic!) cloc s. 1"' 8$ternal synchronization is also nown as ,u)) Mode) 1%' A transaction run on Sh!red entities. 1&' A So/t0!re cloc is maintained by the operating system from the hardware cloc . II. St!te True or .!)se$ 1' 5esource sharing is an advantage of distributed system True 2' -,. is a connection oriented protocol. .!)se 9 it is connectionless .rotocol' "' 5outing metrics are used to measure the efficiency of the routing algorithm. True %' #lient programs should see uniform name same in location transparency. True &' :ector cloc gives more accurate logical cloc when compared to ;amporte logical cloc . III. 'ns0er the /o))o0in 1uestions$ 1' <hat is distributed system= 'ns$ A distributed system is one in which components located at networ ed computers communicate and co-ordinate their actions only by passing messages! ,istributed System is the interactions between two or more computer-based devices connected in some fashion. (his is a rapidly e$panding field! which deals with two primary issues> how do the devices communicate! and how do they interact. (he former issue re?uires some networ and communications software! and the latter re?uires some distributed software that allows the components on the two or more devices interact in some manner 2 $ - @etwor of wor stations - ,istributed manufacturing system 9e.g.! automated assembly line' - @etwor of branch office computers

- (he 0nternet - An intranet - Mobile and ubi?uitous computing 2' Mention the subareas of middleware. Ans> -e/)ective Midd)e0!re 5eflective middleware is concerned with applying techni?ues from the field of reflection in order to achieve fle$ibility and adaptability in middleware platforms 2vent-+!sed Midd)e0!re 8vent-based middleware is concerned with the concepts! design! implementation! and application of services and components that support building event-based systems 3b4ect-3riented Midd)e0!re *bAect-oriented middleware e$tends the obAect-oriented programming paradigm to distributed systems Mess! e-3riented Midd)e0!re Message-oriented middleware is the natural e$tension of the pac et paradigm of communications prevalent in the lower layers of the *S0 networ model 2' <hat is data marshalling= 'ns$ Marshalling is the process of ta ing a collection of data items and assembling them into a form suitable for transmission in a message. -n-marshalling is the complementary process of reassembling the data structure at the destination. 7eterogeneity means that data formats at the two ends of communication may not agree. (he problem is overcome by using an e$ternal data representation format such as #*5BACs #,5 or S-@ @6SCs D,5. (he transmission format need not be binary> 7((. uses AS#00 te$t "' <hat is client-server communication= 'ns$ #lientEserver communication re?uires some form of re?uest F reply protocol %' <hat is group communication= 'ns> Multicast is the term used to denote communication to a predefined group of processes and is used when it is more appropriate to send a message to a group than to processes individually. 0t is closely lin ed to replication! which may be used to enhance reliability andEor performance

,'-T - + 1. a' 8$plain the properties of distributed system. Ans> 5.%.5 (!min (he names that are assigned to resources or obAects must have global meanings. <e want names to be independent of the locations of the actual obAect they refer to. <e will need to support a name interpretation system that can translate names in the order to enable programs to access the named resources! which itself is a distributed application that provides services that must scale and translate efficiently! so that the same name wor s everywhere. 5.%.2 'ccess Access here refers to the ability for the same services and A.0s to be usable everywhere and have reasonable performance. 6or e$ample cc invo es # compiler on any platform or operating system. +lobal access also includes some idea of data coherence. 5.%.6 Communic!tion (he performance and reliability of the communication techni?ues used to implement distributed systems are critical to their performance. A design issue is! therefore! obviously to optimize the implementation of the communication protocols! whilst attempting to retain a relatively high-level of abstraction of application programming interface 9A.0'. 5.%.4 So/t0!re Structure A number of eys issues relate to software structure. (hese issues range from openness! which is achieved through the design and construction of software components with well defined! an open! interfaces. *ne overriding issue is the design of an overarching e$tensible framewor that allows new services be introduced that can fully inter-wor with e$isting services without duplicating e$isting services. 5.%.% -esource M!n! ement <e are concerned with the deployment of the processing and communication resources in the networ to optimum effect for processing a dynamically changing wor load. 7ere the issues of interest are resource management and scheduling. <e want to load the processing! communications and other infrastructure fairly between the users. 5.%.7 Consistency M!inten!nce ,istributed information and data means that the maintenance of consistency in the distributed system is important. #onsistency will be of concern when there is concurrent access to data! where data is replicated for fault tolerant purposes! cached for performance! and mirrored for high availability. #onsistency also refers to time and user interfaces. 5.%.8 Security Security is a basic building of all distributed systems. #lassic security concerns deal more with data>
Confidentiality data only available to those authorized, Availability you can get it when you want it, Integrity data has not been changed. Trust who you are and what you are authorized to do Non-repudiation you cannot deny doing so ething you did

Additional concerns deal more with people and transactions>

Auditability I can chec! what you did to the data "eliability the syste does what I want, when I want it to or what I do.

#rivacy within certain li its no one should !now who I a

b' 8$plain different challenges that should be considered while designing a distributed system. 2. a' 8$plain any two types of architectural models. (here are " types of architectural models - #lient-Server! .eer process #lient GServer Model >- 5efer to page 12! 2.2.1 .eer process > - 5efer page 20! 2.2.% b' 8$plain different types of fundamental models. Ans> 6-@,AM8@(A; M*,8;S A model contains only the essential ingredients that we need to consider in-order to understand and reason out some of the aspects of a systemCs behavior. (he aspects of distributed systems that we wish to capture in our fundamental models are intended to help us to discus and reason about> Inter!ction mode)> #omputation occurs within the processesH the processes interact by passing messages! resulting in communication 9i.e. information flow' and coordination 9synchronization and ordering of activities' between processes. 0n the analysis and design of distributed systems we are concerned especially with these interactions. .!i)ure mode)$ (he correct operation of a distributed system is threatened whenever a fault occurs in any of the computers on which it runs 9including software faults' or in the networ that connects them. *ur model defines and classifies the faults. Security mode)> (he modular nature of distributed systems and their openness e$poses them to attac by both e$ternal and internal agents. ". a' 8$plain the differences between static and dynamic routing Ans> St!tic routin Static routing is not really a routing protocol. Static routing is simply the process of manually entering routes into a deviceIs routing table via a configuration file that is loaded when the routing device starts up. As an alternative! these routes can be entered by a networ administrator who configures the routes manually. Since these manually configured routes donIt change after they are configured 9unless a human changes them' they are called IstaticI routes. Static routing is the simplest form of routing! but it is a manual process. -se static routing when you have very few devices to configure 9J&' and when you now the routes will probably never change or rarely change.

Static routing also does not handle failures in e$ternal networ s well because any route that is configured manually must be updated or reconfigured manually to fi$ or repair any lost connectivity.

Dyn!mic -outin ,ynamic routing protocols are supported by software applications running on the routing device 9the router' which dynamically learn networ destinations and how to get to them and also advertise those destinations to other routers. (his advertisement function allows all the routers to learn about all the destination networ s that e$ist and how to to those networ s. A router using dynamic routing will IlearnI the routes to all networ s that are directly connected to the device. @e$t! the router will learn routes from other routers that run the same routing protocol 950.! 50.2! 80+5.! *S.6! 0S-0S! B+. etc'. 8ach router will then sort through its list of routes and select one or more IbestI routes for each networ destination the router nows or has learned. ,ynamic routing protocols will then distribute this Ibest routeI information to other routers running the same routing protocol! thereby e$tending the information on what networ s e$ist and can be reached. (his gives dynamic routing protocols the ability to adapt to logical networ topology changes! e?uipment failures or networ outages Ion the flyI b' 8$plain any two routing algorithms. %. a' ;ist out the advantages and disadvantages of ,6S. 'ns$ (he files are more widely available since many computers can access the servers! and sharing the files from a single location is easier than distributing copies of files to individual clients. Bac ups and safety of the information are easier to arrange since only the servers need to be bac ed up. (he servers can provide large storage space! which might be costly or impractical to supply to every client. (he usefulness of a distributed file system becomes clear when considering a group of employees sharing documents. 7owever! more is possible. 6or e$ample! sharing application software is an e?ually good candidate. 0n both cases system administration becomes easier. (here are many problems facing the design of a good distributed file system! ,isadvantages (ransporting many files over the net can easily create sluggish performance and latencyH networ bottlenec s and server overload can result.

 (he security of data is another important issue> how can we be sure that a client is really authorized to have access to information and how can we prevent data being sniffed off the networ (wo further problems facing the design are related to failures. *ften client computers are more reliable than the networ connecting them and networ failures can render a client useless. Similarly a server failure can be very unpleasant! since it can disable all clients from accessing crucial information. b' Mention and describe the various operations performed on -@0D files. ==== &. a' 8$plain different types of synchronization. Ans> External Synchronization(,u)) Mode)): A cloc is e$ternally synchronized if it has been synchronized with an authoritative e$ternal source of time 9a -(# source'. A system is e$ternally synchronized if all cloc s within it are e$ternally synchronized.
0n this model! clients re?uest the -(# from a time server. (he time server is passive. Assuming that the networ traffic is symmetrical! the best estimate for one-way propagation time is 9(ime1 - (ime0 (ime. 'E2. (he accuracy of this estimate can be calculated if the minimum propagation time is nown. (his is a suitable techni?ue when the roundtrip times between client and server are short compared with the desired accuracy.
.i ure 8.6 Christi!n9s !) orithm: ,! e number 56%

#ompensating for #loc ,rift After the client receives the -(#! it needs to adAust its local cloc gradually. (here are two possibilities> ;ocal cloc faster than -(# (ime cannot go bac ward! #loc speed is slowed down by software. 6or e$ample! interrupt routine adds only 4 milliseconds to the software cloc if it was normally adding 10 milliseconds before. ;ocal cloc is slower than -(# 0ncrease cloc speed @ote that abrupt changes could cause problems. 0t is important to maintain monotonicity. Internal Synchronization(Push Model) $ A system is internally synchronized if the cloc s within it are synchronized with one another to a nown degree of accuracy. 6or an @ processor system! with cloc s # i ! i K 1! . . . @ ! and e$ternal time source S! e$ternal synchronization can be e$pressed as LS9t' -# i 9t'L J ,! for i K 1! . . . ! @ whereas internal synchronization is e$pressed as L# i 9t' - # A 9t'L J ,! for i! A K 1! . . . ! @ An internally synchronized system is not necessarily e$ternally synchronized! since the cloc s may show collective drift. 7owever an e$ternally synchronized system will be internally synchronized. 0n this model! the time server is active. 0t polls every machine whose cloc s need to be synchronized. +er#e)ey !) orithm

1. (he time daemon of the time server announces to other machines its time and as s for their local times. 2. (he machines respond to the time daemon and tell how far ahead or behind they are from the time of the daemon. ". (he time daemon computes the average and tells each machine how to adAust their cloc s. #onsistency of (ime Servers (ime servers is susceptible to inconsistencies in their -(#s due to communication delays. 0n order to reduce the discrepancy between their -(#s! time servers e$change their -(#s periodically by using pull or push models and collect -(#s from other serversH and by using a previously agreed decision criterion they adAust their own -(#. 6or e$ample by ta ing the average of the -(#s they have collected. 0n order to achieve higher accuracy! time servers may report an interval of time 9-(# M indicator of inaccuracy' and the averaging procedure can be modified to ta e this into account.

b' 8$plain mutual e$clusion and the ey properties of distributed mutual e$clusion. Ans> (he mutual e$clusion problem is the problem of managing access to a shared resource 9data! software or hardware'! which can support only one process at a time 0n a distributed system mutual e$clusion needs to be achieved by means of message passing between processes.
(he ey properties of a useful mutual e$clusion algorithm are> S!/ety> At most one process may e$ecute in the critical section at a time. ;iveness> 5e?uests to enter and e$it the critical section eventually succeed. (his implies freedom from deadloc and starvation. 3rderin > 0f one re?uests to enter the critical section happened-before another then entry to the critical section is granted in that order. <e will see that most algorithms satisfy the first two conditions but not all satisfy the ordering property. .erformance of the algorithms is also an important issue and is generally Audged in terms of the number of messages needed for a process to gain access to the critical section. (he throughput at the critical section will be determined by the synchronization delay> the delay between one process leaving the critical section and the ne$t entering

/. a' 8$plain the A#0, properties in detail. Ans> Atomicity> a transaction must be all or nothing! i.e. to the rest of the system a transaction should appear as an indivisible action! even in the presence of failures. Consistency> A transaction ta es the system from one consistent state to another consistent state! i.e. the transaction does not violate system invariantsH Isolation> when several transactions are e$ecuted concurrently! the intermediate effects of a transaction are not visible to other transactions! i.e. transactions cannot interfere with one anotherH Durability> once a transaction has committed its effects cannot be cancelled by the e$ecution of an uncommitted transaction even in the presence of failures

b' 8$plain the problems of > i' ;ost upd!te prob)em> <ithout proper concurrency control the operations of one transaction may mas the operations of another. 6or e$ample in this ban ing e$ample -Cs update of account B is lost because ( overwrites it ii' Seri!))y e1uiv!)ent inter)e!vin > A serially e?uivalent interleaving has the same effect as if two transactions were performed one after the other. 0f each individual transaction is correct then we can assume that performing one after the other is correct! and thus that the serial interleaving is correct. Re er !a"e number #$# 1. a' 8$plain different types of distributed transactions. -e/er to ,! e 5%7 - 5%8 b' 8$plain two-phase commit .rotocol. -e/er to ,! e 5%8 2. a' 8$plain distributed deadloc with an e$ample. -e/er to ,! e 57& b' 8$plain distributed deadloc detection edge chasing algorithm. -e/er to ,! e 575

$$$$$$$