Fourth IEEE International Symposium on Network Computing and Applications最新文献

Self-organization in Cooperative Content Distribution Networks 合作内容分发网络中的自组织

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.46

Marc Schiely, L. Renfer, P. Felber

引用次数: 21

Cooperative Mobile Agents to Gather Global Information 协作移动代理收集全球信息

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.13

Michel Charpentier, G. Padiou, P. Quéinnec

引用次数: 5

A Policy-based Management Framework for Pervasive Systems using Axiomatized Rule-Actions 使用公理化规则动作的普适系统基于策略的管理框架

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.3

C. Shankar, R. Campbell

{"title":"A Policy-based Management Framework for Pervasive Systems using Axiomatized Rule-Actions","authors":"C. Shankar, R. Campbell","doi":"10.1109/NCA.2005.3","DOIUrl":"https://doi.org/10.1109/NCA.2005.3","url":null,"abstract":"Pervasive systems comprise large collections of heterogeneous and mobile devices, services and applications. A management infrastructure is required to govern the system behavior according to policies specified by the system administrator. Policy-based management is a well-established approach where policies are specified as Event-Condition-Action (ECA) rules that determine the management actions to be performed when certain situations occur. The problem with ECA policies is that conflicting actions may get triggered on the same event resulting in policy conflicts. Cycles may result when a set of policy rules trigger each other continuously. Existing approaches to conflict detection are limited in scope and can only detect conflicting actions if they are explicitly stated. In addition, current techniques do not detect cycles in management policies. We propose an extension to the ECA rule framework, called Event-Condition-PreCondition-Action-PostCondition (ECPAP) as a rule framework for management policies. In this framework, actions are annotated with axiomatic specifications that enable powerful reasoning to detect conflicts and cycles in policies. We present the details of this framework","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128700301","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}

引用次数: 30

Effectiveness of Traffic Camouflaging over Computer Networks 计算机网络流量伪装的有效性

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.18

Wei Zhao

引用次数: 0

Using Residual Times to Meet Deadlines in M/G/C Queues 在M/G/C队列中使用剩余时间满足最后期限

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.53

Sarah Tasneem, L. Lipsky, R. Ammar, H. Sholl

引用次数: 6

A Concentric Multi-ring Overlay for Highly Reliable P2P Networks 一种用于高可靠P2P网络的同心多环覆盖

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.1

Giscard Wepiwé, P. Simeonov

{"title":"A Concentric Multi-ring Overlay for Highly Reliable P2P Networks","authors":"Giscard Wepiwé, P. Simeonov","doi":"10.1109/NCA.2005.1","DOIUrl":"https://doi.org/10.1109/NCA.2005.1","url":null,"abstract":"The paper presents a concentric multi-ring overlay networking topology for fast and shortest-path resource discovery in dynamic distributed systems like P2P network. First, we define a highly reliable P2P system called HiPeer, which is deployed on top of the logical overlay with a number of lowest bounds in terms of network performance. Then, we demonstrate that for any De Bruijn digraph of degree dges2 and diameter DDB, HiPeer constructs a highly reliable network, where each node maintains a routing table with a size of at most 2d+3 entries independent of the number N of nodes in the system. Further, we show that for any network with at most d nodes, any existing resource in the network can be found within at most DHiPeer=logd(N(d-1)+d)-1 hops. This result is as close to the Moore bound as the query path length in the other best P2P proposals based on the De Bruijn digraphs. Thus, HiPeer defines a highly connected network with connectivity d and the lowest yet known lookup bound DHiPeer. Moreover, we show that any node's \"join or leave\" operation in HiPeer implies a constant expected reorganization cost of the magnitude order of O(d) control messages","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127329341","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

A Wide Area Network Simulation of Single-Round Group Membership Algorithms 一种广域网单轮组成员算法仿真

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.5

R. Khazan, Sophia Yuditskaya

引用次数: 3

C-CORE: Using Communication Cores for High Performance Network Services C-CORE:在高性能网络服务中使用通信核心

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.10

Sanjay Kumar, Ada Gavrilovska, K. Schwan, Srikanth Sundaragopalan

{"title":"C-CORE: Using Communication Cores for High Performance Network Services","authors":"Sanjay Kumar, Ada Gavrilovska, K. Schwan, Srikanth Sundaragopalan","doi":"10.1109/NCA.2005.10","DOIUrl":"https://doi.org/10.1109/NCA.2005.10","url":null,"abstract":"Recent hardware advances are creating multi-core systems with heterogeneous functionality. This paper explores how applications and middleware can utilize systems comprised of processors specialized for communication vs. computational tasks. The C-CORE execution environment enables applications, through middleware and underlying system functionality, to utilize both the computational capabilities of general purpose CPUs and the high performance communication hardware provided by specialized communication processors. Such future heterogeneous multi-core hardware is emulated by attaching a representative network processor - Intel's IXP2400 processor - to a general purpose CPU via a dedicated interconnect. For this platform, C-CORE provides abstractions to represent an application's communication actions, to efficiently couple such actions with application-level computations, and to dynamically create and configure the platform-resident 'chains' of computational and communication actions used by applications. C-CORE's functionality is evaluated with representative, communication-intensive applications. Measurements on our experimental platform establish the performance advantages afforded to applications by C-CORE","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116622549","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}

引用次数: 23

Slingshot: Time-CriticalMulticast for Clustered Applications 弹弓:集群应用程序的时间关键组播

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.49

M. Balakrishnan, Stefan Pleisch, K. Birman

引用次数: 17

Dynamic Quorums for DHT-based P2P Networks 基于dht的P2P网络动态仲裁

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.17

R. Baldoni, Leonardo Querzoni, A. Virgillito, R. Jiménez-Peris, M. Patiño-Martínez

引用次数: 12