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

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

筛选
英文 中文
Improving Transaction Server Performance under Heavy Loads with Differentiated Service and Active Network Interfaces 通过差异化服务和活动网络接口提高重负载下事务服务器的性能
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.26
O. Demir, K. Ghose
{"title":"Improving Transaction Server Performance under Heavy Loads with Differentiated Service and Active Network Interfaces","authors":"O. Demir, K. Ghose","doi":"10.1109/NCA.2005.26","DOIUrl":"https://doi.org/10.1109/NCA.2005.26","url":null,"abstract":"Transaction based Web services that demand realtime performance guarantees, such as online auctions, stock trading and real-time database servers generally require a higher level of security and performance compared to normal Web services. To improve server throughput of servers for such applications under heavy loads or under denial of service attacks, it is necessary to service requests differentially, giving preference to on-going or imminent client requests. We show how such facilities can be efficiently implemented on an active network adapter based gateway that controls accesses to a pool of backend servers. Using an experimental prototype based around a dual-ported active NIC, we show how a differentiated service policy can be implemented on such a gateway to bound the server response time and to improve server throughputs under heavy loads","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"35 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114110197","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}
引用次数: 3
Multicast in Fat-Tree-Based InfiniBand Networks 基于脂肪树的ib网络中的组播
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.32
Jiazheng Zhou, Xuan-Yi Lin, Chun-Hsien Wu, Yeh-Ching Chung
{"title":"Multicast in Fat-Tree-Based InfiniBand Networks","authors":"Jiazheng Zhou, Xuan-Yi Lin, Chun-Hsien Wu, Yeh-Ching Chung","doi":"10.1109/NCA.2005.32","DOIUrl":"https://doi.org/10.1109/NCA.2005.32","url":null,"abstract":"The multicast operation is a very commonly used operation in parallel applications. With the hardware supported multicast of the InfiniBand architecture (IBA), we propose a cyclic multicast scheme for fat-tree-based (m-port n-tree) InfiniBand networks. The basic concept of the proposed cyclic multicast scheme is to find the union sets of the output ports of switches in the paths between the source processing node and each destination processing node in a multicast group. Based on the union sets and the path selection scheme, the forwarding table for a given multicast group can be constructed. We implement the proposed multicast scheme along with the OpenSM multicast scheme and the unicast scheme on an m-port n-tree InfiniBand network simulator. The simulation results show that the proposed multicast scheme outperforms the unicast scheme for all simulated cases. For many-to-many and all-to-many cases, the cyclic multicast scheme outperforms the OpenSM multicast scheme. For many-to-all case, the performance of the cyclic multicast scheme is a little better than that of the OpenSM multicast scheme","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"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":"117312231","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}
引用次数: 3
New Generation Scalable and Dependable Servers 新一代可扩展和可靠的服务器
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.36
R. W. Taylor
{"title":"New Generation Scalable and Dependable Servers","authors":"R. W. Taylor","doi":"10.1109/NCA.2005.36","DOIUrl":"https://doi.org/10.1109/NCA.2005.36","url":null,"abstract":"Summary form only given. Today's applications are being built in new ways. The advent of service-oriented architectures, modern networking protocols and industry-standard components at all levels open seemingly endless possibilities for new applications and services. This article focuses on the particular challenges for servers and how these challenges are being addressed. The NonStop Enterprise Division of HP (formerly Tandem computers) has built massively parallel, hardware and software fault-tolerant servers. These servers power many of the most challenging transaction processing environments that exist, including major stock exchanges, funds transfer applications, credit and debit card applications, E911 applications, major telephony and instant messaging applications, and integrated hospital applications. The system is based on a message-oriented architecture and thus bears many similarities internally to the architectural principals being espoused for today's service-oriented architectures. HP is bringing to market a new generation of integrity nonstop servers, based on an innovative design using Intel Itanium 2 processors and leveraging many other industry standards. The article describes how the new generation of servers can accomplish even higher levels of availability than current systems while at the same time leveraging industry standards and meeting other extreme requirements. The article touches on the lessons learned over the years when dealing with mission-critical applications and how those lessons apply to today's distributed, service-oriented architectures. The underlying message is that careful use of encapsulation, limiting the use of distributed algorithms to carefully controlled situations, and overall design rigor are required even more than ever","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"13 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":"115399459","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
A formal framework (Expression + Analysis) for network security 网络安全的正式框架(表达式+分析)
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.2
R. Laborde, F. Barrère, A. Benzekri
{"title":"A formal framework (Expression + Analysis) for network security","authors":"R. Laborde, F. Barrère, A. Benzekri","doi":"10.1109/NCA.2005.2","DOIUrl":"https://doi.org/10.1109/NCA.2005.2","url":null,"abstract":"Security mechanisms enforcement consists in configuring devices with the aim that they cooperate and guarantee the defined security goals. In the network context, this task is complex due to the number, the nature, and the interdependences of the devices to consider. We propose in this article a formal framework, which models the network security management information in order to verify the appliance of security goals. The framework is divided into two components. First, a formal language allows its user to graphically specify the abstract network security tactics while considering network topologies. Second, an associated evaluation method guarantees the consistency and the correctness of the tactics according to the security goals","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"16 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":"122414774","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
Location-based Publish/Subscribe 基于发布/订阅
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.29
P. Eugster, B. Garbinato, A. Holzer
{"title":"Location-based Publish/Subscribe","authors":"P. Eugster, B. Garbinato, A. Holzer","doi":"10.1109/NCA.2005.29","DOIUrl":"https://doi.org/10.1109/NCA.2005.29","url":null,"abstract":"This paper introduces the concept of location-based publish/subscribe (LPS), which allows mobile ad hoc applications to anonymously communicate with each other, depending on their locations. With this concept, publish/subscribe topics are typically expressed in a dynamic manner including proximity criteria, e.g., \"I subscribe to all events on topic T published within some range R\". We advocate that location-based publish/subscribe is a key programming paradigm for building mobile ad hoc application, and sketch our current implementation, which is based on standard APIs of the Java 2 platform, Micro Edition","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"46 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":"131740915","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}
引用次数: 76
Protocol Composition Frameworks A Header-Driven Model 协议组合框架一个报头驱动的模型
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.41
D. Bünzli, Sergio Mena, U. Nestmann
{"title":"Protocol Composition Frameworks A Header-Driven Model","authors":"D. Bünzli, Sergio Mena, U. Nestmann","doi":"10.1109/NCA.2005.41","DOIUrl":"https://doi.org/10.1109/NCA.2005.41","url":null,"abstract":"Protocol composition frameworks provide off-the-shelf composable protocols to simplify the development of custom protocol stacks. All recent protocol frameworks use a general-purpose event-driven model to manage the interactions between protocols. In complex compositions, where protocols offer their service to more than one other protocol, the one-to-many interaction scheme of the event-driven model introduces composition problems by mixing up the targets to which data (list of headers) should be delivered. To solve these problems, we propose to shift the driving force behind interactions from the events to the headers they carry. We show that the resulting domain-specific header-driven model solves the composition problems, provides statically typed header handling and enhances protocol readability","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"33 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":"133507089","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}
引用次数: 4
Reducing the Communication Cost via Chain Pattern Scheduling 利用链模式调度降低通信成本
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.43
F. Ciorba, T. Andronikos, Ioannis Drositis, G. Papakonstantinou, P. Tsanakas
{"title":"Reducing the Communication Cost via Chain Pattern Scheduling","authors":"F. Ciorba, T. Andronikos, Ioannis Drositis, G. Papakonstantinou, P. Tsanakas","doi":"10.1109/NCA.2005.43","DOIUrl":"https://doi.org/10.1109/NCA.2005.43","url":null,"abstract":"This paper deals with general nested loops and proposes a novel scheduling methodology for reducing the communication cost of parallel programs. General loops contain complex loop bodies (consisting of arbitrary program statements, such as assignments, conditions and repetitions) that exhibit uniform loop-carried dependencies. Therefore it is now possible to achieve efficient parallelization for a vast class of loops, mostly found in DSP, PDEs, signal and video coding. We use computational geometry methods, that exploit efficiently the regularity of nested loops index spaces, in order to significantly reduce the communication cost, which in most cases is the main drawback of parallel programs' performance. Through extensive testing, we show that the proposed method outperforms in all cases the classic cyclic mapping, succeeding to reduce the communication by 15%-35%. This significant reduction of the communication volume makes our method a promising candidate to be incorporated into existing automatic parallel code generation tools","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"68 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":"133410827","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}
引用次数: 4
Networking Aspects in the DPASA Survivability Architecture: An Experience Report DPASA生存性体系结构中的网络方面:经验报告
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.35
M. Atighetchi, P. Rubel, P. Pal, Jennifer Chong, L. Sudin
{"title":"Networking Aspects in the DPASA Survivability Architecture: An Experience Report","authors":"M. Atighetchi, P. Rubel, P. Pal, Jennifer Chong, L. Sudin","doi":"10.1109/NCA.2005.35","DOIUrl":"https://doi.org/10.1109/NCA.2005.35","url":null,"abstract":"The same network infrastructure that is essential for the operation of today's high valued distributed systems can also be misused by malicious attackers. Experience shows that implementing absolute security or preventing cyber attacks completely is infeasible when systems must be highly interconnected and comprise of COTS components with unknown security characteristics. Therefore, focus is shifting towards making high valued distributed systems survivable, enabling them to operate through attacks. This paper focuses on the networking aspects of the DPASA survivability architecture, which was used recently to defense-enable a DoD information system","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"52 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":"129299247","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
A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ CSFQ中实现公平带宽分配的概率方法
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.4
Peng Wang, D. Mills
{"title":"A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ","authors":"Peng Wang, D. Mills","doi":"10.1109/NCA.2005.4","DOIUrl":"https://doi.org/10.1109/NCA.2005.4","url":null,"abstract":"The fair bandwidth allocations can isolate flows and protect well-behaved flows from ill-behaved ones. CSFQ (core stateless fair queueing) achieves the approximate fairness by dropping the extra packets beyond the fair share bandwidth at the routers. A heuristic method is used to estimate the fair share in CSFQ. Furthermore, we know that SRED (stabilized RED) uses a probabilistic method based on a Zombie list to estimate the number of flows at the router. In this paper, we take the probabilistic idea from SRED and apply it in CSFQ to estimate the fair share without using the Zombie list. Simulation results show that the new probabilistic approach achieves a comparable or even better performance than the original heuristic approach","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":"124390353","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}
引用次数: 4
SFS-KNOPPIX
Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.47
K. Suzaki, K. Iijima, T. Yagi, Hideyuki Tan, Kazuhiro Goto
{"title":"SFS-KNOPPIX","authors":"K. Suzaki, K. Iijima, T. Yagi, Hideyuki Tan, Kazuhiro Goto","doi":"10.1109/NCA.2005.47","DOIUrl":"https://doi.org/10.1109/NCA.2005.47","url":null,"abstract":"KNOPPIX is a bootable CD with a collection of GNU/Linux software. KNOPPIX is very convenient but it requires downloading 700 MB iso image and burning a CD-ROM when it is renewed. In order to solve this problem we made SFS-KNOPPIX which boots from Internet with SFS (self-certifying file system), SFS-KNOPPIX requires 20 MB boot-loader with Linux-kernel and miniroot. Root file system is obtained from Internet with SFS at boot time. It enables to change root file system and makes easy to try new version of KNOPPIX. In this paper we describe the detail of SFS-KNOPPIX and its performance","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":"124019853","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学术官方微信