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

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

筛选
英文 中文
Hopcount in Application Layer Multicast Schemes 应用层组播方案中的跳数
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.25
M. Janic, Novi Ineke, Cempaka Wangi, Xiaoming Zhou, P. Mieghem
{"title":"Hopcount in Application Layer Multicast Schemes","authors":"M. Janic, Novi Ineke, Cempaka Wangi, Xiaoming Zhou, P. Mieghem","doi":"10.1109/NCA.2005.25","DOIUrl":"https://doi.org/10.1109/NCA.2005.25","url":null,"abstract":"Application layer (AL) multicast emerged as a response to a slow deployment of IP multicast. However, the gain of AL multicast over unicast is questionable. We investigate the efficiency of the two prominent protocols, MCAN and Scribe, in terms of the number of hops. We compare the efficiency of these algorithms to the efficiency of unicast and IP multicast via extensive simulations, as well as via measurements on the PlanetLab network. We introduce modifications to the MCAN algorithm that lead to a reduction in the hopcount. Finally, we demonstrate that the topology unawareness under certain conditions can make these schemes less efficient than unicast","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"196 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":"124381196","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
pMIX: Untraceability for Small Hiding Groups. pMIX:小隐藏组的不可追溯性。
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.40
C. A. Melchor, Y. Deswarte
{"title":"pMIX: Untraceability for Small Hiding Groups.","authors":"C. A. Melchor, Y. Deswarte","doi":"10.1109/NCA.2005.40","DOIUrl":"https://doi.org/10.1109/NCA.2005.40","url":null,"abstract":"MIXes are routers that accept packets until their buffers are full, and then send them to the recipients hiding the link (usually through reencryption and rearrangement) between incoming and outgoing packets. MIXes and their variants are used today to provide untraceable communication with systems such as TOR, and they have been a major issue of research on privacy protection for more than twenty years. One of the major problems presented by a MIX is that its administrator is able to link the incoming and outgoing messages transiting through it, and this is the reason why MIXes are almost always organized in networks, according to the model presented by David Chaum (1981). In this paper, we present a protocol that combines these two fields of research, allowing us to create MIXes that have the remarkable property of being unable to link the incoming and outgoing packets transiting through them. This brings the possibility for its users to be untraceable while most of the data of their communication are sent through a single MIX, improving the performance and versatility of anonymizing systems","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"107 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":"124861580","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}
引用次数: 7
Method for Task Migration in Grid Environments 网格环境下的任务迁移方法
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.31
Stephen Frechette, D. Avresky
{"title":"Method for Task Migration in Grid Environments","authors":"Stephen Frechette, D. Avresky","doi":"10.1109/NCA.2005.31","DOIUrl":"https://doi.org/10.1109/NCA.2005.31","url":null,"abstract":"This paper presents a method, infrastructure, and prototype that enables adaptive application task migration among a grid environment. Our infrastructure automatically reconfigures distributed applications in response to network performance failures and denial of service (DoS) attacks. Through the use of performance monitoring software we enable network connection failover and automatic application task migration within a heterogeneous distributed computing environment. Our system distinguishes itself from other available adaptive computing frameworks because it is wholly composed of open source grid-enabled components capable of both transparent and dynamic selection of message passing transports based on resource performance","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"117 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":"117279641","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}
引用次数: 15
TCP New Vegas: Improving the Performance of TCP Vegas Over High Latency Links TCP新维加斯:提高TCP维加斯在高延迟链路上的性能
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.52
Joel Sing, B. Soh
{"title":"TCP New Vegas: Improving the Performance of TCP Vegas Over High Latency Links","authors":"Joel Sing, B. Soh","doi":"10.1109/NCA.2005.52","DOIUrl":"https://doi.org/10.1109/NCA.2005.52","url":null,"abstract":"TCP Vegas provides significant performance gains over most TCP variants, especially when used over networks that utilise error prone links. However, whilst examining the impact of latency on TCP we noticed that the performance of TCP Vegas decreases significantly when the network round trip time exceeds 50ms. This paper details research undertaken to identify the cause of this performance decreasing behaviour in TCP Vegas. Three sender-side modifications are proposed and implemented as TCP New Vegas, before being validated via simulation","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"8 3 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":"124245302","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}
引用次数: 61
Scalable QoS-Based Event Routing in Publish-Subscribe Systems 发布-订阅系统中基于qos的可伸缩事件路由
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.45
N. Carvalho, Filipe Araújo, L. Rodrigues
{"title":"Scalable QoS-Based Event Routing in Publish-Subscribe Systems","authors":"N. Carvalho, Filipe Araújo, L. Rodrigues","doi":"10.1109/NCA.2005.45","DOIUrl":"https://doi.org/10.1109/NCA.2005.45","url":null,"abstract":"This paper proposes a distributed and scalable publish-subscribe broker with support for QoS. The broker, called IndiQoS, leverages on existing mechanisms to reserve resources in the underlying network and on an overlay network of peer-to-peer rendezvous nodes, to automatically select QoS-capable paths. By avoiding flooding of either QoS reservations or link-state information, IndiQoS is able to scale with respect to network size and number of reservations. Experimental results show the validity of our approach","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"32 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":"124304505","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}
引用次数: 73
Block Migration in Broadcast-based Multiprocessor Architectures 基于广播的多处理器体系结构中的块迁移
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.9
C. Katsinis
{"title":"Block Migration in Broadcast-based Multiprocessor Architectures","authors":"C. Katsinis","doi":"10.1109/NCA.2005.9","DOIUrl":"https://doi.org/10.1109/NCA.2005.9","url":null,"abstract":"This paper presents techniques that improve the performance of parallel programs on distributed shared memory NUMA multiprocessors by implementing dynamic memory block and page migration. Our techniques address the latencies caused by the contention within the network and attempt to enhance data locality by migrating pages to reduce remote references. We analyze the behavior of eight multiprocessor applications, which exhibit a wide range of network traffic patterns. Results show that several applications that encounter hot spots and network congestion see a reduction of run time by more than a factor of ten","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"1 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":"129670928","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}
引用次数: 0
Fundamental Network Processor Performance Bounds 基本网络处理器性能界限
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.24
Hao Che, Ch.Ravi Kumar, Basavaraj Menasinahal
{"title":"Fundamental Network Processor Performance Bounds","authors":"Hao Che, Ch.Ravi Kumar, Basavaraj Menasinahal","doi":"10.1109/NCA.2005.24","DOIUrl":"https://doi.org/10.1109/NCA.2005.24","url":null,"abstract":"In this paper, fundamental conditions, which bound the network processing unit (NPU) worst-case performance, are established. In particular, these conditions formalize and integrate, with mathematical rigor, two existing approaches for finding the NPU performance bounds, i.e., the work conserving condition and instruction/latency budget based approaches. These fundamental conditions are then employed to derive tight memory access latency bounds for a data path flow with one memory access. Finally, one of these memory access latency bounds is successfully used to interpret a peculiar phenomenon found in Intel IXP1200, demonstrating the importance of analytical modeling for NPU performance analysis","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"50 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":"132895438","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}
引用次数: 9
An Adaptive Reputation-based Trust Framework for Peer-to-Peer Applications 点对点应用中基于声誉的自适应信任框架
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.6
William Sears, Zhen Yu, Y. Guan
{"title":"An Adaptive Reputation-based Trust Framework for Peer-to-Peer Applications","authors":"William Sears, Zhen Yu, Y. Guan","doi":"10.1109/NCA.2005.6","DOIUrl":"https://doi.org/10.1109/NCA.2005.6","url":null,"abstract":"In distributed P2P environments, peers (i.e., users) often have to request the services from some unfamiliar peers (i.e., resources) that could be altruistic, selfish, or even malicious. To motivate selfish peers to cooperate and minimize the risk from malicious peers, we propose an adaptive reputation-based trust framework for peer-to-peer applications. In this framework, we define a quantifiable metric trust that is calculated from the user's own view as well as other peers' view (as references) on the reputation of a peer (resource). It can be used to quantify the trustworthiness of peers and provide a measurable and trustable way of resource scheduling/selection and access control for peer-to-peer applications. We assume economic resources compete with each other to maximize their profit and design a number of strategies, for resources to determine their price. The simulation results show that the framework supports economic resources to achieve long-term high user satisfaction, differentiates malicious nodes from normal ones and encourages the resources to provide high-quality services","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"1 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":"133880911","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}
引用次数: 21
Architectural Issues of JMS Compliant Group Communication JMS兼容组通信的体系结构问题
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.7
A. Kupsys, Richard Ekwall
{"title":"Architectural Issues of JMS Compliant Group Communication","authors":"A. Kupsys, Richard Ekwall","doi":"10.1109/NCA.2005.7","DOIUrl":"https://doi.org/10.1109/NCA.2005.7","url":null,"abstract":"Group communication provides one-to-many communication primitives that simplify the development of highly available services. Despite advances in research and numerous prototypes, group communication stays confined to small niches. To facilitate the acceptance of group communication by a larger community, a new specification and API, called JMS Groups, based on the popular Java message service (JMS) has previously been presented. As a follow-up, this paper focuses on the architectural issues of the JMSGroups implementation. We consider an implementation based on a JMS server, i.e., a JMS server that is modified internally to provide a group communication service. Usually JMS server is implemented as a single entity providing its service to numerous clients. However, single server architecture is exposed to failures and is not suitable for group communication. To address this problem, we discuss the issues related to the JMS server replication (first without providing group communication). Different replicated architecture options are presented and compared. Finally, we show how to construct a fault-tolerant JMSGroups system, by extending the replicated JMS server with a group communication service","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"158 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":"116207006","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}
引用次数: 5
Challenges in Mobile Networking and Information Assurance 移动网络和信息保障的挑战
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.11
A. Ghosh
{"title":"Challenges in Mobile Networking and Information Assurance","authors":"A. Ghosh","doi":"10.1109/NCA.2005.11","DOIUrl":"https://doi.org/10.1109/NCA.2005.11","url":null,"abstract":"Summary form only given. The author presents some of the key challenges the Department of Defense faces in mobile networking and information assurance. In mobile networking, episodic connectivity, a variety of waveforms, changing topology, and scarce bandwidth presents a number of challenges in mapping currently available commercial technologies to the mobile ad hoc networking environment. Challenges in information assurance include being able to design self-defending networks, robust defenses, situational awareness utilities, self-monitoring, self-evolving software, trust-based dynamic credentialing, and traceback and attribution tools","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"1 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":"129388573","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}
引用次数: 1
首页 上一页 下一页 尾页
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学术官方微信