Skip to main content

gRPC - General Purpose Remote Procedure Call

Google has developed gRPC in 2015 and released it for the world to use. gRPC has been evolved from Stubby,  which Google has been using for all internal communication. 

gRPC is open-sourced high-performance RPC framework. It efficiently connects services across machines with pluggable support for load balancing, authentication, monitoring. It supports a wide range of programming language and it can be developed and deployed fast. Microservices architecture does support gRPC communication over service mesh and pretty efficient over REST. 

  • Client libraries in 10 programming languages. gRPC Languages
  • Bidirectional streaming and http/2 supported.
  • pluggable load balancing, auth and monitoring. 
  • Request response and streaming support are available.
  • Strongly typed message definition using Protobuf. 



gRPC work like a client-server model. The client will call the framework generated stub (client) to make a service request on a different machine. The server will take the request, execute the service code to handle the request and send back the response object. All this data comes in binary coded and proven to be efficient. 





Concept Diagram

Reference: grpc.io


gRPC uses IDL (interface definition language) using protobuf. Protobub is Google developed serializing framework.  Check here protocol-buffers. A .proto file will be generated to define message and service. Once generated we need to generate server and client code in our preferred language using protoc compiler. Compilers will generate client stub and server code in your prefered language and you can define service from there. 

Sample greeting.proto file 

// The greeter service definition.
service Greeter {
  // Sends a greeting
  rpc SayHello (HelloRequest) returns (HelloReply) {}
}

// The request message containing the user's name.
message HelloRequest {
  string name = 1;
}

// The response message containing the greetings
message HelloReply {
  string message = 1;
}


Implementation Types:

1. Unary RPC

This work like a simple client request-response model. The client sends a request and server send the response and closes the RPC call. 
  rpc SayHello (HelloRequest) returns (HelloReply) {}


2. Server Streaming RPC

The client sends a request and the server will send a list of responses. The server will end the RPC call with metadata. Order of response will be maintained for a single RPC call. 

  rpc ListofHelloReplies(HelloRequest) returns (stream HelloReply) {}

3. Client Streaming RPC

The client will be sending multiple request messages to the server and once requests are exhausted, the server will be sending a single response for it. 
  rpc ListofHelloMessages (stream HelloRequest) returns (HelloReply) {}

4. Bidirectional streaming RPC

The client will be sending multiple request messages to the server and the server can choose to start responding or it can wait for all the request. In response to a series of request, the server will also be sending a series of response messages. 
  rpc BidirectionHelloMessageandReply (stream HelloRequest) returns (stream HelloReply) {}




Synchronous and Asynchronous: A service request call wait for the response and does nothing is an asynchronous call. An asynchronous call, the client will not be waiting for the response and will start working on other calls. Both the flavours can be implemented based on the requirement. 



Labels:

Comments

Post a Comment

Popular posts from this blog

[PUZZLE] ELEPHANT AND BANANA PUZZLE

A merchant has bough some 3000 banana from market and want to bring them to his home which is 1000 km far from Market. He have a elephant which can carry maximum of 1000/- banana at time. That could have been easy but this elephant is very shrewd and he charges 1 banana for every one kilometer he travel. Now we have to maximise number of banana which should reach to home. Solution: At present we are at 0th km with 3000 banana and elephant. Lets see if elephant have to shift all the 3000 banana and elephant by 1 km. For 1 km shift: Take first 1000 banana and drop at 1st km. 2 banana consumed. One banana each for to and fro. Second  1000 banana and drop at 1st km. 2 banana consumed. Third 1000 banana and reach at 1st km. 1 banana consumed. So all in all total 5 banana will be consumed if we shift a kilometer. But that's not all, our total banana number are also reducing so we may have to reduce the number of turns too. And this will happen once we have reduced the b...
Post a Comment
Read more

Multi Factor Authentication

How to make sure User A is User A as he claims, not User a. Our old movies smugglers can teach us a few tricks here. There are multiple levels or factor of authentication. 1. First Factor - Something you only know. It's like a secret pin, key, pattern or password.     In the old movie, there used to be a secret code between smugglers.  Parties involved in the transaction only knows this secret code. 2. Second Factor - Something you only own. It's like the ATM card, phone, device or OTP.      In the old movies, smugglers used torn currency note. Both parties will have one part.  One party need to show ownership of half of the torn currency note to receive goods from another party. 3.  Third Factor - Something you are. It's related to your physical appearance. Like your face, your thumb impression or voice. Your personal physical traits will be used to identify you.      Remember hero duplicates being used to catch smuggl...
Post a Comment
Read more

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part
3 comments
Read more