发布求助
文献互助 智能选刊 最新文献

24th International Conference on Distributed Computing Systems, 2004. Proceedings.最新文献

筛选
英文 中文
Group digital assistant: combined or shared PDA screen 群组数字助理:组合或共享PDA屏幕
24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281636
J. Munemori, T. Noda, T. Yoshino
{"title":"Group digital assistant: combined or shared PDA screen","authors":"J. Munemori, T. Noda, T. Yoshino","doi":"10.1109/ICDCS.2004.1281636","DOIUrl":"https://doi.org/10.1109/ICDCS.2004.1281636","url":null,"abstract":"We propose a new concept of a combined and a shared screen for new small devices called GDA (group digital assistant). In GDA, the screens of two PDAs can be treated just as one screen in combination view mode and can be shared in sharing view mode. GDA uses a wireless LAN and Bluetooth for radio communication. We have developed application software for an idea generation support system on GDA and experimented in cooperative work for evaluation. We found that functions of GDA were effective in actual cooperative work. The concept of GDA can permit usage of a cellular phone and a PDA in the next generation.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126190150","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Self-healing workflow systems under attacks 受到攻击的自修复工作流系统
24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281607
Meng Yu, Peng Liu, Wanyu Zang
{"title":"Self-healing workflow systems under attacks","authors":"Meng Yu, Peng Liu, Wanyu Zang","doi":"10.1109/ICDCS.2004.1281607","DOIUrl":"https://doi.org/10.1109/ICDCS.2004.1281607","url":null,"abstract":"Workflow systems are popular in daily business processing. Since vulnerability cannot be totally removed from a workflow management system, successful attacks always happen and may inject malicious tasks or incorrect data into the workflow system. Referring to the incorrect data further corrupt more data objects in the system, which comprises the integrity level of the system. This problem cannot be efficiently solved by existing defense mechanisms, such as access control, intrusion detection, and checkpoints. In this paper, we propose a practical solution for online attack recovery of workflows. The recovery system discovers all damages caused by the malicious tasks that the intrusion detection system reports and automatically repairs the damages based on data and control dependencies among workflow tasks. We analyze the behaviors of our attack recovery system based on the continuous time Markov chain model. The analytical results demonstrate that our system is practical when the parameters of the system are reasonably designed.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127700185","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 38
Distributed network monitoring for evolving IP networks 面向演进IP网络的分布式网络监控
24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281639
M. Thottan, Erran L. Li, Bin Yao, V. Mirrokni, S. Paul
{"title":"Distributed network monitoring for evolving IP networks","authors":"M. Thottan, Erran L. Li, Bin Yao, V. Mirrokni, S. Paul","doi":"10.1109/ICDCS.2004.1281639","DOIUrl":"https://doi.org/10.1109/ICDCS.2004.1281639","url":null,"abstract":"Evolving monitoring infrastructure in response to network growth is a critical aspect of network management. Previous work in network management primarily focused on optimizing monitoring systems for static networks. In this paper, we address the problem of optimally upgrading the existing monitoring infrastructure as the network evolves. The problem formulation presented here captures the trade off between adding new monitoring resources vs. disrupting the existing infrastructure. We show that this problem is NP hard and not approximable within a factor better than n/sup /spl epsi// in the general case and no better than log(n) when only shortest paths are considered. We develop a heuristic algorithm and evaluate its performance using simulated network evolution scenarios. We show that in spite of not allowing poller relocation, our adaptive online algorithm has comparable performance to that of the offline algorithm where such constraint does not exist.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130450504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Selection of mobile agents 移动代理的选择
24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281615
I. Satoh
{"title":"Selection of mobile agents","authors":"I. Satoh","doi":"10.1109/ICDCS.2004.1281615","DOIUrl":"https://doi.org/10.1109/ICDCS.2004.1281615","url":null,"abstract":"When a task is assigned to mobile agents, those suitable to perform the task need to be selected according to, not only their application-specific behaviors, but also their mobilities. The focus of current research, however, is on the development of execution platforms and applications for mobile agents and not on methodologies for selection of mobile agents. We present a general approach to selecting mobile agents according to their itineraries among multiple hosts. The approach offers a process algebra-based language for formally specifying the itineraries of mobile agents and an algebraic order relation between two itineraries specified as terms of the language. The relation can strictly decide whether or not the itineraries of mobile agents can satisfy the itinerary required by a given task, in the sense that the agents can migrate to all the hosts required by the task in the permissible order specified by the task. A prototype implementation of this approach was constructed on a Java-based mobile agent system. It enables each mobile agent to specify its itinerary as a term of the language and to migrate over a network according to only the itinerary. Also, when it receives a task request from its external environment, it can select a suitable mobile agent to perform the task by using the order relation. We also describe its implementation and a practical application.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129705824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 27
Loop-free routing using a dense label set in wireless networks 无线网络中使用密集标签集的无环路路由
24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281603
M. Mosko, J. Garcia-Luna-Aceves
{"title":"Loop-free routing using a dense label set in wireless networks","authors":"M. Mosko, J. Garcia-Luna-Aceves","doi":"10.1109/ICDCS.2004.1281603","DOIUrl":"https://doi.org/10.1109/ICDCS.2004.1281603","url":null,"abstract":"We present a new class of on-demand routing protocols called split label routing (SLR). The protocols guarantee loop-freedom at every instant by ensuring that node labels are always in topological order, and thus induce a directed acyclic graph (DAG). The novel feature of SLR is that it uses a dense ordinal set with a strict partial order to label nodes. For any two labels there is always some label in between them. This allows SLR to \"insert\" a node in to an existing DAG, without the need to relabel predecessors. SLR inherently provides multiple paths to destinations. We present a practical, finitely dense implementation that uses a destination-controlled sequence number. The sequence number functions as a reset to node ordering when no more label splits are possible. The sequence number is changed only by the destination. Simulations show that our proposed protocol outperforms existing state-of-the-art on-demand routing protocols.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114304738","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
ACT: an adaptive CORBA template to support unanticipated adaptation ACT:一个自适应CORBA模板，支持意外的自适应
24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281570
S. M. Sadjadi, P. McKinley
{"title":"ACT: an adaptive CORBA template to support unanticipated adaptation","authors":"S. M. Sadjadi, P. McKinley","doi":"10.1109/ICDCS.2004.1281570","DOIUrl":"https://doi.org/10.1109/ICDCS.2004.1281570","url":null,"abstract":"We propose an Adaptive CORBA Template (ACT), which enables run-time improvements to CORBA applications in response to unanticipated changes in either their functional requirements or their execution environments. ACT enhances CORBA applications by transparently weaving adaptive code into their object request brokers (ORBs) at run time. The woven code intercepts and adapts the requests, replies, and exceptions that pass through the ORBs. Specifically, ACT can be used to develop an object-oriented framework in any language that supports dynamic loading of code and can be applied to any CORBA ORB that supports portable interceptors. Moreover, ACT can be used to support interoperation among otherwise incompatible adaptive CORBA frameworks. To evaluate the performance and functionality of ACT, we implemented a prototype in Java. Our experimental results show that the overhead introduced by the ACT infrastructure is negligible, while the adaptations offered are highly flexible.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114921020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 75
Multi-layer active queue management and congestion control for scalable video streaming 可扩展视频流的多层主动队列管理和拥塞控制
24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281645
Seong-ryong Kang, Yueping Zhang, Min Dai, D. Loguinov
{"title":"Multi-layer active queue management and congestion control for scalable video streaming","authors":"Seong-ryong Kang, Yueping Zhang, Min Dai, D. Loguinov","doi":"10.1109/ICDCS.2004.1281645","DOIUrl":"https://doi.org/10.1109/ICDCS.2004.1281645","url":null,"abstract":"Video streaming is becoming an increasingly important part of the present Internet. To guarantee a high-quality streaming environment to end users, many video applications require a strict form of network QoS that is not available in the present Internet. Thus, to supplement the best-effort model of existing networks, we study a new video streaming framework that allows applications to mark their own packets with different priority and use multiqueue congestion control inside routers to effectively drop the less-important packets during buffer overflows. We describe priority AQM algorithms that provide \"optimal\" performance to video applications under arbitrary network loss and study a variation of Kelly's congestion control in combination with our framework. We call the combined architecture PELS - partitioned enhancement layer streaming.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124086892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 24
An incentive mechanism for P2P networks P2P网络的激励机制
24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281618
Richard T. B. Ma, Sam C. M. Lee, John C.S. Lui, David K. Y. Yau
{"title":"An incentive mechanism for P2P networks","authors":"Richard T. B. Ma, Sam C. M. Lee, John C.S. Lui, David K. Y. Yau","doi":"10.1109/ICDCS.2004.1281618","DOIUrl":"https://doi.org/10.1109/ICDCS.2004.1281618","url":null,"abstract":"The current peer-to-peer (P2P) information sharing paradigm does not provide incentive and service differentiation for users. Since there is no motivation to share information or resources, this leads to the \"free-riding\" and the \"tragedy of the commons\" problems. We address how one can incorporate incentive into the P2P information sharing paradigm so as to encourage users to share information and resources. Our mechanism (or protocol) provides service differentiation to users with different contribution values and connection types. The mechanism also has some desirable properties: (1) conservation of cumulative contribution and social utility in the P2P community, (2) maximization of social utility if all requesting clients have the same contribution value, and (3) incentive-based resource distribution. The resource distribution algorithm and the contribution update algorithm are computationally efficient and can be easily implemented. Experimental results illustrate the efficiency and fairness of our algorithms.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124486859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 86
A server side caching scheme for CORBA CORBA的服务器端缓存方案
24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281568
Atul Kumar, P. Jalote, D. Gupta
{"title":"A server side caching scheme for CORBA","authors":"Atul Kumar, P. Jalote, D. Gupta","doi":"10.1109/ICDCS.2004.1281568","DOIUrl":"https://doi.org/10.1109/ICDCS.2004.1281568","url":null,"abstract":"We propose a caching scheme for saving the results of invocations of read methods at server side. Server side caching helps in reducing load on frequently accessed servers when computing the result is relatively costly. Our model provides strong consistency by using a dependency graph that specifies dependence information among method invocations of an object. We have implemented this scheme as a service in CORBA.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"101 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121016322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
DERMI: a decentralized peer-to-peer event-based object middleware DERMI:一个分散的点对点基于事件的对象中间件
24th International Conference on Distributed Computing Systems, 2004. Proceedings. Pub Date : 2004-03-24 DOI: 10.1109/ICDCS.2004.1281588
Carles Pairot, P. López, A. Gómez-Skarmeta
{"title":"DERMI: a decentralized peer-to-peer event-based object middleware","authors":"Carles Pairot, P. López, A. Gómez-Skarmeta","doi":"10.1109/ICDCS.2004.1281588","DOIUrl":"https://doi.org/10.1109/ICDCS.2004.1281588","url":null,"abstract":"We present DERMI, a decentralized wide-area event-based object middleware built on top of a peer-to-peer substrate. Its main building block is the underlying publish/subscribe event notification system provided by the peer-to-peer layer. By using this methodology, innovative benefits like distributed interception, high performance synchronous/asynchronous one-to-one/one-to-many notifications and decentralized object location services are provided. Moreover, new programming abstractions (anycall and manycall) are introduced, which allow the programmer to make calls to groups of objects without taking care of which of them responds until a determinate condition is met. We believe that such middleware is a solid building block for future wide-area distributed component infrastructures.","PeriodicalId":348300,"journal":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116876190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信