{"title":"Performance of file replication policies for real-time file access in data grids","authors":"A. Doğan","doi":"10.4108/GRIDNETS.2007.2235","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2235","url":null,"abstract":"A variety of file replication and replacement algorithms were proposed for the Data Grids in the literature. On the other hand, real-time Grid applications are emerging in many disciplines of science and engineering. Thus, it is natural to ask about the real-time performance of these file replication and replacement algorithms. Based on this motivation, in this study, the performance of three replication algorithms, namely fast spread, cascading, and caching, are evaluated together with three different file replacement policies, including least recently used, least frequently used, and least urgent first, under various Grid settings. For this evaluation, a process oriented and discrete-event driven simulator is developed. A detailed set of simulation studies are conducted using the simulator and the results obtained are presented to elaborate on the real-time performance of the aforementioned replication algorithms.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"362 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115897238","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 comparative study of different heavy tail index estimators of the flow size from sampled data","authors":"P. Loiseau, Paulo Gonçalves, P. Primet","doi":"10.4108/GRIDNETS.2007.2268","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2268","url":null,"abstract":"In this article, we address the problem of estimating the tail parameter of a flow size distribution from sampled packet traffic. Based on synthetic data, we perform a systematic comparison of several estimators proposed in the literature. In the course, we propose a variant to an existing method which takes into account some statistical a priori on the expected distribution. This adapted estimator shows a significantly improved performance, as compared to the others.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126506477","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}
S. Thorpe, L. Battestilli, G. Karmous-Edwards, A. Hutanu, J. MacLaren, J. Mambretti, J. Moore, K. S. Sundar, Yufeng Xin, A. Takefusa, M. Hayashi, A. Hirano, S. Okamoto, T. Kudoh, T. Miyamoto, Y. Tsukishima, T. Otani, H. Nakada, Hideaki Tanaka, Atsushi Taniguchi, Y. Sameshima, M. Jinno
{"title":"G-lambda and EnLIGHTened: wrapped in middleware co-allocating compute and network resources across Japan and the US","authors":"S. Thorpe, L. Battestilli, G. Karmous-Edwards, A. Hutanu, J. MacLaren, J. Mambretti, J. Moore, K. S. Sundar, Yufeng Xin, A. Takefusa, M. Hayashi, A. Hirano, S. Okamoto, T. Kudoh, T. Miyamoto, Y. Tsukishima, T. Otani, H. Nakada, Hideaki Tanaka, Atsushi Taniguchi, Y. Sameshima, M. Jinno","doi":"10.4108/GRIDNETS.2007.2077","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2077","url":null,"abstract":"This paper describes innovative architectures and techniques for reserving and coordinating highly distributed resources, a capability required for many large scale applications. In the fall of 2006, Japan's G-lambda research team and the United States' EnLIGHTened Computing research team used these innovations to achieve the world's first inter-domain coordination of resource managers for in-advance reservation of network bandwidth and compute resources between and among both the US and Japan. The compute and network resource managers had different interfaces and were independently developed. Automated interoperability among the resources in both countries was enabled through various Grid middleware components. In this paper, we describe the middleware components, testbeds, results, and lessons learned.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130165115","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 reliable and realistic approach of advance network reservations with guaranteed completion time for bulk data transfers in grids","authors":"K. Munir, S. Javed, M. Welzl","doi":"10.4108/GRIDNETS.2007.2163","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2163","url":null,"abstract":"Advance Reservation mechanisms in Grid systems should include the network just like any other resource; this is usually not only a technical, but also an administrative challenge. In this paper, we present a QoS mechanism for bulk data transfers which minimizes the necessary support from network service providers. By shifting the complexity of controlling the traffic to end nodes, where we combine admission control with congestion control, we can provide per-flow guarantees while efficiently using the available network capacity.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125835202","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":"Using network traffic to passively detect under utilized resources in high performance cluster grid computing environments","authors":"Lanier A Watkins, R. Beyah, C. Corbett","doi":"10.4108/GRIDNETS.2007.2070","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2070","url":null,"abstract":"In this paper we propose a technique for detecting under utilized resources (less than 70% memory utilization) due to memory bound processes by passively monitoring network traffic produced by the resource. To our knowledge, this is the first approach of its kind. One application of this technique is dynamic resource discovery (detection of resources with under utilized memory) in a High Performance Desktop or Cluster Grid computing environment confined to a low latency Local Area Network (LAN). Our method removes the need to communicate directly with resources to determine if their memory is under utilized, thus reducing traffic on the network. This is very important in a High Performance computing environment since data or computational intensive applications may be present. The proposed method creates a delay sensitive profile generated by the analysis of monitored network traffic due to High Performance UDP based services such as file transfer applications (FOBS, Tsunami, UDT, SABUL, etc.), message passing platforms (MPICH-G2/Score, etc.), and many more. An energy value is derived from the delay sensitive profile, which represents the state (over utilized memory or under utilized memory) of the resource of interest. Then a simple threshold is applied to the energy value to identify the state of the resource. Several scenarios have been investigated to determine the feasibility of the proposed technique. Results suggest that the proposed technique can use network traffic to extract delays associated with a resources' memory utilization and accurately determine the state of the resource.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"335 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123399051","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":"Long range dependent job arrival process and its implications in grid environments","authors":"Hui Li","doi":"10.4108/GRIDNETS.2007.2236","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2236","url":null,"abstract":"Job arrivals can be described as point processes and it is shown that correlations and fractal behavior can be reliably revealed using the count/rate representation. Using real workload data from production Grids, we show that the second order properties such as the autocorrelation function (ACF) and the scaling behavior can be well reconstructed by a Multifractal Wavelet Model (MWM). A so-called controlled-variability integrate-and-fire (CV-InF) algorithm is applied to transform rates into interarrivals so that a full description of the arrival process can be obtained. The additive nature of rates makes it possible to model different patterns separately and aggregate them back to form a unified process. We further quantify the performance impacts of autocorrelated job arrivals in Grid scheduling using model-driven simulation. It is shown that autocorrelations in the arrival processes can cause performance degradation both at the local and the Grid level.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128183439","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":"Economic aspects of a utility computing service","authors":"","doi":"10.4108/GRIDNETS.2007.2223","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2223","url":null,"abstract":"We present a case study of business and systems modelling for a Utility Computing service. Our analysis is concerned mainly with service pricing, resource flexing, and costs related to preventive security measures. We explain the conceptual and mathematical basis of our modelling approach, describing the details of a particular (discrete event, executable) model of a Utility Computing service, and show how the information obtained from such a model can aid business and design decisions.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128877117","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 peer-to-peer infrastructure for distributing large scientific data sets over wide area high-performance networks: experimental studies using wide area layer 2 services","authors":"Yunhong Gu, Robert L. Grossman, J. Mambretti","doi":"10.4108/GRIDNETS.2007.2166","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2166","url":null,"abstract":"This paper presents Sector, a distributed environment that was created specifically to address the challenges inherent in accessing, exploring, analyzing and transporting extremely large scientific datasets over high performance wide area networks. To date, the effective utilization of such datasets has been limited because accessing and transporting large remote data sets in traditional distributed computing environments is often a challenge. Sector was designed and developed to eliminate these barriers. The Sector architecture incorporates specialized communications services and specialized data services that are designed for high volume data flows over wide area high performance optical networks. This design employs several innovative techniques to ensure that data flows are maximized at all times and at all locations required regardless of distances. This architectural design has been implemented on a prototype international experimental testbed. The results and implications of these preliminary tests are described.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"264 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120972783","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":"End-host based mechanisms for implementing flow scheduling in GridNetworks","authors":"Sebastien Soudan, R. Guillier, P. Primet","doi":"10.4108/GRIDNETS.2007.2152","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2152","url":null,"abstract":"In Grids, data transfers and network resources need to be managed in a more deterministic way than in the Internet. New approaches like flow scheduling are proposed and studied as alternatives to traditional QoS and reservation proposals. To enable such flow scheduling approaches, runtime mechanisms controlling flow sending time and rate have to be implemented in the data plane. This paper quantifies and compares such end-host based mechanisms combined with transport protocols to instantiate different scheduling strategies in a range of latency conditions. We show that, a single-rate scheduling strategy implemented by an AIMD-based protocol and a packet pacing mechanism offers predictable performance and is insensitive to latency. This paper also highlights the limits of other strategies and rate limitation mechanisms like token bucket which generates unpredictability and other drawbacks.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128584417","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}
B. K. Singh, Amirhasan Amintabar, A. Aggarwal, R. Kent, Ahmedur Rahman, Farhan Mirza, Zillur Rahman
{"title":"Secure grid monitoring, a web-based framework","authors":"B. K. Singh, Amirhasan Amintabar, A. Aggarwal, R. Kent, Ahmedur Rahman, Farhan Mirza, Zillur Rahman","doi":"10.4108/GRIDNETS.2007.2170","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2170","url":null,"abstract":"The problem of securely monitoring the grid, in which a group of different entities provide and exchanging confidential information has become a significant task for an efficient use of shared resources. In this paper, a Web based secure grid monitoring framework is presented which permits resources to be monitored only by authorized users. The proposed framework provides monitoring a grid environment comprehensively, with low overhead for authentication and authorization purposes. Another advantage of our framework is that complex authorization policies for grid monitoring can be easily applied.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129339370","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}