Bita Fatemipour

Bita Fatemipour

Auto-generated profile, based on publicly available information

Bita Fatemipour

Carleton University

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 October 2019 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
FTFarzad Tashtarian
Farzad Tashtarian
MZMohamed Faten Zhani
Mohamed Faten Zhani
BFBita Fatemipour
Bita Fatemipour
DYDelaram Yazdani
Delaram Yazdani
Service Function Chain (SFC) provides an end-to-end service by processing traffic flow through a series of Virtual Network Functions (VNFs) in a specific order. Satisfying user’s demands (e.g, end-to-end delay) on one hand and minimizing the cost of SFC deployment in terms of energy and resource on the other hand, introduces VNFs placement as a crucial issue that is receiving significant attention by researchers. To address this problem and boost the performance of SFC, different techniques such as Network Function (NF) distribution, NF parallelism and optimal resource allocation have been utilized. Applying these mechanisms imposes other costs which must be taken into account by network providers. In this paper, we introduce CoDeC as a Cost-effective and Delay-aware resource allocation approach. By having user defined end-to-end threshold and using aforementioned mechanisms, CoDeC tries to place the requested VNFs with the minimum cost of deployment, distribution, parallelism and energy. Therefore, we formulate the addressed problem in form of Mixed Integer linear Programming (MILP) model. We then show that the problem is NP-complete and suffers from high time complexity in large-scale scenarios. Thus, a heuristic algorithm is introduced to determine a near-optimal solution in a reasonable amount of time. Our simulation results show that CoDeC achieves better performance in term of cost and acceptance rate compared to using each mechanism individually.

1 August 2024 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
BFBita Fatemipour
Bita Fatemipour
ZZZhe Zhang
Zhe Zhang
MSMarc St-Hilaire
Marc St-Hilaire
Data centers have undergone significant expansions in recent years, as cloud service providers seek to improve the quality of service and reduce operational costs. Cloud providers are investing heavily in inter-data center wide-area networks, which help to transport traffic between geographically distributed data centers. However, efficient workload management in complex large-scale networks with a dynamic environment is challenging. In this regard, researchers have developed various solutions to address different challenges for data transfer in inter-data center networks. In this paper, we present a comprehensive review of recent strategies and optimization schemes proposed in the literature to optimize data transfer in geographically distributed data centers. This review paper examines the challenges of data delivery and classifies recent existing solutions for addressing the issues based on communication patterns, objectives, proposed communication frameworks, and evaluation methods. In this study, we provide valuable insights into the current challenges and identify several promising research directions that require significant research endeavors in the future. The findings of this study are useful for researchers and practitioners interested in optimizing data transfer in inter-data center networks.

1 January 2026 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
BFBita Fatemipour
Bita Fatemipour
ZZZhe Zhang
Zhe Zhang
MSMarc St-Hilaire
Marc St-Hilaire