Protocol stack of XML Web Services

Explain the protocol stack of XML Web Services.

E

Expert

Verified

Web service protocol stack is the protocol stack (that is, a stack of computer networking protocols) which is employed to define, locate, implement, and form Web services interact with one other. The Web service protocol stack usually stacks four protocols:

(Service) Transport Protocol: accountable for transporting messages among network applications and comprises protocols like HTTP, SMTP, FTP, and also the more recent Blocks Extensible Exchange Protocol (BEEP).

(XML) Messaging Protocol: accountable for encoding messages in a general XML format and hence they can be understood at either end of the network connection. Presently, this area comprises such protocols as XML-RPC, WS-Addressing, and SOAP.

(Service) Description Protocol: employed for explaining the public interface to a particular Web service. The WSDL interface format is usually utilized for this purpose.

(Service) Discovery Protocol: centralizes services into a general registry such that network Web services can publish their position and description, and makes it simple to discover what services are accessible on the network. Universal Description Discovery and Integration (abbreviated as UDDI) was intended for this aim, however it has not been broadly adopted.

   Related Questions in Programming Languages

  • Q : Describe the term Context Switch

    Describe the term Context Switch.

  • Q : What is Hash code Hash code : It is a

    Hash code: It is a value returned by a hash function. A hash code can be employed as an index into a random-access data structure, offering a proficient mapping between an object and its position. Employed by classes like HashMap.

  • Q : Define Swapping Swapping : An

    Swapping: An {operating system} is frequently able to run programs which need more memory than is physically accessible on the host system. In order to do this, the complete memory needed is broken down into smaller pieces that are swapped in whenever

  • Q : Explain LURCH LURCH (Menzies et al.

    LURCH (Menzies et al. 2004) uses random search to explore a state machine’s state space. Because the search is random, it gives no guarantee that the state space has been exhaustively explored, so LURCH cannot be used for verification. However,

  • Q : One-time signature scheme Define

    Define one-time signature scheme?

  • Q : Rings present in CPU What do you mean

    What do you mean by rings present in CPU?

  • Q : Define the term Punctuation Define the

    Define the term Punctuation: Symbols like commas and semicolons that a compiler employs to understand the structure of the program.

  • Q : State the term GPC and GPT State the

    State the term GPC and GPT.

  • Q : What is HSB Color Model HSB Color Model

    HSB Color Model: A color model based on symbolizing a color as 3-components: hue, saturation and brightness. This is at times termed as the HSV color model - hue, saturation and value.

  • Q : What is an Attribute Attribute : It is

    Attribute: It is a particular usage of an instance variable. The set of attribute values held in a specific instance of a class state the current state of that instance. A class definition might impose specific constraints on the valid states of its i

©TutorsGlobe All rights reserved 2022-2023.