{"title":"Adaptive resource selection for grid-enabled network services","authors":"Byoung-Dai Lee, J. Weissman","doi":"10.1109/NCA.2003.1201140","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201140","url":null,"abstract":"Due to the popularity of high-speed networks and advances in packaging and interface technologies, there has been significant efforts for providing high performance applications as network services that can be accessed remotely across the network, thus promoting sharing of both software and hardware. For high-demand network services, in particular, it will often be the case that the network services are installed at multiple sites so that each participating site can handle parts of client requests. We label such services as grid-enabled network services. In this paper, we present two adaptive site selection heuristics that do not depend on accurate predictions of completion times of service requests: weight queue length based heuristic and multi-level queue based selection.","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":"121464213","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}
{"title":"Leveraging grid technology in network-centric environments","authors":"J. Salasin, A. Moini","doi":"10.1109/NCA.2003.1201131","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201131","url":null,"abstract":"In this paper we present the key elements of the NICCI (Network-centric Infrastructure for Command, Control and Intelligence) infrastructure and compare and contrast them with similar capabilities provided by the OGSA (Open Grid Services Architecture) grid infrastructure. We also examine the advantages and disadvantages of using the OGSA grid infrastructure as a substrate for implementing NICCI and highlight some of the technology gaps. Finally, looking ahead at the future of the grid computing research, we identify several research thrusts where we believe there is a natural synergy and opportunity for cross-pollination between the NICCI-sponsored research and the ongoing efforts of the grid community.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"101 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":"122043210","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}
{"title":"Scalable diverse protected multicast as a programmable service leveraging IP-multicast","authors":"Christian Bachmeir, P. Tabery","doi":"10.1109/NCA.2003.1201143","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201143","url":null,"abstract":"In this paper we introduce diverse protected multicast as a transparent programmable service. We embed common IP multicast data transport architectures in an adaptable programmable overlay network. Our approach transparently reduces the packet loss perceived by multicast receivers at the edge of the network through injection and transport of redundant data. We propose to build up - transparent to the applications at the edge of the network - redundant, alternate paths or alternate multicast distribution trees that are mostly edge- and vertex-disjoint. As performance of multicast applications depends also on the time the exchanged data between the applications needs - taking into account possible retransmissions - our approach improves basic quality of service for group communication protocols.","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":"130335768","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}
{"title":"Privacy issues in an insecure world","authors":"W. Strayer","doi":"10.1109/NCA.2003.1201151","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201151","url":null,"abstract":"We all have a notion of privacy and understand that we trade some of it away in order to have normal social interactions and communal security. Networked computer systems are no different. The notion of privacy is running squarely against the need for security in an increasingly networked world. Is it possible to have secure systems that honor privacy? There are two basic ways to secure a network: prevent bad things from happening, and watch closely for bad things and prosecute those who commit them. Since our current preventative measures like authentication and authorization seem to be failing to adequately protect the network, we have turned more toward auditing and monitoring-first as a complement, and now increasingly as a substitute-for prevention. I discuss the impact security concerns is having on privacy, and suggest that today's trend of solving security by detecting intrusions through monitoring is a reaction to institutional paranoia as well as woefully inadequate software development processes. I argue that monitoring alone can't provide sufficient protection, and that in fact the trend of relying increasingly on intrusion detection systems tells us that we are really losing ground-not gaining-on providing computer security.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"77 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133719026","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}
{"title":"A genetic algorithm for multicast mapping in publish-subscribe systems","authors":"M. L. Guimarães, L. Rodrigues","doi":"10.1109/NCA.2003.1201139","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201139","url":null,"abstract":"In publish-subscribe systems, multicast is an efficient way to propagate information from the publishers to a group of subscribers. This paper studies the problem of mapping a large set of subscriptions into a fixed, smaller set of multicast groups in order to support efficiently the dissemination of events. Given the large search space, it is infeasible to obtain the optimal solution in reasonable time. To address this difficulty, the paper proposes and evaluates a genetic search solution for the mapping problem.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"32 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":"133832339","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}
{"title":"The implication of short-range dependency on delay variation measurement","authors":"Qiong Li, D. Mills","doi":"10.1109/NCA.2003.1201178","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201178","url":null,"abstract":"Packet delay variation (or delay jitter) measurements are used by applications to estimate the service quality received from the network, or by network operators to monitor network operation states. Since a single jitter measurement takes two delay samples to calculate, the time scale over which the two delay samples are taken may affect the statistics of measured jitter. The current common practice of calculating jitter statistics is by treating all measurements as valid samples of the same sampling space. In this paper, we perform scaling analyses on measured delay sequences to show that the proper way of conducting jitter statistic analysis is by first grouping jitter samples into different clusters each containing samples that are taken over the same or similar time scales, and then carrying out statistic analysis separately on these clusters. This special treatment is desired due to the existence of strong short-range dependency among packet delays, which is introduced by queueing effect. The tool selected to perform the scaling analysis is called Deviation-Lag Function (DLF). We show that some congestion-related information of congested end-to-end paths can be derived from their DLF plots. We also discuss the potential usage of DLF for bottleneck queue detection.","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":"115502705","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}
M. Atighetchi, P. Pal, F. Webber, Christopher C. Jones
{"title":"Adaptive use of network-centric mechanisms in cyber-defense","authors":"M. Atighetchi, P. Pal, F. Webber, Christopher C. Jones","doi":"10.1109/NCA.2003.1201154","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201154","url":null,"abstract":"Attacks against distributed systems frequently start at the network layer by gathering network related information (such as open TCP ports) and continue on by exhausting resources, or abusing protocols. Defending against network-based attacks is a major focus area in the APOD (Application That Participate in Their Own Defense) project, which set out to develop technologies that increase an application's resilience against cyber attacks. This paper gives an overview of APOD's current set of network-level defenses. Specific network-based defense mechanisms are described first, followed by a discussion on how to use them in local defensive behavior. Defense strategies, which specify coordinated defensive behavior across a distributed system, are discussed next, followed by results from initial experimental evaluation.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"76 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":"124895401","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}
{"title":"SOME-Bus-NOW: a Network of Wrkstations with broadcast","authors":"C. Katsinis, D. Hecht","doi":"10.1109/NCA.2003.1201145","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201145","url":null,"abstract":"Networks of Workstations have been mostly designed using switch-based architectures and programming based on message passing. This paper describes a network of workstations based on the Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bits) which is a low-latency, high-bandwidth interconnection network that directly links arbitrary pairs of processor nodes without contention, and can efficiently interconnect several hundred nodes. Each node has a dedicated output channel and an array of receivers, with one receiver dedicated to every other node's output channel. The SOME-Bus eliminates the need for global arbitration and provides bandwidth that scales directly with the number of nodes in the system. Under the Distributed Shared Memory (DSM) paradigm, the SOME-bus allows strong integration of the transmitter, receiver and cache controller hardware to produce a highly integrated system-wide cache coherence mechanism. This paper examines switch-based networks that maintain high performance under varying degrees of application locality, and compares them to the SOME-Bus, in terms of latency and processor utilization.","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":"125941855","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}
{"title":"Blocking probability in WDM multicast switching networks with limited wavelength conversion","authors":"Xiangdong Qin, Yuanyuan Yang","doi":"10.1109/NCA.2003.1201171","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201171","url":null,"abstract":"Currently, many bandwidth-intensive applications require multicast services for efficiency purposes. In particular, as wavelength division multiplexing (WDM) technique emerges as a promising solution to meet the rapidly growing demands on bandwidth in present communication networks, supporting multicast at the WDM layer becomes an important yet challenging issue. In this paper, we present a new analytical model to compute blocking probabilities for multicast connections in WDM switching networks. Due to the non-uniform nature of multicast traffic, calculating blocking probability in a WDM multicast switching network becomes much more challenging than that under unicast traffic. Based on the link independence and wavelength independence assumptions, our model can calculate the blocking probability of any multicast connection from a single source to multiple destinations in WDM switching networks with various types of wavelength conversion capabilities, ranging from no wavelength conversion, to limited wavelength conversion, to full wavelength conversion. Our analytical results indicate that similar to unicast traffic, a significant improvement in the blocking performance of the network under multicast traffic can be achieved by limited wavelength conversion. We view that utilizing limited wavelength conversion with relatively small conversion degrees in WDM multicast switching networks is a more cost-effective choice. We also validate the analytical model through extensive simulations.","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":"132438908","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}
Minsu Choi, N. Park, K. M. George, B. Jin, N. Park, Yong-Bin Kim, F. Lombardi
{"title":"Fault tolerant memory design for HW/SW co-reliability in massively parallel computing systems","authors":"Minsu Choi, N. Park, K. M. George, B. Jin, N. Park, Yong-Bin Kim, F. Lombardi","doi":"10.1109/NCA.2003.1201173","DOIUrl":"https://doi.org/10.1109/NCA.2003.1201173","url":null,"abstract":"A highly dependable embedded fault-tolerant memory architecture for high performance massively parallel computing applications and its dependability assurance techniques are proposed and discussed in this paper. The proposed fault tolerant memory provides two distinctive repair mechanisms: the permanent laser redundancy reconfiguration during the wafer probe stage in the factory to enhance its manufacturing yield and the dynamic BIST/BISD/BISR (built-in-self-test-diagnosis-repair)-based reconfiguration of the redundant resources in field to maintain high field reliability. The system reliability which is mainly determined by hardware configuration demanded by software and field reconfiguration/repair utilizing unused processor and memory modules is referred to as HW/SW Co-reliability. Various system configuration options in terms of parallel processing unit size and processor/memory intensity are also introduced and their HW/SW Co-reliability characteristics are discussed. A modeling and assurance technique for HW/SW Co-reliability with emphasis on the dependability assurance techniques based on combinatorial modeling suitable for the proposed memory design is developed and validated by extensive parametric simulations. Thereby, design and Implementation of memory-reliability-optimized and highly reliable fault-tolerant field reconfigurable massively parallel computing systems can be achieved.","PeriodicalId":203990,"journal":{"name":"Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003.","volume":"38 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":"132505707","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}