On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future?
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms
| Hi-index | 0.00 |
Packet Alloying, a technique for the optimized bundling of packets, is proposed. It produces aggregations that preserve the internal Protocol Data Unit (PDU) format, allowing the resulting packets to be subjected to further bundling or compression by conventional techniques. Using logs from vignettes simulated by the OneSAF Testbed Baseline (OTB), a simulator is used to analyze PDU traffic over a wireless flying Local Area Network aboard airplanes, including a satellite and a ground station. Applying Packet Alloying during the simulation of an example vignette, a reduction in the magnitude of negative slack time from -75 to -9 seconds for the worst spike was achieved. Contributions of this research include the formalization of a selective PDU bundling scheme, and the study of different predictive algorithms for the next PDU. These results demonstrate the validity of packet optimizations for distributed simulation environments and other possible applications such as TCP/IP transmissions.