default search action
Bahador Bakhshi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j16]Bahador Bakhshi
, Josep Mangues-Bafalluy, Jorge Baranda:
Multi-provider NFV network service delegation via average reward reinforcement learning. Comput. Networks 224: 109611 (2023) - [j15]Yaser Taj, Bahador Bakhshi
Reliable and infrastructure-independent routing for the internet of vehicles. Int. J. Commun. Syst. 36(8) (2023) - [j14]Ricardo Martínez
Resource Abstractions in NFV Management and Orchestration: Experimental Evaluation. IEEE Trans. Netw. Serv. Manag. 20(1): 608-624 (2023) - 2022
- [j13]Fatemeh Yaghoubpour
End-to-end delay guaranteed Service Function Chain deployment: A multi-level mapping approach. Comput. Commun. 194: 433-445 (2022) - [j12]Claudio Casetti
ML-Driven Provisioning and Management of Vertical Services in Automated Cellular Networks. IEEE Trans. Netw. Serv. Manag. 19(3): 2017-2033 (2022) - [c10]Sarang Kahvazadeh, Hamzeh Khalili
Vertical-oriented 5G platform-as-a-service: user-generated content case study. FNWF 2022: 706-711 - [c9]Bahador Bakhshi, Josep Mangues-Bafalluy:
Model-Based Reinforcement Learning Framework of Online Network Resource Allocation. ICC 2022: 4456-4461 - [c8]Carlos Ruiz De Mendoza
Near Optimal VNF Placement in Edge-Enabled 6G Networks. ICIN 2022: 136-140 - [i6]Sarang Kahvazadeh, Hamzeh Khalili, Rasoul Nikbakht Silab, Bahador Bakhshi, Josep Mangues-Bafalluy:
Vertical-oriented 5G platform-as-a-service: user-generated content case study. CoRR abs/2211.14078 (2022) - 2021
- [j11]Ali Zamani, Bahador Bakhshi
An efficient load balancing approach for service function chain mapping. Comput. Electr. Eng. 90: 106890 (2021) - [j10]Behrooz Farkiani
Prioritized Deployment of Dynamic Service Function Chains. IEEE/ACM Trans. Netw. 29(3): 979-993 (2021) - [c7]Bahador Bakhshi, Josep Mangues-Bafalluy, Jorge Baranda:
R-Learning-Based Admission Control for Service Federation in Multi-domain 5G Networks. GLOBECOM 2021: 1-6 - [i5]Fatemeh Yaghoubpour, Bahador Bakhshi, Fateme Seifi:
End-to-End Delay Guaranteed SFC Deployment: A Multi-level Mapping Approach. CoRR abs/2102.06090 (2021) - [i4]Bahador Bakhshi, Josep Mangues-Bafalluy:
R-Learning Based Admission Control for Service Federation in Multi-domain 5G Networks. CoRR abs/2103.02964 (2021) - [i3]Bahador Bakhshi, Josep Mangues-Bafalluy:
Model-Based Reinforcement Learning Framework of Online Network Resource Allocation. CoRR abs/2110.09236 (2021) - [i2]Carlos Ruiz De Mendoza, Bahador Bakhshi, Engin Zeydan, Josep Mangues-Bafalluy:
Near Optimal VNF Placement in Edge-Enabled 6G Networks. CoRR abs/2111.07849 (2021) - [i1]Bahador Bakhshi, Josep Mangues-Bafalluy, Jorge Baranda:
Multi-Provider NFV Network Service Delegation via Average Reward Reinforcement Learning. CoRR abs/2112.13093 (2021)
2010 – 2019
- 2019
- [j9]Behrooz Farkiani
Stochastic virtual network embedding via accelerated Benders decomposition. Future Gener. Comput. Syst. 94: 199-213 (2019) - [j8]Narges Arastouie
Near-optimal online routing in opportunistic networks. Int. J. Commun. Syst. 32(3) (2019) - [j7]Behrooz Farkiani
A Fast Near-Optimal Approach for Energy-Aware SFC Deployment. IEEE Trans. Netw. Serv. Manag. 16(4): 1360-1373 (2019) - [c6]Jerico Moeyersons
Enabling Emergency Flow Prioritization in SDN Networks. CNSM 2019: 1-8 - 2018
- [j6]Mohammad Khaksar Haghani, Bahador Bakhshi
Multi-objective embedding of software-defined virtual networks. Comput. Commun. 129: 32-42 (2018) - 2016
- [c5]Ehsan Mohammadpour, Bahador Bakhshi:
RLA-ENAR: A realistic near-optimal energy-aware routing. SoftCOM 2016: 1-5 - 2015
- [j5]Seyed Iman PourEmami, Bahador Bakhshi
On the trade-off between power-efficiency and blocking probability in fault-tolerant WDM networks. J. Netw. Comput. Appl. 58: 255-266 (2015) - 2013
- [j4]Bahador Bakhshi
On the performance and fairness of dynamic channel allocation in wireless mesh networks. Int. J. Commun. Syst. 26(3): 293-314 (2013) - [j3]Bahador Bakhshi
A novel approach for the performance bound of QoS-aware data networks under greedy CAC policy. Perform. Evaluation 70(2): 90-113 (2013) - 2011
- [j2]Bahador Bakhshi
On-line joint QoS routing and channel assignment in multi-channel multi-radio wireless mesh networks. Comput. Commun. 34(11): 1342-1360 (2011) - [j1]Bahador Bakhshi
Complexity and design of QoS routing algorithms in wireless mesh networks. Comput. Commun. 34(14): 1722-1737 (2011) - 2010
- [c4]Bahador Bakhshi, Siavash Khorsandi:
Node Connectivity Analysis in Multi-Hop Wireless Networks. WCNC 2010: 1-6
2000 – 2009
- 2008
- [c3]Bahador Bakhshi, Siavash Khorsandi:
A Maximum Fair Bandwidth Approach for Channel Assignment in Wireless Mesh Networks. WCNC 2008: 2176-2181 - [c2]Hamed Janzadeh, Kaveh Fayazbakhsh, Bahador Bakhshi, Mehdi Dehghan:
A Novel Incentive-Based and Hardware-Independent Cooperation Mechanism for MANETs. WCNC 2008: 2462-2467 - 2007
- [c1]Bahador Bakhshi, Babak Sadeghiyan:
A Timing Attack on Blakley's Modular Multiplication Algorithm, and Applications to DSA. ACNS 2007: 129-140
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: