Yahyapour, Ramin

[["dc.bibliographiccitation.firstpage","159"],["dc.bibliographiccitation.issue","2"],["dc.bibliographiccitation.journal"," Journal of Grid Computing"],["dc.bibliographiccitation.lastpage","175"],["dc.bibliographiccitation.volume","6"],["dc.contributor.author","Baraglia, Ranieri"],["dc.contributor.author","Ferrini, Renato"],["dc.contributor.author","Tonellotto, Nicola"],["dc.contributor.author","Ricci, Laura"],["dc.contributor.author","Yahyapour, Ramin"],["dc.date.accessioned","2018-08-16T13:30:01Z"],["dc.date.available","2018-08-16T13:30:01Z"],["dc.date.issued","2007"],["dc.description.abstract","Large and dynamic computational Grids, generally known as wide-area Grids, are characterized by a large availability, heterogene- ity on computational resources, and high vari- ability on their status during the time. Such Grid infrastructures require appropriate schedule mechanisms in order to satisfy the application performance requirements (QoS). In this paper we propose a launch-time heuristics to schedule component-based parallel applications on such kind of Grid. The goal of the proposed heuristics is threefold: to meet the minimal task computation- al requirement, to maximize the throughput between communicating tasks, and to evaluate on-the-fly the resource availability to minimize the aging effect on the resources state. We evaluate the proposed heuristics by simulations applying it to a suite of task graphs and Grid platforms randomly generated. Moreover, a further test was conducted to schedule a real application on a real Grid. Experimental results shown that the proposed solution can be a viable one."],["dc.identifier.doi","10.1007/s10723-006-9061-5"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/15364"],["dc.language.iso","en"],["dc.notes.status","final"],["dc.relation.eissn","1570-7873"],["dc.relation.eissn","1572-9184"],["dc.title","A Launch-time Scheduling Heuristics for Parallel Applications on Wide Area Grids"],["dc.type","journal_article"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","46"],["dc.bibliographiccitation.lastpage","52"],["dc.contributor.author","Dabbaghi Varnosfaderani, Shirin"],["dc.contributor.author","Kasprzak, Piotr"],["dc.contributor.author","Pohl, Christof"],["dc.contributor.author","Yahyapour, Ramin"],["dc.date.accessioned","2019-11-29T08:46:32Z"],["dc.date.available","2019-11-29T08:46:32Z"],["dc.date.issued","2019"],["dc.description.abstract","Generally, methods of authentication and identification utilized in asserting users' credentials directly affect security of offered services. In a federated environment, service owners must trust external credentials and make access control decisions based on Assurance Information received from remote Identity Providers (IdPs). Communities (e.g. NIST, IETF and etc.) have tried to provide a coherent and justifiable architecture in order to evaluate Assurance Information and define Assurance Levels (AL). Expensive deployment, limited service owners' authority to define their own requirements and lack of compatibility between heterogeneous existing standards can be considered as some of the unsolved concerns that hinder developers to openly accept published works. By assessing the advantages and disadvantages of well-known models, a comprehensive, flexible and compatible solution is proposed to value and deploy assurance levels through a central entity called Proxy."],["dc.identifier.doi","10.1109/CSCloud/EdgeCom.2019.00018"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/62711"],["dc.language.iso","en"],["dc.publisher","IEEE"],["dc.relation.conference","IEEE International Conference on Cyber Security and Cloud Computing,"],["dc.relation.eventend","2019-06-23"],["dc.relation.eventlocation","Paris, France"],["dc.relation.eventstart","2019-06-21"],["dc.relation.isbn","978-1-7281-1661-7"],["dc.relation.ispartof","2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)"],["dc.relation.orgunit","Gesellschaft für wissenschaftliche Datenverarbeitung"],["dc.title","A Flexible and Compatible Model for Supporting Assurance Level through a Central Proxy"],["dc.type","conference_paper"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]

[["dc.contributor.author","González-García, José Luis"],["dc.contributor.author","Tchernykh, Andrei"],["dc.contributor.author","Yahyapour, Ramin"],["dc.date.accessioned","2020-04-03T17:23:20Z"],["dc.date.available","2020-04-03T17:23:20Z"],["dc.date.issued","2006"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/63735"],["dc.title","Evaluación Experimental de Estrategias de Calendarización en Grid Computacional Utilizando un Esquema de Admisibilidad"],["dc.type","preprint"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","22"],["dc.bibliographiccitation.journal","Wissenschaftsmanagement"],["dc.bibliographiccitation.lastpage","25"],["dc.bibliographiccitation.volume","3"],["dc.contributor.author","Yahyapour, Ramin"],["dc.contributor.author","Wieder, Philipp"],["dc.date.accessioned","2021-10-22T11:05:45Z"],["dc.date.available","2021-10-22T11:05:45Z"],["dc.date.issued","2013"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/91228"],["dc.language.iso","de"],["dc.relation.orgunit","Gesellschaft für wissenschaftliche Datenverarbeitung"],["dc.title","Heiter bis wolkig"],["dc.title.subtitle","Cloud-Dienste für die Wissenschaft"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dc.type.subtype","original_ja"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","77"],["dc.bibliographiccitation.lastpage","91"],["dc.contributor.author","Tchernykh, Andrei"],["dc.contributor.author","Schwiegelshohn, Uwe"],["dc.contributor.author","Yahyapour, Ramin"],["dc.contributor.author","Kuzjurin, Nikolai"],["dc.date.accessioned","2020-04-06T14:26:07Z"],["dc.date.available","2020-04-06T14:26:07Z"],["dc.date.issued","2008"],["dc.identifier.doi","10.1007/978-0-387-09455-7_6"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/63888"],["dc.relation.isbn","978-0-387-09454-0"],["dc.relation.isbn","978-0-387-09455-7"],["dc.relation.ispartof","From Grids to Service and Pervasive Computing"],["dc.title","Online Hierarchical Job Scheduling on Grids"],["dc.type","book_chapter"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","335"],["dc.bibliographiccitation.lastpage","347"],["dc.contributor.author","Wieder, Philipp"],["dc.contributor.author","Seidel, Jan"],["dc.contributor.author","Wäldrich, Oliver"],["dc.contributor.author","Ziegler, Wolfgang"],["dc.contributor.author","Yahyapour, Ramin"],["dc.date.accessioned","2020-04-06T14:35:45Z"],["dc.date.available","2020-04-06T14:35:45Z"],["dc.date.issued","2008"],["dc.identifier.doi","10.1007/978-0-387-78446-5_22"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/63894"],["dc.relation.isbn","978-0-387-78445-8"],["dc.relation.isbn","978-0-387-78446-5"],["dc.relation.ispartof","Grid Middleware and Services"],["dc.title","Using SLA for Resource Management and Scheduling - A Survey"],["dc.type","book_chapter"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","141"],["dc.bibliographiccitation.lastpage","146"],["dc.contributor.author","Lin, Jia-Chun"],["dc.contributor.author","Lee, Ming-Chang"],["dc.contributor.author","Yahyapour, Ramin"],["dc.date.accessioned","2019-02-11T10:08:36Z"],["dc.date.available","2019-02-11T10:08:36Z"],["dc.date.issued","2015"],["dc.description.abstract","Renting a set of virtual private servers (VPSs for short) from a VPS provider to establish a virtual MapReduce cluster is cost-efficient for a company/organization. To shorten job turnaround time and keep data locality as high as possible in this type of environment, this paper proposes a Best-Fit Task Scheduling scheme (BFTS for short) from a tenant's perspective. BFTS schedules each map task to a VPS that can finish the task earlier than the other VPSs by predicting and comparing the time required by every VPS to retrieve the map-input data, execute the map task, and become idle in an online manner. Furthermore, BFTS schedules each reduce task to a VPS that is close to most VPSs that execute the related map tasks. We conduct extensive experiments to compare BFTS with several scheduling algorithms employed by Hadoop. The experimental results show that BFTS is better than the other tested algorithms in terms of map-data locality, reduce-data locality, and job turnaround time. The overhead incurred by BFTS is also evaluated, which is inevitable but acceptable compared with the other algorithms."],["dc.identifier.doi","10.1109/BigData.2014.7004223"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/57544"],["dc.language.iso","en"],["dc.notes.status","final"],["dc.relation.conference","IEEE International Conference on Big Data (Big Data)"],["dc.relation.eventend","2014-10-30"],["dc.relation.eventlocation","Washington, DC, USA"],["dc.relation.eventstart","2014-10-27"],["dc.relation.isbn","978-1-4799-5666-1"],["dc.relation.ispartof","2014 IEEE International Conference on Big Data (Big Data)"],["dc.relation.orgunit","Gesellschaft für wissenschaftliche Datenverarbeitung"],["dc.title","Scheduling MapReduce tasks on virtual MapReduce clusters from a tenant's perspective"],["dc.type","conference_paper"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","91"],["dc.bibliographiccitation.lastpage","98"],["dc.contributor.author","Fatemi Moghaddam, Faraz"],["dc.contributor.author","Wieder, Philipp"],["dc.contributor.author","Yahyapour, Ramin"],["dc.date.accessioned","2019-01-25T09:22:37Z"],["dc.date.available","2019-01-25T09:22:37Z"],["dc.date.issued","2017"],["dc.description.abstract","Security challenges are the most important obstacles for the advancement of IT-based on-demand services and cloud computing as an emerging technology. Lack of coincidence in identity management models based on defined policies and various security levels in different cloud servers is one of the most challenging issues in clouds. In this paper, a policy-based user authentication model has been presented to provide a reliable and scalable identity management and to map cloud users' access requests with defined polices of cloud servers. In the proposed schema several components are provided to define access policies by cloud servers, to apply policies based on a structural and reliable ontology, to manage user identities and to semantically map access requests by cloud users with defined polices. Finally, the reliability and efficiency of this policy-based authentication schema have been evaluated by scientific performance, security and competitive analysis. Overall, the results show that this model has met defined demands of the research to enhance the reliability and efficiency of identity management in cloud computing environments."],["dc.identifier.doi","10.1109/NOF.2017.8251226"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/57383"],["dc.language.iso","en"],["dc.notes.status","final"],["dc.relation.conference","8th International Conference on the Network of the Future (NOF)"],["dc.relation.eventend","2017-11-24"],["dc.relation.eventlocation","London, UK"],["dc.relation.eventstart","2017-11-22"],["dc.relation.isbn","978-1-5386-0554-7"],["dc.relation.ispartof","8th International Conference on the Network of the Future (NOF)"],["dc.relation.orgunit","Gesellschaft für wissenschaftliche Datenverarbeitung"],["dc.title","A policy-based identity management schema for managing accesses in clouds"],["dc.type","conference_paper"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","374"],["dc.bibliographiccitation.lastpage","379"],["dc.contributor.author","Ernemann, C."],["dc.contributor.author","Hamscher, V."],["dc.contributor.author","Yahyapour, Ramin"],["dc.date.accessioned","2020-04-03T17:21:01Z"],["dc.date.available","2020-04-03T17:21:01Z"],["dc.date.issued","2004"],["dc.identifier.doi","10.1109/GRID.2004.13"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/63734"],["dc.relation.conference","5th IEEE/ACM International Workshop on Grid Computing"],["dc.relation.eventstart","2004-11"],["dc.relation.isbn","0-7695-2256-4"],["dc.relation.ispartof","GRID '04: Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing"],["dc.title","Benefits of Global Grid Computing for Job Scheduling"],["dc.type","conference_paper"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","267"],["dc.bibliographiccitation.lastpage","273"],["dc.contributor.author","Yang, Song"],["dc.contributor.author","Wieder, Philipp"],["dc.contributor.author","Yahyapour, Ramin"],["dc.date.accessioned","2019-02-08T09:13:33Z"],["dc.date.available","2019-02-08T09:13:33Z"],["dc.date.issued","2016"],["dc.description.abstract","In nowadays cloud computing systems, leveraging the virtualization technology, the customer's requested data computing or storing service is accommodated by a set of mutual-communicated Virtual Machines (VM) in a scalable and elastic manner. These VMs are placed in one or more datacenter nodes according to nodes' capacities, failure probabilities, etc. The VM placement availability refers to the probability that at least one set of the whole customer's requested VMs operates during the entire requested lifetime. The placed VMs should obey the agreed-upon availability, otherwise the cloud provider may face revenue loss. In this paper, we study the problem of placing at most H sets of k requested VMs on minimum number of datacenter nodes, such that the VM placement availability requirement is satisfied and each VM pair has a communication delay no greater than the specified. We prove that this problem is NP-hard. We subsequently propose an exact Integer Nonlinear Program (INLP) and an efficient heuristic to solve this problem. Finally, we conduct simulations to compare the proposed algorithms with two existing heuristics in terms of acceptance ratio, average number of used nodes and running time."],["dc.identifier.doi","10.1109/RNDM.2016.7608297"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/57536"],["dc.language.iso","en"],["dc.notes.status","final"],["dc.relation.conference","8th International Workshop on Resilient Networks Design and Modeling (RNDM)"],["dc.relation.eventend","2016-09-15"],["dc.relation.eventlocation","Halmstad, Sweden"],["dc.relation.eventstart","2016-09-13"],["dc.relation.isbn","978-1-4673-9023-1"],["dc.relation.ispartof","2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)"],["dc.relation.orgunit","Gesellschaft für wissenschaftliche Datenverarbeitung"],["dc.title","Reliable Virtual Machine placement in distributed clouds"],["dc.type","conference_paper"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]