Ali Haydar Özer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ali Haydar Özer has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Can Ozturan
Department of Computer Engineering Bogazici University Istanbul Turkey
3 shared publications Ayşenur Uslu
Department of Computer Engineering Faculty of Engineering, Marmara University Istanbul Turkey
1 shared publicationCan Özturan
1 shared publicationErbil Öner
1 shared publication- Mustafa Gamsiz
Department of Computer Engineering, Faculty of Engineering, Marmara University, Istanbul, Turkey
1 shared publication
Latest Publications
- Open Access
- 28 February 2025
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 37 (4-5)
A Multidimensional Virtual Resource Allocation Framework With Energy‐Aware Physical Resource Mapping for Green Cloud Computing
Cloud computing has seen a surge in demand, driven by its scalability and cost efficiency. However, the growing energy consumption of data centers poses significant environmental challenges. This study introduces a multidimensional resource allocation model designed to allocate and place virtual resources in an energy‐efficient manner using a combinatorial auction approach. Unlike current approaches, which rely on predefined virtual resources, this model allows users to request virtual resources with specific features and capacities tailored to their workflows. Furthermore, it incorporates a flexible bidding language that supports simultaneous requests for multiple resources using logical AND/OR relations. The model accommodates various data centers, allowing users to indicate their preferred locations. Through a combinatorial optimization problem, the model identifies the most resource‐efficient allocations and the most energy‐efficient placements. This study provides the mathematical definition of the model and the formulation of its optimization problem. Given the complexity of this problem, it explores several heuristic methods, including ant colony optimization and genetic algorithms. A test case generator is developed to simulate real‐life scenarios. The effectiveness of the model and the proposed heuristic solutions is assessed through various experiments, demonstrating that these methods can achieve near‐optimal solutions within reasonable timeframes.
- 28 February 2025
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 37 (4-5)
Open AccessA Multidimensional Virtual Resource Allocation Framework With Energy‐Aware Physical Resource Mapping for Green Cloud Computing
Cloud computing has seen a surge in demand, driven by its scalability and cost efficiency. However, the growing energy consumption of data centers poses significant environmental challenges. This study introduces a multidimensional resource allocation model designed to allocate and place virtual resources in an energy‐efficient manner using a combinatorial auction approach. Unlike current approaches, which rely on predefined virtual resources, this model allows users to request virtual resources with specific features and capacities tailored to their workflows. Furthermore, it incorporates a flexible bidding language that supports simultaneous requests for multiple resources using logical AND/OR relations. The model accommodates various data centers, allowing users to indicate their preferred locations. Through a combinatorial optimization problem, the model identifies the most resource‐efficient allocations and the most energy‐efficient placements. This study provides the mathematical definition of the model and the formulation of its optimization problem. Given the complexity of this problem, it explores several heuristic methods, including ant colony optimization and genetic algorithms. A test case generator is developed to simulate real‐life scenarios. The effectiveness of the model and the proposed heuristic solutions is assessed through various experiments, demonstrating that these methods can achieve near‐optimal solutions within reasonable timeframes.
- Open Access
- 25 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 18625-18648
An Energy-Aware Combinatorial Virtual Machine Allocation and Placement Model for Green Cloud Computing
Resource allocation is an important problem for cloud environments. This paper introduces an energy-aware combinatorial auction-based model for the resource allocation problem in clouds. The proposed model allows users of a cloud to submit their virtual resource requests as bids using the provided bidding language which allows complementarities and substitutabilities among those resources to be declared. The model finds the most profitable mutually satisfiable set of winning bids, and the corresponding allocation of virtual resources to the users while considering the placement of virtual resources to the available physical resources in the cloud by executing an optimization problem. During the optimization, the model also takes account of the non-linear energy requirements of the physical resources based on their utilization levels to find a placement with the lowest energy cost, thus, providing an energy-aware solution to the resource allocation problem. The associated optimization problem is formally defined and formulated using integer programming. Since the optimization problem is intractable, four heuristic methods are also proposed. To evaluate the performance of the model and the proposed heuristic methods, several experiments are conducted on a comprehensive test suite. The results demonstrate the benefits of the proposed model, and the high-quality solutions provided by the proposed methods.
- 25 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 18625-18648
Open AccessAn Energy-Aware Combinatorial Virtual Machine Allocation and Placement Model for Green Cloud Computing
Resource allocation is an important problem for cloud environments. This paper introduces an energy-aware combinatorial auction-based model for the resource allocation problem in clouds. The proposed model allows users of a cloud to submit their virtual resource requests as bids using the provided bidding language which allows complementarities and substitutabilities among those resources to be declared. The model finds the most profitable mutually satisfiable set of winning bids, and the corresponding allocation of virtual resources to the users while considering the placement of virtual resources to the available physical resources in the cloud by executing an optimization problem. During the optimization, the model also takes account of the non-linear energy requirements of the physical resources based on their utilization levels to find a placement with the lowest energy cost, thus, providing an energy-aware solution to the resource allocation problem. The associated optimization problem is formally defined and formulated using integer programming. Since the optimization problem is intractable, four heuristic methods are also proposed. To evaluate the performance of the model and the proposed heuristic methods, several experiments are conducted on a comprehensive test suite. The results demonstrate the benefits of the proposed model, and the high-quality solutions provided by the proposed methods.
- 1 November 2020
- Published by Marmara University in International Journal of Advances in Engineering and Pure Sciences
- Vol. 32 (4) , 374-389
İkinci El Kitap Ticareti için Elektronik Pazar Modeli, Yapıcı Sezgisel Yöntemler ve Karınca Kolonisi Optimizasyonu
Bu çalışmada, yeni veya ikinci el kitap ticaretinin yapıldığı ikincil kitap pazarları için bir elektronik pazar modeli önerilmektedir. Bu modelde katılımcılar kitap alış ve satış isteklerini eşzamanlı olarak elektronik pazar sistemine iletebilirler. Satışa çıkarılan her kitap tekil bir ürün olarak kabul edilir ve fiyatı satıcısı tarafından belirlenir. Önerilen model katılımcıların sisteme ilettikleri istekleri için bütçe sınırı koymalarına da izin verir. Böylece her bir katılımcı için katılımcının satın aldığı kitapların maliyeti ile sattığı kitaplardan elde ettiği gelir arasındaki fark bildirilen bütçe sınırı dahilinde kalır. Bu model ayrıca katılımcıların kendi tercihleri doğrultusunda birbirini ikame edebilir olarak gördükleri kitapları bir liste halinde belirtebilmelerini ve bu listeden en fazla bir adet kitap almalarını sağlayacak bir mekanizmaya da sahiptir. İlave olarak kullanıcılar dilerlerse istedikleri kitapları kişisel tercihlerine göre önceliklendirebilirler. Bu çalışmada, elektronik pazar modelinin matematiksel tanımı yapılmış ve ilgili kazanan belirleme problemi doğrusal tam sayı programı olarak formüle edilmiştir. Bu problem NP-Zor sınıfına ait olduğu için iki tane tek çözüm üzerinde çalışan yapıcı ve bir tane de popülasyon tabanlı Karınca Kolonisi Optimizasyonu yöntemi olmak üzere üç farklı sezgisel yöntem önerilmiş ve bu yöntemlerin performansları kapsamlı bir test paketi üzerinde ölçülmüştür. Sonuçlar, önerilen modelin yüksek sayıda katılımcıyı barındıran büyük ölçekli elektronik pazarlarda verimli bir şekilde kullanılabileceğini göstermektedir.
- 1 November 2020
- Published by Marmara University in International Journal of Advances in Engineering and Pure Sciences
- Vol. 32 (4) , 374-389
İkinci El Kitap Ticareti için Elektronik Pazar Modeli, Yapıcı Sezgisel Yöntemler ve Karınca Kolonisi Optimizasyonu
Bu çalışmada, yeni veya ikinci el kitap ticaretinin yapıldığı ikincil kitap pazarları için bir elektronik pazar modeli önerilmektedir. Bu modelde katılımcılar kitap alış ve satış isteklerini eşzamanlı olarak elektronik pazar sistemine iletebilirler. Satışa çıkarılan her kitap tekil bir ürün olarak kabul edilir ve fiyatı satıcısı tarafından belirlenir. Önerilen model katılımcıların sisteme ilettikleri istekleri için bütçe sınırı koymalarına da izin verir. Böylece her bir katılımcı için katılımcının satın aldığı kitapların maliyeti ile sattığı kitaplardan elde ettiği gelir arasındaki fark bildirilen bütçe sınırı dahilinde kalır. Bu model ayrıca katılımcıların kendi tercihleri doğrultusunda birbirini ikame edebilir olarak gördükleri kitapları bir liste halinde belirtebilmelerini ve bu listeden en fazla bir adet kitap almalarını sağlayacak bir mekanizmaya da sahiptir. İlave olarak kullanıcılar dilerlerse istedikleri kitapları kişisel tercihlerine göre önceliklendirebilirler. Bu çalışmada, elektronik pazar modelinin matematiksel tanımı yapılmış ve ilgili kazanan belirleme problemi doğrusal tam sayı programı olarak formüle edilmiştir. Bu problem NP-Zor sınıfına ait olduğu için iki tane tek çözüm üzerinde çalışan yapıcı ve bir tane de popülasyon tabanlı Karınca Kolonisi Optimizasyonu yöntemi olmak üzere üç farklı sezgisel yöntem önerilmiş ve bu yöntemlerin performansları kapsamlı bir test paketi üzerinde ölçülmüştür. Sonuçlar, önerilen modelin yüksek sayıda katılımcıyı barındıran büyük ölçekli elektronik pazarlarda verimli bir şekilde kullanılabileceğini göstermektedir.
- 1 November 2019
- Published by Elsevier in Computers & Operations Research
- Vol. 111, 116-129
A double auction based mathematical market model and heuristics for internet-based secondhand durable good markets
- 1 November 2019
- Published by Elsevier in Computers & Operations Research
- Vol. 111, 116-129
A double auction based mathematical market model and heuristics for internet-based secondhand durable good markets
- 24 September 2017
- Published by Polish Information Processing Society PTI in Annals of Computer Science and Information Systems
- Vol. 11, 459-467
An Electronic Market Model with Mathematical Formulation and Heuristics for Large-Scale Book Trading
- 24 September 2017
- Published by Polish Information Processing Society PTI in Annals of Computer Science and Information Systems
- Vol. 11, 459-467
An Electronic Market Model with Mathematical Formulation and Heuristics for Large-Scale Book Trading
- 28 April 2011
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 159 (8) , 812-825
A direct barter model for course add/drop process
- 28 April 2011
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 159 (8) , 812-825
A direct barter model for course add/drop process
- 1 March 2011
- Published by Elsevier in Electronic Commerce Research and Applications
- Vol. 10 (2) , 132-143
Multi-unit differential auction–barter model for electronic marketplaces
- 1 March 2011
- Published by Elsevier in Electronic Commerce Research and Applications
- Vol. 10 (2) , 132-143
Multi-unit differential auction–barter model for electronic marketplaces
- 1 September 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
An auction based mathematical model and heuristics for resource co-allocation problem in grids and clouds
Resource co-allocation problem is one of the challenging problems in grid and cloud environments. In this paper, we propose an auction based mathematical model for providing economically efficient allocations of resources in these environments. Our model improves our earlier multi-unit nondiscriminatory combinatorial auction model by introducing a penalty cost mechanism which results in better utilization of resources and hence increasing revenue depending on the application domain. The model is formulated using integer linear programming. Five new heuristic algorithms based on the well-known meta-heuristic techniques are proposed. An intelligent neighbor selection method is also introduced. The performances of the algorithms are compared with a commercial mixed integer programming (MIP) solver on generated test cases. The solutions provided by the evolutionary algorithm are as good as the solutions provided by the MIP solver for these test cases.
- 1 September 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
An auction based mathematical model and heuristics for resource co-allocation problem in grids and clouds
Resource co-allocation problem is one of the challenging problems in grid and cloud environments. In this paper, we propose an auction based mathematical model for providing economically efficient allocations of resources in these environments. Our model improves our earlier multi-unit nondiscriminatory combinatorial auction model by introducing a penalty cost mechanism which results in better utilization of resources and hence increasing revenue depending on the application domain. The model is formulated using integer linear programming. Five new heuristic algorithms based on the well-known meta-heuristic techniques are proposed. An intelligent neighbor selection method is also introduced. The performances of the algorithms are compared with a commercial mixed integer programming (MIP) solver on generated test cases. The solutions provided by the evolutionary algorithm are as good as the solutions provided by the MIP solver for these test cases.
- 1 January 2009
- Published by Elsevier in Computers & Operations Research
- Vol. 36 (1) , 196-208
A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction
- 1 January 2009
- Published by Elsevier in Computers & Operations Research
- Vol. 36 (1) , 196-208
A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction