Based On Event-driven Service-oriented Computing Model

Being one of the primary projects of the current academic world and software trade, loosely coupled, coarse-grained, place and transmission protocol reveal of SOA's most important feature to render the application system to change with changing demands. But with the increasing of enterprises transaction and clients'demands towards efficiency and intelligence, the traditional system of SOA fails to meet the needs. Meanwhile, such problems as low degree of loosely coupled, and failure in cooperation, dynamic calculation and all-round perception prevent the fulfillment of SOA based upon request/response. As a matter of fact, Event driven Architecture is applicable to solve the above mentioned problems.From this perspective of SOA and EDA, the paper devises a software model ED-SOCM (event driven-service oriented computing model) followed a deep research on cooperative perception, dynamic calculation and resolving of complicated events.The paper analyses the calculation of oriented Service, followed by the analysis on the current SOA, the relevant technology of Web service and some merits of web service in realizing SOA.The paper offers profound analysis and discussion on the current system of event-driven, on the basis of which both advantages and disadvantages of EDA and SOA. Designed a software model ED-SOCM by means of the complementary relationship of the above two architectures.An introduction to the realization of the software model ED-SOCM, the analysis of its functions result in the hands-on application of the model on the net drug store is described, and the relevant safety is also discussed.The software model put forth in the paper proves to support any event driven, which may meet such demands as, loosely coupled communication, cooperating requirements and the resolving of complicated events as to guarantee more powerfully the current dynamic, changing, and large-scale distribution of computers environments, therefore, it will prove to be very promising.