mpm + protocol   97

Differences between gRPC and RSocket]
In general, gRPC and RSocket attempt to solve different problems. gRPC is an RPC framework using HTTP/2. RSocket is useful.
rsocket  protocol 
october 2019 by mpm
A Performance Comparison of Different Backoff Algorithms under Different Rebroadcast Probabilities for MANET's
The backoff algorithm is a part of Media Access Control (MAC) protocol which used to avoid collision in the Mobile Ad hoc Network (MANET). When the nodes in the network try to access the channel, one of these nodes gains access the channel while the other nodes still contend for a time period. Many backoff algorithms have been proposed to improve network performance. One of these algorithms is Fibonacci increment backoff (FIB), FIB algorithm achieves higher throughput than the exponential backoff that is used by the standard IEEE 802.11 when it used in a mobile ad hoc network. The Pessimistic Linear-exponential Backoff (PLEB) is another proposed backoff algorithm which uses a combination of two increment behaviors; Exponential backoff and Linear backoff this scheme merges the advantages of the two increment behaviors. Exponential increments give enough backoff time to enhance the network throughput by reducing the number of transmission failures, and the linear increment reduces the average packet delay. Ad hoc On demand Distance Vector (AODV) routing protocol use a demand-driven route establishment procedure. AODV maintain the route table at each node. This paper uses different backoff algorithms at different values of rebroadcast probability.
backpressure  protocol 
august 2019 by mpm
Delta-t Protocol Specification
Delta-t logically supports a permanent, reliable, flow controlled, full duplex, labeled bit stream connection between two ports. There is no extra packet exchange overhead to reliably manage connection state as in other stream oriented protocols. Therefore Delta-t can support an efficient, low delay, minimum packet exchange, reliable transaction oriented service as well as high stream throughput.
june 2019 by mpm
It’s Time to Move on from Two Phase Commit
In my opinion we need to remove veto power from workers and architect systems in which the system does not have freedom to abort a transaction
database  protocol  consistency 
may 2019 by mpm
Application Layer Transport Security
The ALTS trust model has been tailored for cloud-like containerized applications. Identities are bound to entities instead of to a specific server name or host. This trust model facilitates seamless microservice replication, load balancing, and rescheduling across hosts
authentication  authorization  protocol  confidentiality 
may 2019 by mpm
Fitting Square Pegs Through Round Pipes: Unordered Delivery Wire-Compatible with TCP and TLS
Internet applications increasingly employ TCP not as a stream abstraction, but as a substrate for application-level transports, a use that converts TCP's in-order semantics from a convenience blessing to a performance curse. As Internet evolution makes TCP's use as a substrate likely to grow, we offer Minion, an architecture for backward-compatible out-of-order delivery atop TCP and TLS. Small OS API extensions allow applications to manage TCP's send buffer and to receive TCP segments out-of-order. Atop these extensions, Minion builds application-level protocols offering true unordered datagram delivery, within streams preserving strict wire-compatibility with unsecured or TLS-secured TCP connections. Minion's protocols can run on unmodified TCP stacks, but benefit incrementally when either endpoint is upgraded, for a backward-compatible deployment path. Experiments suggest that Minion can noticeably improve performance of applications such as conferencing, virtual private networking, and web browsing, while incurring minimal CPU or bandwidth costs.
networking  protocol 
may 2019 by mpm
gRPC On HTTP/2: Engineering A Robust, High Performance Protocol
In this article, we’ll look at how gRPC builds on HTTP/2’s long-lived connections to create a performant, robust platform for inter-service communication. gRPC is a high-performance, open-source universal RPC framework. We will explore the relationship between gRPC and HTTP/2, how gRPC manages HTTP/2 connections, and how gRPC uses HTTP/2 to keep connections alive, healthy, and utilized.
http  networking  protocol 
december 2018 by mpm
Provide a way for researchers and engineers to quickly generate ASCII RFC-like header diagrams for their own custom protocols.
diagram  protocol  documentation 
november 2018 by mpm
Scuttlebutt Protocol Guide
Scuttlebutt is a protocol for building decentralized applications that work well offline and that no one person can control. Because there is no central server, Scuttlebutt clients connect to their peers to exchange information. This guide describes the protocols used to communicate within the Scuttlebutt network.
p2p  protocol  discovery  service-location  membership  gossip 
november 2018 by mpm
Stable and Consistent Membership at Scale with Rapid
We present the design and evaluation of Rapid, a distributed membership service. At Rapid’s core is a scheme for multi-process cut detection (CD) that revolves around two key insights: (i) it suspects a failure of a process only after alerts arrive from multiple sources, and (ii) when a group of processes experience problems, it detects failures of the entire group, rather than conclude about each process individually. Implementing these insights translates into a simple membership algorithm with low communication overhead.
overlay  membership  protocol  gossip 
october 2018 by mpm
Rapid is a scalable distributed membership service
We present Rapid, a scalable, distributed membership system that is stable in the face of a diverse range of failure scenarios, and provides participating processes a strongly consistent view of the system's membership.
membership  gossip  protocol  cluster  overlay 
october 2018 by mpm
Datacenter Traffic Control: Understanding Techniques and Trade-offs
Datacenters provide cost-effective and flexible access to scalable compute and storage resources necessary for today's cloud computing needs. A typical datacenter is made up of thousands of servers connected with a large network and usually managed by one operator. To provide quality access to the variety of applications and services hosted on datacenters and maximize performance, it deems necessary to use datacenter networks effectively and efficiently. Datacenter traffic is often a mix of several classes with different priorities and requirements. This includes user-generated interactive traffic, traffic with deadlines, and long-running traffic. To this end, custom transport protocols and traffic management techniques have been developed to improve datacenter network performance. In this tutorial paper, we review the general architecture of datacenter networks, various topologies proposed for them, their traffic properties, general traffic control challenges in datacenters and general traffic control objectives. The purpose of this paper is to bring out the important characteristics of traffic control in datacenters and not to survey all existing solutions (as it is virtually impossible due to massive body of existing research). We hope to provide readers with a wide range of options and factors while considering a variety of traffic control mechanisms. We discuss various characteristics of datacenter traffic control including management schemes, transmission control, traffic shaping, prioritization, load balancing, multipathing, and traffic scheduling. Next, we point to several open challenges as well as new and interesting networking paradigms. At the end of this paper, we briefly review inter-datacenter networks that connect geographically dispersed datacenters which have been receiving increasing attention recently and pose interesting and novel research problems.
protocol  networking 
february 2018 by mpm
DCCast: Efficient Point to Multipoint Transfers Across Datacenters
Using multiple datacenters allows for higher availability, load balancing and reduced latency to customers of cloud services. To distribute multiple copies of data, cloud providers depend on inter-datacenter WANs that ought to be used efficiently considering their limited capacity and the ever-increasing data demands. In this paper, we focus on applications that transfer objects from one datacenter to several datacenters over dedicated inter-datacenter networks. We present DCCast, a centralized Point to Multi-Point (P2MP) algorithm that uses forwarding trees to efficiently deliver an object from a source datacenter to required destination datacenters. With low computational overhead, DCCast selects forwarding trees that minimize bandwidth usage and balance load across all links. With simulation experiments on Google's GScale network, we show that DCCast can reduce total bandwidth usage and tail Transfer Completion Times (TCT) by up to 50% compared to delivering the same objects via independent point-to-point (P2P) transfers.
networking  alm  protocol 
february 2018 by mpm
QuickCast: Fast and Efficient Inter-Datacenter Transfers using Forwarding Tree Cohorts
Large inter-datacenter transfers are crucial for cloud service efficiency and are increasingly used by organizations that have dedicated wide area networks between datacenters. A recent work uses multicast forwarding trees to reduce the bandwidth needs and improve completion times of point-to-multipoint transfers. Using a single forwarding tree per transfer, however, leads to poor performance because the slowest receiver dictates the completion time for all receivers. Using multiple forwarding trees per transfer alleviates this concern--the average receiver could finish early; however, if done naively, bandwidth usage would also increase and it is apriori unclear how best to partition receivers, how to construct the multiple trees and how to determine the rate and schedule of flows on these trees. This paper presents QuickCast, a first solution to these problems. Using simulations on real-world network topologies, we see that QuickCast can speed up the average receiver's completion time by as much as 10× while only using 1.04× more bandwidth; further, the completion time for all receivers also improves by as much as 1.6× faster at high loads.
alm  networking  protocol 
february 2018 by mpm
Partisan is a flexible, TCP-based membership system for Erlang/Elixir
protocol  erlang  membership 
february 2018 by mpm
Seamless Paxos Coordinators
The Paxos algorithm requires a single correct coordinator process to operate. After a failure, the replacement of the coordinator may lead to a temporary unavailability of the application implemented atop Paxos. So far, this unavailability has been addressed by reducing the coordinator replacement rate through the use of stable coordinator selection algorithms. We have observed that the cost of recovery of the newly elected coordinator's state is at the core of this unavailability problem. In this paper we present a new technique to manage coordinator replacement that allows the recovery to occur concurrently with new consensus rounds. Experimental results show that our seamless approach effectively solves the temporary unavailability problem, its adoption entails uninterrupted execution of the application. Our solution removes the restriction that the occurrence of coordinator replacements is something to be avoided, allowing the decoupling of the application execution from the accuracy of the mechanism used to choose a coordinator. This result increases the performance of the application even in the presence of failures, it is of special importance to the autonomous operation of replicated applications that have to adapt to varying network conditions and partial failures.
paxos  consensus  protocol 
december 2017 by mpm
AllConcur: Leaderless Concurrent Atomic Broadcast
Many distributed systems require coordination between the components involved. With the steady growth of such systems, the probability of failures increases, which necessitates scalable fault-tolerant agreement protocols. The most common practical agreement protocol, for such scenarios, is leader-based atomic broadcast. In this work, we propose AllConcur, a distributed system that provides agreement through a leaderless concurrent atomic broadcast algorithm, thus, not suffering from the bottleneck of a central coordinator. In AllConcur, all components exchange messages concurrently through a logical overlay network that employs early termination to minimize the agreement latency. Our implementation of AllConcur supports standard sockets-based TCP as well as high-performance InfiniBand Verbs communications. AllConcur can handle up to 135 million requests per second and achieves 17x higher throughput than today's standard leader-based protocols, such as Libpaxos. Thus, AllConcur is highly competitive with regard to existing solutions and, due to its decentralized approach, enables hitherto unattainable system designs in a variety of fields.
broadcast  protocol 
november 2017 by mpm
Things we (finally) know about network queues
How big should your queue be, and what should you do when it fills up? Many times, we implement or even deploy a networking system before we have answered those questions. Luckily, recent research has given us some guidelines. Here's what we know
queuing  protocol 
august 2017 by mpm
A Publish/Subscribe System Using Causal Broadcast Over Dynamically Built Spanning Trees
In this paper we present VCube-PS, a topic-based Publish/Subscribe system built on the top of a virtual hypercube-like topology. Membership information and published messages to subscribers (members) of a topic group are broadcast over dynamically built spanning trees rooted at the message's source. For a given topic, delivery of published messages respects causal order. Performance results of experiments conducted on the PeerSim simulator confirm the efficiency of VCube-PS in terms of scalability, latency, number, and size of messages when compared to a single rooted, not dynamically, tree built approach
alm  protocol  broadcast  causal  consistency 
july 2017 by mpm
Lifeguard : SWIM-ing with Situational Awareness
we define a set of extensions to SWIM that allow a member to dynamically adjust its timeouts to mitigate timeliness issues. We call these extensions Lifeguard
protocol  gossip 
july 2017 by mpm
BBR, the new kid on the TCP block
BBR is very similar to TCP Vegas, in that it is attempting to operate the TCP session at the point of onset of queuing at the path bottleneck. The specific issues being addressed by BBR is that the determination of both the underlying bottleneck available bandwidth and path RTT is influenced by a number of factors in addition to the data being passed through the network for this particular flow, and once BBR has determined its sustainable capacity for the flow, it attempts to actively defend it in order to prevent it from being crowded out by the concurrent operation of conventional AIMD protocols.
networking  tcp  protocol  performance 
may 2017 by mpm
Strobe protocol framework
Strobe is a new framework for cryptographic protocols. It can also be used for regular encryption. Its goals are to make cryptographic protocols much simpler to develop, deploy and analyze; and to fit into even tiny IoT devices
protocol  confidentiality  integrity 
january 2017 by mpm
Noise Protocol Framework
Noise is a framework for building crypto protocols. Noise protocols support mutual and optional authentication, identity hiding, forward secrecy, zero round-trip encryption, and other advanced features
confidentiality  protocol 
january 2017 by mpm
Wingtips is a distributed tracing solution for Java based on the Google Dapper paper.
java  managability  protocol  observability 
december 2016 by mpm
BBR: Congestion-Based Congestion Control
Today TCP's loss-based congestion control is the primary cause of these problems. When bottleneck buffers are large, loss-based congestion control keeps them full, causing bufferbloat. When bottleneck buffers are small, loss-based congestion control misinterprets loss as a signal of congestion, leading to low throughput. Fixing these problems requires an alternative to loss-based congestion control
networking  performance  protocol 
december 2016 by mpm
WireShark-Specific Dissector Language
protocol  observability  lua 
october 2016 by mpm
tcp_bbr: add BBR congestion control
Anew TCP congestion control algorithm: BBR
(Bottleneck Bandwidth and RTT)
tcp  protocol  networking 
september 2016 by mpm
TCP Puzzlers
These are questions that are very simple to articulate, but the solutions are often surprising. And rather than focusing on arcane details, they hopefully elucidate some deep principles about how TCP works
tcp  protocol 
august 2016 by mpm
RFC3339 - Date and Time on the Internet: Timestamps
The following section defines a profile of ISO 8601 for use on the Internet. It is a conformant subset of the ISO 8601 extended format. Simplicity is achieved by making most fields and punctuation mandatory.
time  parser  protocol 
august 2016 by mpm
Multiplexing on top of TCP
Some messaging technologies (e.g. AMQP) allow for multiplexing several data streams on top of a single TCP connection
networking  protocol  tcp 
july 2016 by mpm
Sprout is a transport protocol for interactive applications that desire high throughput and low delay
protocol  networking 
july 2016 by mpm
RFC 5166 - Metrics for the Evaluation of Congestion Control Mechanisms
This document discusses the metrics to be considered in an evaluation of new or modified congestion control mechanisms for the Internet
networking  protocol  testing 
july 2016 by mpm
TCP Friendly Rate Control (TFRC)
TFRC is a congestion control mechanism for unicast flows operating in a best-effort Internet environment. It is reasonably fair when competing for bandwidth with TCP flows
networking  tcp  protocol 
june 2016 by mpm
Tng: Transport Next Generation
We are developing a new transport service architecture that decomposes "true" end-to-end transport functions such as reliable packet delivery and security from middlebox-relevant functions such as endpoint naming and congestion control.
networking  tcp  protocol 
april 2016 by mpm
fbtftp is Facebook's implementation of a dynamic TFTP server framework
python  protocol 
april 2016 by mpm
WebSocket++ is an open source (BSD license) header only C++ library that impliments RFC6455 The WebSocket Protocol. It allows integrating WebSocket client and server functionality into C++ programs
c++  protocol 
march 2016 by mpm
AMQP as a Network Protocol
The Advanced Message Queueing Protocol (AMQP) is usually discussed in the context of message queueing systems since it was designed as a protocol for messaging and indeed has the word “Queueing” in its name.  AMQP is, however, a general-purpose networking protocol that has real advantages over HTTP for service and API delivery
messaging  protocol 
december 2015 by mpm
The Harmful Consequences of Postel's Maxim
Jon Postel's famous statement in RFC 1122 of "Be liberal in what you accept, and conservative in what you send" - is a principle that has long guided the design of Internet protocols and implementations of those protocols. The posture this statement advocates might promote interoperability in the short term, but that short term advantage is outweighed by negative consequences that affect the long term maintenance of a protocol and its ecosystem
networking  protocol 
november 2015 by mpm
This repository is sources and dependencies extracted from Chromium's QUIC Implementation with a few modifications and patches to minimize dependencies needed to build QUIC library
march 2015 by mpm
http2 explained
This document describes the protocol HTTP/2 at a technical and protocol level. Background, the protocol, the implementations and the future
http  protocol 
february 2015 by mpm
Resettable Vector Clocks
Vector clocks (VC) are an inherent component of a rich class of distributed applications. In this paper, we consider the problem of realistic -- more specically, bounded-space and fault-tolerant -- implementation of these client applications. To this end, we generalize the notion of VC to resettable vector clocks (RVC), and provide a realistic implementation of RVC. Further, we identify an interface contract under which our RVC implementation can be substituted for VC in client applications, without aecting the client's correctness. Based on such substitution, we show how to transform the client so that it is itself realistically implemented; we demonstrate our method in the context of Ricart-Agrawala's mutual exclusion program
time  protocol 
january 2015 by mpm
RFC 4340 - Datagram Congestion Control Protocol (DCCP)
The Datagram Congestion Control Protocol (DCCP) is a transport protocol that provides bidirectional unicast connections of congestion-controlled unreliable datagrams. DCCP is suitable for applications that transfer fairly large amounts of data and that can benefit from control over the tradeoff between timeliness and reliability.
networking  protocol  udp 
august 2014 by mpm
Precision Time Protocol
The Precision Time Protocol, as defined in the IEEE-1588 standard, provides a method to precisely synchronize computers over a Local Area Network (LAN). PTP is capable of synchronizing multiple clocks to better than 100 nanoseconds on a network specifically designed for IEEE-1588. A Network Time Server with PTP is typically referred to as an “IEEE-1588 Grandmaster” or “PTP Grandmaster”. This paper describes basic principles of PTP, information on using dual Grandmasters, and the requirements of the network to achieve sub-100 nanosecond time synchronization.
time  protocol 
february 2014 by mpm
Protocol Overhead
How fast can you really go using a given media and protocol stack? We examine how much bandwidth is left for applications
networking  protocol  performance 
january 2014 by mpm
On Barriers and the Gap between Active and Passive Replication
Active replication is commonly built on top of the atomic broadcast primitive. Passive replication, which has been recently used in the popular ZooKeeper coordination system, can be naturally built on top of the primary-order atomic broadcast primitive. Passive replication differs from active replication in that it requires processes to cross a barrier before they become primaries and start broadcasting messages. In this paper, we propose a barrier function tau that explains and encapsulates the...
replication  protocol 
october 2013 by mpm
Concise Binary Object Representation (CBOR)
The Concise Binary Object Representation (CBOR) is a data format whose design goals include the possibility of extremely small code size, fairly small message size, and extensibility without the need for version negotiation. These design goals make it different from earlier binary serializations such as ASN.1 and MessagePack.
october 2013 by mpm
Cap'n Proto
Cap’n Proto is an insanely fast data interchange format and capability-based RPC system. Think JSON, except binary. Or think Protocol Buffers, except faster
protocol  messaging 
april 2013 by mpm
nanomsg library is a high-performance implementation of several "scalability protocols". Scalability protocol's job is to define how multiple applications communicate to form a single distributed application
messaging  protocol 
february 2013 by mpm
The Blink Protocol
The Blink Protocol is a standardized method for defining how to exchange messages in and between systems. Blink makes it easy for people to define what information to exchange and how. It also eliminates friction in the communications machinery.
protocol  messaging 
january 2013 by mpm
A Survey of Rollback-Recovery Protocols in Message-Passing Systems
This survey covers rollback-recovery techniques that do not require special language constructs. In the first part of the survey we classify rollback-recovery protocols into checkpoint-based and log-based
messaging  consistency  protocol 
january 2013 by mpm
ZooKeeper's atomic broadcast protocol: Theory and practice
We study the design of this protocol, highlight promised properties, and analyze its offcial implementation by Apache. In particular, the default leader election protocol is studied in detail.
zookeeper  protocol 
november 2012 by mpm
GEMS: Gossip-Enabled Monitoring Service for Scalable Heterogeneous Distributed Systems
We present experiments and analytical projections demonstrating scalability, fast response times and low resource utilization requirements, making GEMS a potent solution for resource monitoring in distributed computing
gossip  protocol  monitoring 
november 2012 by mpm
Indicating Details of Problems to Machines in HTTP
This specification defines a "Problem Detail" as an extensible way to carry machine-readable details of errors in a response, to avoid the need to invent new response formats.
http  rest  protocol  mime 
july 2012 by mpm
JSON Hypertext Application Language
This document proposes a media type for representing resources with hyperlinks
rest  protocol 
june 2012 by mpm
uTP is a TCP-like implementation of LEDBAT documented as a BitTorrent extension in BEP-29. uTP provides provides reliable, ordered delivery while maintaining minimum extra delay. It is implemented on top of UDP to be cross-platform and functional today. As a result, uTP is the primary transport for uTorrent peer-to-peer connections.
networking  protocol  c++ 
may 2012 by mpm
Mosquitto is an open source (BSD licensed) message broker that implements the MQ Telemetry Transport protocol version 3.1.
protocol  messaging 
april 2012 by mpm
Structured Stream Transport
Structured Stream Transport (SST) enhances the traditional stream abstraction with a hierarchical hereditary structure,allowing applications to create lightweight child streams from any existing stream.
protocol  networking 
march 2012 by mpm
Deprecating Use of the "X-" Prefix in Application Protocols
Historically, designers and implementers of application protocols have often distinguished between "standard" and "non-standard" parameters by prefixing the latter with the string "X-" or similar constructions. In practice, this convention causes more problems than it solves. Therefore, this document deprecates the "X-" convention for most application protocol parameters.
february 2012 by mpm
Client Puzzles: A Cryptographic Countermeasure Against Connection Depletion Attacks
When a server comes under attack, it distributes small cryptographic puzzles to clients making service requests. To complete its request, a client must solve its puzzle correctly
availability  protocol  networking 
august 2011 by mpm
Password Authenticated Key Exchange by Juggling
Password Authenticated Key Exchange by Juggling (J-PAKE), achieves mutual au-thentication in two steps: first, two parties send ephemeral public keys to each other; second, they encrypt the shared password by juggling the public keys in a verifiable way
confidentiality  integrity  protocol  networking 
august 2011 by mpm
Test Anything Protocol
The Test Anything Protocol (TAP) is a protocol to allow communication between unit tests and a test harness. It allows individual tests (TAP producers) to communicate test results to the testing harness in a language-agnostic way
testing  protocol  parser 
august 2011 by mpm
RELP - The Reliable Event Logging Protocol
This is the specification for the reliable event logging protocol, called "RELP".
event  logging  protocol 
august 2011 by mpm
"Smile" is a binary data format that defines a binary equivalent of standard JSON data format.
july 2011 by mpm
Design and Validation of Computer Protocols
The first part of the book gives the reader an overview of the types of fundamental coordination problems that a protocol designer must be able to recognize. It covers the basics of error control, flow control, and protocol structuring, and presents ten basic rules of protocol design. Part two covers protocol specification and modeling techniques, and introduced the notion of a protocol validation model. Part three gives an overview of protocol synthesis, conformance testing, manual and automated protocol validation techniques. In the final part of the book a detailed description is given of a set of tools that can be used to attack the protocol design problem in a rigorous and practical manner
book  distributed  protocol 
april 2011 by mpm
TNetStrings stand for a "tagged netstrings" and are a modification of Dan Bernstein's netstrings specification to allow for the same data structures as JSON but in a format that meets these requirements:
protocol  parser 
april 2011 by mpm
Simulator for message passing protocols, supporting (really) unfair process scheduling and dropped messages
protocol  testing  networking  erlang 
april 2011 by mpm
swift is a multiparty transport protocol. Its mission is to disseminate content among a swarm of peers. It might be understood as BitTorrent at the transport layer
networking  p2p  protocol 
march 2011 by mpm
bin­ary-en­coded seri­al­iz­a­tion of JSON-like doc­u­ments
february 2011 by mpm
MQ Telemetry Transport
The MQTT protocol enables a publish/subscribe messaging model in an extremely lightweight way. It is useful for connections with remote locations where a small code footprint is required and/or network bandwidth is at a premium
messaging  protocol  event 
february 2011 by mpm
A new wire protocol enabling applications to connect directly in a real-time and fully distributed manner
dht  distributed  protocol 
january 2011 by mpm
Parsing text and binary files with Erlang
There is a way to describe reading and writing of structured data and generally save ourselves time and typing
erlang  parser  protocol 
december 2010 by mpm
SRM (Scalable Reliable Multicast)
SRM is a framework for reliable multicast that is still in progress, with areas such as local recovery, congestion control, and ADU naming still under investigation
protocol  scalability 
may 2010 by mpm
iPhone HTTP Streaming with FFMpeg and an Open Source Segmenter
I've put together a cheat sheet on how I went about building a static stream using FFMpeg and an example segmenter that someone has posted.
http  protocol 
april 2010 by mpm
MessagePack is a binary-based efficient object serialization library
march 2010 by mpm
BERT and BERT-RPC 1.0 Specification
BERT and BERT-RPC are an attempt to specify a flexible binary serialization and RPC protocol that are compatible with the philosophies of dynamic languages such as Ruby, Python, PERL, JavaScript, Erlang, Lua, etc. BERT aims to be as simple as possible while maintaining support for the advanced data types we have come to know and love. BERT-RPC is designed to work seamlessly within a dynamic/agile development workflow. The BERT-RPC philosophy is to eliminate extraneous type checking, IDL specification, and code generation. This frees the developer to actually get things done.
erlang  rpc  protocol 
october 2009 by mpm
UDT: Breaking the Data Transfer Bottleneck
UDT is a reliable UDP based application level data transport protocol for distributed data intensive applications over wide area high-speed networks
protocol  networking  performance 
october 2009 by mpm
A simple, open, server-to-server web-hook-based pubsub (publish/subscribe) protocol as an extension to Atom (and RSS).
protocol  messaging  http  event 
september 2009 by mpm
extensible binary protocols for cross-language communication and long-term serialization edit
protocol  rpc 
august 2009 by mpm
« earlier      
per page:    204080120160

Copy this bookmark: