1 / 14

Lecture 18 – March 26, 2002

This lecture covers synthetic criteria for evaluating network traffic patterns in open systems, including the service overlay model, active network model, and active media model. It discusses the limitations of the client-server paradigm, resource management, resource discovery, epidemic algorithms, gossiping algorithms, resource leasing, and resource virtualization. The lecture also explores distributed object systems and different approaches for implementing them.

lbrice
Télécharger la présentation

Lecture 18 – March 26, 2002

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. Lecture 18 – March 26, 2002 • Synthetic criteria for evaluation of network traffic patterns. • Open systems.

  2. Open Systems • Open systems…… • Service overlay model  services are introduced at the edge of the virtual infrastructure supported by the Internet. • The active network model  programmable network infrastructure. • Active media model  media carries along the code necessary to transform the data.

  3. Is the client-server paradigm sufficient? • RPC limitations. • The client is expected to know • The interface presented by the server • The exact location of the server • The delay to get a response is low and client may wait for it. • The servers are stateless no provisions for reliability. • In an open system • The client may not know • The location of the server • The API to invoke the service • We have a resource-rich environment thus • Reliability can be guranteed • QoS guarantess are possible

  4. Resource Management in an Open System • Multiple administrative domains. • Scalability of resource management. • Impossibility to know accurately the state of all resources.

  5. Resource Discovery • Active mechanisms  Directory or lookup services. • Server register with the service at startup time. • What happens when the server fails? • Leasing of resources. • May not be up to date. • Passive mechanisms  Gossiping based upon epidemic algorithms

  6. Epidemic Algorithms • Population of fixed size – n. • Deterministic model  the rate of change is proportional to: • The size of the group infected  Y(t) • The size of the group still healthy  n-Y(t). Y(t)’ = K Y(t) [ n – Y(t) ] Y(t) = n / [ 1 + (n-1) e –knt ]

  7. Gossiping Algorithms • Performance measures • Running time • Pointer communication complexity – number of pointers exchanged. • Connection communication complexity – total number of connections between pairs of entities. • Flooding • Swamping • Name-dropper.

  8. Resource Leasing

  9. Resource Virtualization • Resource virtualization  abstraction of resources • Operating Systems • Virtual Memory • Virtual Machine • Socket • Open Systems • Higher Level abstractions • Fuzzy resource specification

  10. Objects • Objects are instances of abstract data types called classes. • Inheritance • Extended class • Evolution • Sharing • Serialization • Persistency

  11. Network Objects Require Higher Levels of Abstractions • Interfaces exposed by objects are language and system dependent. • RPC are ill suited for distributed object applications; e.g. big endian versus little endian representations. • Socket level programming is cumbersome.

  12. Approaches for distributed object systems • Accommodate the status quo  CORBA • Ab initio – design a new platform that is architecture neutral  Java

More Related