Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)最新文献_第2页

Autonomous Data Replication Using Q-Learning for Unstructured P2P Networks 基于q -学习的非结构化P2P网络自主数据复制

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.11

S. Thampi, K. C. Sekaran

引用次数: 20

A Swarm-based Routing Protocol for Wireless Sensor Networks 基于群的无线传感器网络路由协议

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.2

M. Paone, L. Paladina, Dario Bruneo, A. Puliafito

引用次数: 18

TinyTate: Computing the Tate Pairing in Resource-Constrained Sensor Nodes TinyTate:计算资源受限传感器节点的Tate配对

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.48

Leonardo B. Oliveira, Diego F. Aranha, Eduardo Morais, Felipe Daguano, Julio López Hernandez, R. Dahab

引用次数: 112

Eventual Leader Service in Unreliable Asynchronous Systems: Why? How? 不可靠异步系统中的最终领导者服务:为什么?如何?

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.19

M. Raynal

引用次数: 9

Scalable Communication for High Performance and Inexpensive Reliable QoS using Relaxed Recovery 使用放松恢复实现高性能和廉价可靠QoS的可扩展通信

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.38

I. Chen, M. Ito

引用次数: 1

Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems 金字塔码:在可靠的数据存储系统中交换空间的灵活方案

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1145/2435204.2435207

Cheng Huang, Minghua Chen, Jin Li

引用次数: 434

Towards IQ-Appliances: Quality-awareness in Information Virtualization 迈向智能设备:信息虚拟化中的质量意识

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.49

Radhika Niranjan, Ada Gavrilovska, K. Schwan, Priyanka Tembey

引用次数: 4

Distributed subscriptions clustering with limited knowledge sharing for content-based publish/subscribe systems 面向基于内容的发布/订阅系统的具有有限知识共享的分布式订阅集群

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.16

E. Casalicchio, F. Morabito

引用次数: 17

Aspect-Oriented Programing Techniques to support Distribution, Fault Tolerance, and Load Balancing in the CORBA-LC Component Model 在CORBA-LC组件模型中支持分布、容错和负载平衡的面向方面编程技术

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.8

Diego Sevilla Ruiz, José M. García, A. Gómez-Skarmeta

{"title":"Aspect-Oriented Programing Techniques to support Distribution, Fault Tolerance, and Load Balancing in the CORBA-LC Component Model","authors":"Diego Sevilla Ruiz, José M. García, A. Gómez-Skarmeta","doi":"10.1109/NCA.2007.8","DOIUrl":"https://doi.org/10.1109/NCA.2007.8","url":null,"abstract":"The design and implementation of distributed High Performance Computing (HPC) applications is becoming harder as the scale and number of distributed resources and application is growing. Programming abstractions, libraries and frameworks are needed to better overcome that complexity. Moreover, when Quality of Service (QoS) requirements such as load balancing, efficient resource usage and fault tolerance have to be met, the resulting code is harder to develop, maintain, and reuse, as the code for providing the QoS requirements gets normally mixed with the functionality code. Component Technology, on the other hand, allows a better modularity and reusability of applications and even a better support for the development of distributed applications, as those applications can be partitioned in terms of components installed and running (deployed) in the different hosts participating in the system. Components also have requirements in forms of the aforementioned non-functional aspects. In our approach, the code for ensuring these aspects can be automatically generated based on the requirements stated by components and applications, thus leveraging the component implementer of having to deal with these non-functional aspects. In this paper we present the characteristics and the convenience of the generated code for dealing with load balancing, distribution, and fault-tolerance aspects in the context of CORBA-LC. CORBA-LC is a lightweight distributed reflective component model based on CORBA that imposes a peer network model in which the whole network acts as a repository for managing and assigning the whole set of resources: components, CPU cycles, memory, etc.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121376834","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

On the Evaluation of Shortest Journeys in Dynamic Networks 动态网络中最短行程的评价

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.35

Afonso Ferreira, A. Goldman, Julian Monteiro

{"title":"On the Evaluation of Shortest Journeys in Dynamic Networks","authors":"Afonso Ferreira, A. Goldman, Julian Monteiro","doi":"10.1109/NCA.2007.35","DOIUrl":"https://doi.org/10.1109/NCA.2007.35","url":null,"abstract":"The assessment of routing protocols for wireless networks is a difficult task, because of the networks' highly dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and low earth orbit (LEO) satellites systems, have more predictable dynamics, as the temporal variations in the network topology are somehow deterministic, which may make them easier to study. The graph theoretic model - the evolving graphs - was proposed to help capture the dynamic behavior of these networks, in view of the construction of least cost routing and other algorithms. Our recent experiments showed that evolving graphs have all the potentials to be an effective and powerful tool in the development of routing protocols for dynamic networks. In this paper, we evaluated the shortest journey evolving graph algorithm when used in a routing protocol for MANETs. We use the NS2 network simulator to compare this first implementation to the four well known protocols, namely AODV, DSR, DSDV, and OLSR. In this paper we present simulation results on the energy consumption of the nodes. We also included other EG protocol, namely EGForemost, in the experiments.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115901097","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