In a discussion over at Sam Ruby‘s blog and on his “Distributed state machines” post, Robert Sayre made a random thought which I find intriguing.
In a service-oriented world, like that promoted by MEST, where integration between services happens through metadata-sharing about the services’ messaging behaviours (described in languages like SSDL), could such route-finding algorithms have a place? As interactions become more complex and simple protocol blocks become the building blocks of larger composites, could we employ such an algorithm in order to determine how applications are composed? Of course semantics will have to play a key role here.
The building blocks (the protocols) will have to be semantically described. A semantics-based categorisation will have to be created; this will represent the map. Semantic differences, usage costs, QoS requirements, etc. could become the obstacles in the map. The target will represent the semantics of the composite application. The route to the target will represent those protocols that can be composed in order to build the new composite behaviour. The choice of protocols would have only been based on semantic descriptions.
As I said… random thoughts.
There’s a unique energy that comes with starting something new — a blend of excitement,…
As I continued work on BrainExpanded and its MCP service, I came to realize that…
Just over a month ago, I published "Playing with graphs and Neo4j". Back then, it…
After my initial implementation of some BrainExpanded-related ideas on top of dgraph using its GraphQL…
Say hello to the Graph Model Domain Specific Language (GMDSL), created with the help of…
As I wrote in previous posts, the manual recording of memories for BrainExpanded is just…