{"title":"移动系统中随机顺序的信息传递","authors":"S. Alagar, S. Venkatesan","doi":"10.1109/MCSA.1994.513478","DOIUrl":null,"url":null,"abstract":"There is a growing trend in using mobile computing environments for several applications, and it is important that such mobile systems are provided with adequate support both at the systems level and at the communication level. Causal ordering is a useful property, particularly in applications that involve human interactions. We present three algorithms for causal ordering in mobile systems. The first algorithm handles the resource constraints of the mobile hosts. But the system is not easily scalable and is not graceful in hosting disconnections and connections. The second algorithm eliminates the above disadvantages at the cost of inhibiting some messages. The third algorithm is a trade-off between the first two algorithms.","PeriodicalId":88972,"journal":{"name":"Proceedings. IEEE Workshop on Mobile Computing Systems and Applications","volume":"1 1","pages":"169-174"},"PeriodicalIF":0.0000,"publicationDate":"1994-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Causally ordered message delivery in mobile systems\",\"authors\":\"S. Alagar, S. Venkatesan\",\"doi\":\"10.1109/MCSA.1994.513478\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There is a growing trend in using mobile computing environments for several applications, and it is important that such mobile systems are provided with adequate support both at the systems level and at the communication level. Causal ordering is a useful property, particularly in applications that involve human interactions. We present three algorithms for causal ordering in mobile systems. The first algorithm handles the resource constraints of the mobile hosts. But the system is not easily scalable and is not graceful in hosting disconnections and connections. The second algorithm eliminates the above disadvantages at the cost of inhibiting some messages. The third algorithm is a trade-off between the first two algorithms.\",\"PeriodicalId\":88972,\"journal\":{\"name\":\"Proceedings. IEEE Workshop on Mobile Computing Systems and Applications\",\"volume\":\"1 1\",\"pages\":\"169-174\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IEEE Workshop on Mobile Computing Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MCSA.1994.513478\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE Workshop on Mobile Computing Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MCSA.1994.513478","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Causally ordered message delivery in mobile systems
There is a growing trend in using mobile computing environments for several applications, and it is important that such mobile systems are provided with adequate support both at the systems level and at the communication level. Causal ordering is a useful property, particularly in applications that involve human interactions. We present three algorithms for causal ordering in mobile systems. The first algorithm handles the resource constraints of the mobile hosts. But the system is not easily scalable and is not graceful in hosting disconnections and connections. The second algorithm eliminates the above disadvantages at the cost of inhibiting some messages. The third algorithm is a trade-off between the first two algorithms.