KOPS - The Institutional Repository of the University of Konstanz

On Parallelising and Optimising the Implementation of Communication Protocols

On Parallelising and Optimising the Implementation of Communication Protocols

Cite This

Files in this item

Checksum: MD5:5d723afcb632eca91fa93d3a042578b5

LEUE, Stefan, Philippe OECHSLIN, 1996. On Parallelising and Optimising the Implementation of Communication Protocols. In: IEEE ACM Transactions on Networking. 4(1), pp. 55-70. Available under: doi: 10.1109/90.503762

@article{Leue1996Paral-5448, title={On Parallelising and Optimising the Implementation of Communication Protocols}, year={1996}, doi={10.1109/90.503762}, number={1}, volume={4}, journal={IEEE ACM Transactions on Networking}, pages={55--70}, author={Leue, Stefan and Oechslin, Philippe} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5448"> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:31Z</dcterms:available> <dcterms:abstract xml:lang="eng">We present a method for the automatic derivation of efficient protocol implenlentations from a formal specification. Optimised efficient protocol implementation has become an important issue in telecommunications systems engineering as recently network throughput has increased mnch faster than computer processing power. Efficiency will be attained by two measures. First, the inherent parallelism in protocol specifications will be exploited. Second, the order of execution of the operations involved in the processing of the protocol data will be allowed to differ from the order prescribed in the specification, thus allowing operations to be executed jointly and more efficiently. The method will be defined formally which is useful when implementing it as a tool.</dcterms:abstract> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5448"/> <dcterms:title>On Parallelising and Optimising the Implementation of Communication Protocols</dcterms:title> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:rights>terms-of-use</dc:rights> <dc:format>application/pdf</dc:format> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5448/1/On_Parallelising_and_Optimising_the_Implementation_of_Communication_Protocols.pdf"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:31Z</dc:date> <dcterms:issued>1996</dcterms:issued> <dcterms:bibliographicCitation>First publ. in: IEEE ACM Transactions on Networking 4 (1996), 1, pp. 55-70</dcterms:bibliographicCitation> <dc:creator>Leue, Stefan</dc:creator> <dc:creator>Oechslin, Philippe</dc:creator> <dc:language>eng</dc:language> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5448/1/On_Parallelising_and_Optimising_the_Implementation_of_Communication_Protocols.pdf"/> <dc:contributor>Oechslin, Philippe</dc:contributor> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dc:contributor>Leue, Stefan</dc:contributor> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

On_Parallelising_and_Optimising_the_Implementation_of_Communication_Protocols.pdf 127

This item appears in the following Collection(s)

terms-of-use Except where otherwise noted, this item's license is described as terms-of-use

Search KOPS


Browse

My Account