{"title":"Manycast Service in Optical Burst/Packet Switched (OBS/OPS) Networks (Invited Paper)","authors":"V. Vokkarane, B. Bathula","doi":"10.1007/978-3-642-02080-3_24","DOIUrl":"https://doi.org/10.1007/978-3-642-02080-3_24","url":null,"abstract":"","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114194992","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}
J. Bresnahan, M. Link, Gaurav Khanna, Z. Imani, R. Kettimuthu, Ian T Foster
{"title":"Globus GridFTP: what's new in 2007","authors":"J. Bresnahan, M. Link, Gaurav Khanna, Z. Imani, R. Kettimuthu, Ian T Foster","doi":"10.4108/GRIDNETS.2007.2288","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2288","url":null,"abstract":"GridFTP is a high-performance, secure, reliable data transfer protocol optimized for high-bandwidth wide-area networks. It is based on the Internet FTP protocol, and it defines extensions for high-performance operation and security. The Globus implementation of GridFTP provides a software suite optimized for the gamut of data access issues---from bulk file transfer to the details of getting data out of complex storage systems within sites. We summarize some recent developments in Globus GridFTP.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"431 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":"116004707","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 novel load balancing mechanism for P2P networking","authors":"L. Lymberopoulos, S. Papavassiliou, B. Maglaris","doi":"10.4108/GRIDNETS.2007.2254","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2254","url":null,"abstract":"Peer to Peer (P2P) networking is a potential disruptive technology that can be used for the development of scalable, fully decentralized distributed applications. However, to realize its potential, P2P technology should address the needs of a variety of applications, other than file-sharing requiring support for exact-match queries on the file names. Our work complements and contributes to existing P2P overlays that support multiple-attributes and range queries, using the distributed K-Dimensional (K-D) tree structure for organizing shared information among participating peers. This guarantees that the time needed for node join - leave operations and query times are logarithmic with respect to the number of peers. In such systems, an open issue is load balancing of resources among peers, as only load-balanced data structures can guarantee that the complexity for resolving multi-attribute and range queries remains logarithmic (thus scalable) with respect to the number of participating peers. In this paper, we report a novel load balancing algorithm for dynamically keeping the resource load among peers balanced. We prove that the load balancing algorithm is robust and scalable, achieving an O(log2N) complexity, where N is the number of peers. We illustrate how our algorithm can be used to build a scalable Grid Information Service supporting multi-attribute and range queries on available services within the shared Grid infrastructure.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"19 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":"124627925","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":"Joint path and resource selection for OBS grids with adaptive offset based QoS mechanism","authors":"Mehmet Köseoğlu, Ezhan Karasan","doi":"10.4108/GRIDNETS.2007.2195","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2195","url":null,"abstract":"In this paper, we first propose a joint resource and path selection algorithm for optical burst switched grids. We show that path switching and network-aware resource selection can reduce burst loss probability and average completion time of grid jobs compared to the algorithms that are separately selecting paths and grid resources. In addition to joint resource and path selection, we present an adaptive offset algorithm for grid bursts which minimizes the average completion time. We show that the adaptive offset based QoS mechanism significantly reduces the job completion times by exploiting the trade-off between decreasing loss probability and increasing delay as a result of the extra offset time.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"5 46","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113932608","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}
Matthias Schmidt, Matthew Smith, N. Fallenbeck, Hans-Joachim Picht, Bernd Freisleben
{"title":"Building a demilitarized zone with data encryption for grid environments","authors":"Matthias Schmidt, Matthew Smith, N. Fallenbeck, Hans-Joachim Picht, Bernd Freisleben","doi":"10.4108/GRIDNETS.2007.2160","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2160","url":null,"abstract":"Security and data integrity are important aspects in the fields of Grid and cluster computing. When these two areas are combined, the security issues intermingle and new security concepts are needed to ensure protection of both Grid users and local cluster users. In this paper, a novel dual laned Demilitarized Zone (DMZ) to protect local clusters from Grid attacks is introduced. The Globus Security Infrastructure (GSI) is extended to enable safe end-to-end encryption of Grid jobs through the DMZ and into virtualized execution hosts. Finally, an integrated Network Intrusion Detection System with Grid-specific rules, further protecting the Grid DMZ, is presented.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"179 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":"124745134","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":"Metric induced network poset (MINP): a model of the network from an application point of view","authors":"Laurent Bobelin, T. Muntean","doi":"10.4108/GRIDNETS.2007.2246","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2246","url":null,"abstract":"Nowadays grids connect up to thousands communicating resources that may interact in a partially or totally coordinated way. Consequently, applications running upon this kind of platform often involve massively concurrent bulk data transfers. In order to optimize overall completion times, those transfers have to be scheduled based on knowledge about network performances and topology.\u0000 Identifying and inferring performances of a network topology is a classic problem. Achieving this by using only end-to-end measurements at the application level is a method known as network tomography. When topology reflects capacities of sets of links with respect to a metric, the model used to represent the topology obtained is called a Metric-Induced Network Topology (MINT). Such a type of representation, obtained using statistical methods, has been widely used in order to represent performances of client/server communication protocols.\u0000 However, it is no longer accurate when dealing with grids. In this paper, we present a novel representation of the infered knowledge from multiple source and multiple destination measurements.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"206 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":"129701340","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":"Reliable DAG scheduling on grids with rewinding and migration","authors":"Israel Hernandez, M. Cole","doi":"10.4108/GRIDNETS.2007.2137","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2137","url":null,"abstract":"Fault tolerance is an important issue in Grid Computing as the availability of Grid resources can not be guaranteed. Effective scheduling methods must include fault tolerant mechanisms to preserve the execution of DAG applications, despite the presence of a processor failure. To address this, we designed the DAG rewinding mechanism, an event-driven process executed when a failure is detected at some rescheduling point. The rewinding mechanism preserves the execution of the application by recomputing and migrating those tasks which will disrupt the forward execution of succeeding tasks. The mechanism rewinds the progress of the application to a previous state, thereby preserving the execution despite the failed processor(s). This paper extends our work in the area by adding the rewinding mechanism to our previous dynamic scheduling methods GTP and GTP/c. We show how to integrate the rewinding mechanism within our dynamic execution models.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"19 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":"116749987","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":"Performance of high-speed transport protocols coexisting on a long distance 10-Gbps testbed network","authors":"K. Kumazoe, M. Tsuru, Y. Oie","doi":"10.4108/GRIDNETS.2007.2248","DOIUrl":"https://doi.org/10.4108/GRIDNETS.2007.2248","url":null,"abstract":"Our group has been conducting a series of experiments on various recently available high-speed transport protocols over long-distance, 10-gigabit-class, international testbed networks. The study reported here focuses on the scenario of multiple coexisting flows along an end-to-end 10-Gbps path, where TCP-based transport protocols are used. The results show that two coexisting high-speed flows cannot share network resources efficiently. For example, for some protocols, competition between two flows prevents the sum of their throughputs from fully utilizing available bandwidth, especially when flows have the same RTT, and causes considerable imbalance in the time-averaged throughput between two flows, especially when there are different RTTs.","PeriodicalId":380761,"journal":{"name":"Networks for Grid Applications","volume":"115 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":"134493282","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}