{"title":"Partial order transport service for multimedia applications: reliable service","authors":"P. Amer, T. J. Connolly, C. Chassot, M. Diaz","doi":"10.1109/HPDC.1993.263833","DOIUrl":null,"url":null,"abstract":"This paper introduces a partial order connection (POC) protocol. Motivated in particular by multimedia applications, POC is an end-to-end connection that provides a partial order service, that is, a service that requires some, but not all objects to be received in the order transmitted. This paper discusses R-PO, a reliable version of POC which requires that all transmitted objects are eventually delivered. A metric based on the number of linear extensions of a partial order in the presence of no lost objects is proposed to quantify different partial orders. Means for its calculation is presented when P can be modeled as a combination of sequential and/or parallel compositions of Petri-nets. This metric allows one to compare and evaluate the complexity of different partial order services.<<ETX>>","PeriodicalId":226280,"journal":{"name":"[1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPDC.1993.263833","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26
Abstract
This paper introduces a partial order connection (POC) protocol. Motivated in particular by multimedia applications, POC is an end-to-end connection that provides a partial order service, that is, a service that requires some, but not all objects to be received in the order transmitted. This paper discusses R-PO, a reliable version of POC which requires that all transmitted objects are eventually delivered. A metric based on the number of linear extensions of a partial order in the presence of no lost objects is proposed to quantify different partial orders. Means for its calculation is presented when P can be modeled as a combination of sequential and/or parallel compositions of Petri-nets. This metric allows one to compare and evaluate the complexity of different partial order services.<>