Persistent Link:
http://hdl.handle.net/10150/186386
Title:
A language-based approach to protocol implementation.
Author:
Abbott, Mark Bert.
Issue Date:
1993
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
This thesis explores two strategies for supporting the development of network communication software: imposing constraints on protocol design at the specification level, and using a special-purpose language for protocol implementation. It presents a protocol implementation language called Morpheus. Morpheus utilizes the new strategies to provide a higher level of abstraction, finer grain modularity, and greater software reusability than previous approaches. Morpheus is able to provide a high level of abstraction because of built-in knowledge about its problem domain. It has a narrow problem domain--network protocols--that is further narrowed by the application of specification-level constraints. One particular constraint--the shapes constraint, which partitions protocols into three basic kinds--is particularly effective in raising the level of abstraction. Morpheus's support for modularity and, indirectly, software reuse hinges on reducing the performance penalty for layering. When protocol layering entails a high performance cost, developers are motivated to build complex monolithic implementations that are hard to design, implement, debug, modify, and maintain. Morpheus reduces the performance costs of layering by applying optimizations based on common patterns of protocol execution. If the degree of modularity is held fixed, then the optimizations simply improve performance. An optimization based on Integrated Layer Processing is particularly noteworthy for its dramatic contribution to network throughput while preserving modularity.
Type:
text; Dissertation-Reproduction (electronic)
Keywords:
Computer network protocols.; Computer science.
Degree Name:
Ph.D.
Degree Level:
doctoral
Degree Program:
Computer Science; Graduate College
Degree Grantor:
University of Arizona
Committee Chair:
Peterson, Larry

Full metadata record

DC FieldValue Language
dc.language.isoenen_US
dc.titleA language-based approach to protocol implementation.en_US
dc.creatorAbbott, Mark Bert.en_US
dc.contributor.authorAbbott, Mark Bert.en_US
dc.date.issued1993en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractThis thesis explores two strategies for supporting the development of network communication software: imposing constraints on protocol design at the specification level, and using a special-purpose language for protocol implementation. It presents a protocol implementation language called Morpheus. Morpheus utilizes the new strategies to provide a higher level of abstraction, finer grain modularity, and greater software reusability than previous approaches. Morpheus is able to provide a high level of abstraction because of built-in knowledge about its problem domain. It has a narrow problem domain--network protocols--that is further narrowed by the application of specification-level constraints. One particular constraint--the shapes constraint, which partitions protocols into three basic kinds--is particularly effective in raising the level of abstraction. Morpheus's support for modularity and, indirectly, software reuse hinges on reducing the performance penalty for layering. When protocol layering entails a high performance cost, developers are motivated to build complex monolithic implementations that are hard to design, implement, debug, modify, and maintain. Morpheus reduces the performance costs of layering by applying optimizations based on common patterns of protocol execution. If the degree of modularity is held fixed, then the optimizations simply improve performance. An optimization based on Integrated Layer Processing is particularly noteworthy for its dramatic contribution to network throughput while preserving modularity.en_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
dc.subjectComputer network protocols.en_US
dc.subjectComputer science.en_US
thesis.degree.namePh.D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineComputer Scienceen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.chairPeterson, Larryen_US
dc.contributor.committeememberBailey, Maryen_US
dc.contributor.committeememberSchlicting, Richarden_US
dc.identifier.proquest9408463en_US
dc.identifier.oclc704412005en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.