![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Muhammad Junaid Arshad
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j11]Amjad Hussain Zahid
, Abdullah M. Iliyasu
, Musheer Ahmad
, Mian Muhammad Umar Shaban, Muhammad Junaid Arshad, Hussam S. Alhadawi
, Ahmed A. Abd El-Latif
:
A Novel Construction of Dynamic S-Box With High Nonlinearity Using Heuristic Evolution. IEEE Access 9: 67797-67812 (2021) - [j10]Amjad Hussain Zahid, Hamza Rashid, Mian Muhammad Umar Shaban, Soban Ahmad, Ehtezaz Ahmed, Muhammad Amjad, Muhammad Azfar Tariq Baig, Muhammad Junaid Arshad, Muhammad Nadeem Tariq, Muhammad Waseem Tariq, Muhammad Ayaz Zafar, Abdul Basit:
Dynamic S-Box Design Using a Novel Square Polynomial Transformation and Permutation. IEEE Access 9: 82390-82401 (2021) - [j9]Amjad Hussain Zahid
, Musheer Ahmad
, Ahmed Alkhayyat
, Muhammad Junaid Arshad, Mian Muhammad Umar Shaban, Naglaa F. Soliman
, Abeer D. Algarni:
Construction of Optimized Dynamic S-Boxes Based on a Cubic Modular Transform and the Sine Function. IEEE Access 9: 131273-131285 (2021) - [j8]Hamza Sajjad Ahmad
, Muhammad Junaid Arshad, Muhammad Sohail Akram
:
Device Authentication and Data Encryption for IoT Network by Using Improved Lightweight SAFER Encryption With S-Boxes. Int. J. Embed. Real Time Commun. Syst. 12(3): 1-13 (2021) - 2020
- [j7]Hasnain Ahmed
, Muhammad Junaid Arshad, Shah Muhammad, Sarfraz Ahmad, Amjad Hussain Zahid:
Queue length-based load balancing in data center networks. Int. J. Commun. Syst. 33(14) (2020)
2010 – 2019
- 2019
- [j6]Sarfraz Ahmad
, Muhammad Junaid Arshad:
Enhancing Fast TCP's Performance Using Single TCP Connection for Parallel Traffic Flows to Prevent Head-of-Line Blocking. IEEE Access 7: 148152-148162 (2019) - [j5]Hasnain Ahmed
, Muhammad Junaid Arshad
:
Queue length feedback-based solution of TCP Incast in data center networks. Turkish J. Electr. Eng. Comput. Sci. 27(3): 2068-2080 (2019) - [j4]Amjad Hussain Zahid, Muhammad Junaid Arshad, Musheer Ahmad
:
A Novel Construction of Efficient Substitution-Boxes Using Cubic Fractional Transformation. Entropy 21(3): 245 (2019) - [j3]Amjad Hussain Zahid, Muhammad Junaid Arshad:
An Innovative Design of Substitution-Boxes Using Cubic Polynomial Mapping. Symmetry 11(3): 437 (2019) - [j2]Hasnain Ahmed
, Muhammad Junaid Arshad:
Buffer Occupancy-Based Transport to Reduce Flow Completion Time of Short Flows in Data Center Networks. Symmetry 11(5): 646 (2019) - 2010
- [j1]Muhammad Junaid Arshad, Mohammad Saleem:
A simulation-based study of FAST TCP compared to SCTP: Towards multihoming implementation using FAST TCP. J. Commun. Networks 12(3): 275-284 (2010)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint