Based on queuing theory we develop analytical approximations for the average packet transfer time of a store-and-forward and a cutthrough buffer insertion ring with two client traffic priorities. These types of rings are architectural alternatives for resilient packet rings (RPR) which transport data (e.g., IP) packets over optical media. We use the approximations for a delay comparison of both...

Telecardiology provides remote delayed interpretation of echocardiographic images through a store and forward program between the interpreting center, Tripler Army Medical Center, Honolulu Hawaii, and the image acquisition center, Guam Naval Hospital, Guam USA. This routine store and forward system has inherent delay, limiting application for management of acute medical conditions. In this case...

any features in modern networks have their roots in technologies developed for the Internet. The recent concept of network coding is an exception; and goes beyond traditional forwarding of immutable packets, viewing network operation instead as flows of information that can be operated on mathematically within the network. In particular, network nodes may perform mathematical operations across ...

0 Two problems relevant to the design of a store-and-forward communication network (the message routing problem and the channel capacity assignment problem) are formulated and are recognized to be essentially non-linear, uncomtAcUmd multicommodity (m.c.) flow problems. A "Flow Deviation" (FD) method for the solution of these non-linear, unconstrained m.c. flow problems is described which is qui...

The advent of the Internet as a major communication channel has triggered a great deal of interest in real-time communication over packet-switched networks. While store and forward networks such as the Internet were not originally designed to handle real-time traffic, now that this global communication infrastructure exists and is becoming ubiquitous. Computer-based hardware and software subsys...

In many networked embedded systems, crucial factors for correct functionality are the network’s real-time capability, determinism, and reliability. Besides these requirements, a high network performance in terms of throughput and latency is desired. One of the applied techniques to improve performance is cut-through communication. It allows to forward messages as soon as the packet header is pr...

We prove (mostly tight) space lower bounds for “streaming” (or “on-line”) computations of four fundamental combinatorial objects: error-correcting codes, universal hash functions, extractors, and dispersers. Streaming computations for these objects are motivated algorithmically by massive data set applications and complexity-theoretically by pseudorandomness and derandomization for spacebounded...