多媒体应用的部分订单传输服务:可靠的服务

P. Amer, T. J. Connolly, C. Chassot, M. Diaz
{"title":"多媒体应用的部分订单传输服务:可靠的服务","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":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1993-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"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\":null,\"pages\":null},\"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}","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

摘要

介绍了一种部分顺序连接(POC)协议。在多媒体应用程序的推动下,POC是一种提供部分顺序服务的端到端连接,也就是说,这种服务需要按照传输的顺序接收一些对象,但不是所有对象。本文讨论了一种可靠的POC版本R-PO,它要求所有传输的对象最终都被交付。提出了一种基于不存在丢失对象的偏阶线性扩展数的度量来量化不同的偏阶。当P可以建模为petri网的顺序和/或并行组合时,给出了其计算方法。这个度量允许人们比较和评估不同的偏序服务的复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Partial order transport service for multimedia applications: reliable service
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.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A methodology for evaluating load balancing algorithms A message passing interface for parallel and distributed computing Distributed computing systems and checkpointing DARTS-a dynamically adaptable transport service suitable for high speed networks p4-Linda: a portable implementation of Linda
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1