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

Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.最新文献

筛选
英文 中文
NSF activities in Cyber Trust NSF在网络信托中的活动
Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201141
C. Landwehr
{"title":"NSF activities in Cyber Trust","authors":"C. Landwehr","doi":"10.1109/NCA.2003.1201141","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201141","url":null,"abstract":"\"Cyber Trust\" is an umbrella term under which NSF/CISE has organized research focused on improving the ability of a computer-based component or system to repel, resist, detect, or tolerate malicious attacks while providing a desired function. Cyber Trust encompasses security (in terms of secrecy, confidentiality, integrity and availability), as well as privacy, correctness, reliability, safety and survivability. Three primary programs support Cyber Trust research: Trusted Computing, Data and Application Security, and Network Security. In addition, the Embedded and Hybrid Systems program is concerned with trust in all types of embedded software and control systems. These programs are coordinated within CISE, and the responsible Program Directors work to assure that proposals submitted to one program that seem more suited to a different one, and proposals in which the work straddles program boundaries, receive appropriate review. This talk will discuss the current Cyber Trust programs and NSF's plans for the area.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121805056","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
A limited-global information model for dynamic fault-tolerant routing in cube-based multicomputers 基于立方体的多计算机动态容错路由的有限全局信息模型
Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201172
Zhen Jiang, Jie Wu
{"title":"A limited-global information model for dynamic fault-tolerant routing in cube-based multicomputers","authors":"Zhen Jiang, Jie Wu","doi":"10.1109/NCA.2003.1201172","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201172","url":null,"abstract":"The safety level model is a special coded fault information model designed to support fault-tolerant routing in hypercubes. In this model, each node is associated with an integer, called safety level, which is an approximated measure of the number and distribution of faulty nodes in the neighborhood. The safety level of each node in an n-dimensional hypercube (n-cube) can be easily calculated through (n-1) rounds of information exchanges among neighboring nodes. We focus on routing capability using safety levels in a dynamic system; that is, a system in which new faults might occur during a routing process. In this case, the updates of safety levels and the routing process proceed hand-in-hand. Our approach is based on an early work (2001) in a special fault model. In that model, each fault appears at a different time step and before each fault occurrence the safety levels in the cube are stabilized. This paper extends our results to a general fault model without any limitation on fault occurrence. Under the assumption that the total number of faults is less than n, we provide an upper bound of detour number in a routing process. Simulation results are also provided to compare with the proposed upper bound.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114941468","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
Organizing a distributed application in a mobile ad hoc network 在移动自组织网络中组织分布式应用程序
Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201161
C. Tuduce, T. Gross
{"title":"Organizing a distributed application in a mobile ad hoc network","authors":"C. Tuduce, T. Gross","doi":"10.1109/NCA.2003.1201161","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201161","url":null,"abstract":"A distributed application that operates in an ad hoc network formed by mobile nodes must limit its use of all-to-all communication since the overall capacity of such a network is severely constrained. To address this problem, we describe an algorithm that allows an application to impose a hierarchical structure on the participating nodes. A simple tree is maintained as hosts join and leave the ad hoc network. We evaluate this algorithm in the context of a collaboration tool for a network of Linux laptops using IEEE 802.11b network cards. Preliminary performance results from our mobile test-bed indicate that the application responds well to connectivity changes and is sufficiently agile to run in a highly mobile environment.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130717255","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
Scheduling correlated broadcast data considering access frequencies with temporal variations 考虑访问频率随时间变化的相关广播数据调度
Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201142
W. Uchida, T. Hara, S. Nishio
{"title":"Scheduling correlated broadcast data considering access frequencies with temporal variations","authors":"W. Uchida, T. Hara, S. Nishio","doi":"10.1109/NCA.2003.1201142","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201142","url":null,"abstract":"Recently, there has been an increasing interest in the research of push-based information systems that deliver data using broadcast in both wired and wireless environments. In push-based systems, since a server can meet all requests for broadcast data pending in a system with one broadcast, a larger throughput can be expected when there exists a large number of clients. In this paper to reduce the response time of data access, we propose a new scheduling strategy of broadcast program considering an environment where clients issue requests for multiple data items consecutively with think-time. The proposed strategy reduces the average response time by broadcasting the optimal data item at present according to clients' access characteristics such as access frequencies, correlations among data items, and think-time.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122724782","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
Performance analysis for a DiffServ-enabled network: the case of relative service 支持diffserv的网络的性能分析:相对服务的情况
Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201179
C. Bouras, A. Sevasti
{"title":"Performance analysis for a DiffServ-enabled network: the case of relative service","authors":"C. Bouras, A. Sevasti","doi":"10.1109/NCA.2003.1201179","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201179","url":null,"abstract":"A lot of research work has recently focused on the exploitation of the DiffServ framework towards building reliable networking services that provide deterministic quality guarantees. In this work we are attempting to devise a DiffServ-based service model for relative differentiation of traffic in a network serving aggregated traffic. The service model proposed aims at providing a minimum capacity during congestion and a bounded average end-to-end delay to profile-conforming traffic, obtaining thus a relatively better performance when compared to the best-effort service. We provide the framework on which the proposed service model is based and we present results from its deployment in a simulation environment.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133515709","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
Admission control in peer groups 对等组的准入控制
Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201147
Yongdae Kim, D. Mazzocchi, G. Tsudik
{"title":"Admission control in peer groups","authors":"Yongdae Kim, D. Mazzocchi, G. Tsudik","doi":"10.1109/NCA.2003.1201147","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201147","url":null,"abstract":"Security in collaborative peer groups is an active research topic. Most previous work focused on key management without addressing an important pre-requisite: admission control, i.e., how to securely admit a new member. This paper represents an initial attempt to sketch out an admission control framework suitable for different flavors of peer groups and match them with appropriate cryptographic techniques and protocols. Open problems and directions for future work are identified and discussed.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129355090","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}
引用次数: 98
A truthful mechanism for fair load balancing in distributed systems 分布式系统中公平负载平衡的真实机制
Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201167
Daniel Grosu, Anthony T. Chronopoulos
{"title":"A truthful mechanism for fair load balancing in distributed systems","authors":"Daniel Grosu, Anthony T. Chronopoulos","doi":"10.1109/NCA.2003.1201167","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201167","url":null,"abstract":"In this paper we consider the problem of designing load balancing protocols in distributed systems where the participants (e.g. computers, users) are capable of manipulating the load allocation algorithm in their own interest. Using techniques from mechanism design theory we design a mechanism for fair load balancing in heterogeneous distributed systems. We prove that our mechanism is truthful and satisfies the voluntary participation condition. Based on the proposed mechanism we derive a fair load balancing protocol called FAIR-LBM. Finally, we study the effectiveness of our protocol by simulations.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129398002","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}
引用次数: 11
Policy based architecture for the UMTS multimedia domain UMTS多媒体域的基于策略的体系结构
Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201166
Wolfgang Böhm, Peter Braun
{"title":"Policy based architecture for the UMTS multimedia domain","authors":"Wolfgang Böhm, Peter Braun","doi":"10.1109/NCA.2003.1201166","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201166","url":null,"abstract":"Policy-Based Networking (PBN) is a novel technology that facilitates the management and operation of networks. The paper reports on the application of Policy-Based mechanisms for QoS control in the IP Multimedia Subsystem (IMS) of the 3/sup rd/ generation UMTS networks. The IMS was introduced in UMTS to provide high quality IP-based Multimedia Services in Mobile Networks. After an introduction into PBN technology and a generic network architecture to support end-to-end QoS control, the Policy Decision Function as specified in UMTS is shown. The limitations of the current state of the standardization are explained and extensions to provide Policy-Based end-to-end QoS control in single and multi-operator environments are proposed.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129704942","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}
引用次数: 10
Fault-oriented software robustness assessment for multicast protocols 面向故障的多播协议软件鲁棒性评估
Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201160
Shu Xiao, Sheng Li, Xiangrong Wang, Lijun Deng
{"title":"Fault-oriented software robustness assessment for multicast protocols","authors":"Shu Xiao, Sheng Li, Xiangrong Wang, Lijun Deng","doi":"10.1109/NCA.2003.1201160","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201160","url":null,"abstract":"This paper reports a systematic approach for detecting software defects in multicast protocol implementations. We deploy a fault-oriented methodology and an integrated test system targeting software robustness vulnerabilities. The primary method is to assess protocol implementation by non-traditional interface fault injection that simulates network attacks. The test system includes a novel packet driving engine, a PDU generator based on Strengthened BNF notation and a few auxiliary tools. We apply it to two multicast protocols, IGMP and PIM-DM, and investigate their behaviors under active functional attacks. Our study proves its effectiveness for promoting production of more reliable multicast software.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121583911","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}
引用次数: 10
A performance model and analysis of heterogeneous traffic with heavy tails 重尾异构流量性能模型及分析
Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003. Pub Date : 2003-04-16 DOI: 10.1109/NCA.2003.1201177
Imad Antonios, L. Lipsky
{"title":"A performance model and analysis of heterogeneous traffic with heavy tails","authors":"Imad Antonios, L. Lipsky","doi":"10.1109/NCA.2003.1201177","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201177","url":null,"abstract":"Several research efforts have recently attempted to characterize the effects of heavy-tailed traffic on router performance, while the effects of light-tailed traffic have for long been understood. Since general Web traffic originates from heterogeneous sources, the study of traffic mixing is of importance as it can reveal the degree to which heavy-tailed traffic can be handled by networking infrastructure before router delay becomes unacceptable. We present a model for heterogeneous traffic sources, where each is an ON/OFF process with an exponential OFF time and an arbitrary ON-time distribution. We consider the case of a 2-source process where one has exponential ON time and the other power tailed and present some analysis results showing the significance of traffic mixing on router performance.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121994232","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
首页 上一页 下一页 尾页
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学术官方微信