Skip to Main Content

## IEEE Account

## Purchase Details

## Profile Information

- Communications Preferences
- Profession and Education
- Technical Interests
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Privacy & Opting Out of Cookies

- Architecture and Design
- Asian and Pacific Studies
- Business and Economics
- Classical and Ancient Near Eastern Studies
- Computer Sciences
- Cultural Studies
- Engineering
- General Interest
- Geosciences
- Industrial Chemistry
- Islamic and Middle Eastern Studies
- Jewish Studies
- Library and Information Science, Book Studies
- Life Sciences
- Linguistics and Semiotics
- Literary Studies
- Materials Sciences
- Mathematics
- Social Sciences
- Sports and Recreation
- Theology and Religion
- Publish your article
- The role of authors
- Promoting your article
- Why publish with De Gruyter
- How to publish with De Gruyter
- Our book series
- Our subject areas
- Product information
- Tools & resources
- Repository Policy
- Free access policy
- Open Access agreements
- Database portals
- For Authors
- Customer service
- Human Resources
- Journal Management
- How to join us
- Working at De Gruyter
- Mission & Vision
- De Gruyter Foundation
- De Gruyter Ebound
- Our Responsibility
- Partner publishers

Your purchase has been completed. Your documents are now available to view.

## Research on the application of search algorithm in computer communication network

## 1 Introduction

Capacity and flow distribution in the computer communication network.

## 2 Literature review

## 3 Materials and methods

## 3.1 Network communication optimization in search algorithms

The structure of the taboo table.

## 3.2 Search algorithm

In the discrete domain, the harmonic disturbance operation is performed according to equation ( 2 ):

Dynamically adjust HMCR and PAR according to formulas ( 3 ) and ( 4 ).

Use the three rules of HMCR, PAR and random selection to generate each harmony variable.

The algorithm ends when the conditions for the end of the algorithm are met.

## 4 Computer simulation experiment results and discussion

4.1 computer simulation experiment.

## 4.2 Analysis of simulation results

Experimental results of computer simulation under different packet lengths

Computer simulation results of the weighting coefficients of different unit grouping delay costs.

Computer simulation results of different weighted coefficients of fixed costs.

Computer simulation results of different variable cost weighting coefficients.

## 5 Conclusion

Conflict of interest: The authors declare that they have no competing interest.

Informed consent: Informed consent was obtained from all individuals included in this study.

© 2022 Hua Ai et al ., published by De Gruyter

This work is licensed under the Creative Commons Attribution 4.0 International License.

## Supplementary Materials

Please login or register with De Gruyter to order this product.

## Journal and Issue

## Procedia Computer Science

## Cited by (0)

## The Mixed Blessings of Search Algorithms as Research Tools

## What is a Search Algorithm?

## A Vital Research Tool

## Failing to Keep-Up

## From Searching to Predicting

Rate this article Cancel Reply

Your email address will not be published.

## Enago Academy's Most Popular

9 Effective Tips for Publishing Thesis As a Book

While they may look alike, a thesis is not a book! The process of publishing…

## 4 Best Essay Writing Services in 2022 – A Comparative Study

If we are all asked to narrate how school life is, we all would probably…

What Is a Preprint? 5 Step Guide to Successfully Publish Yours!

The article is also available in: Turkish, Spanish, Portuguese, and Russian “I think you should…

## Interesting Science vs. Sound Science – All About the Rigor and Transparency Index (RTI)

This guest post is drafted by Martijn Roelandse and Anita Bandrowski from SciCrunch. It highlights…

## A Guide to Academic Book Writing and Publishing

Types of academic books How to write a compelling book How to publish an edited…

Interesting Science vs. Sound Science – All About the Rigor and Transparency…

How Can Researchers Get the Most From Wiley Online Library?

We hate spam too. We promise to protect your privacy and never spam you.

For what are you most likely to depend on AI-assistance?

## We apologize for the inconvenience...

https://ioppublishing.org/contacts/

Please solve this CAPTCHA to request unblock to the website

## IMAGES

## VIDEO

## COMMENTS

Abstract: This paper presents the review of certain important and well discussed traditional as well as proposed search algorithms with respect to their

As it is well known that every sorted or unsorted list of elements requires searching technique so many search algorithms have been invented.

A genetic algorithm-based tabu search methodology is proposed to solve the ... The article analyses a large number of computer simulation

International Research Journal of Engineering and Technology (IRJET) ... This paper also ... Key Words: Searching algorithms, binary search, linear.

Original Research Article. Search algorithms, hidden labour and information control. Paško Bilic. Abstract. The paper examines some of the processes of the

An experimental comparison of evolutionary algorithms and random search algorithms for the optimal control problem is carried out.

We focus on Two search algorithms are introduced to learn the structure of a Bayesian network in the paper. The heuristic search algorithm is simple and

The article is also available in: Turkish, Spanish, Portuguese, and Russian “I think you should… February 3, 2022 4 minutes. Rigor.

Paper • The following article is Open access ... [3] Kareem B S. 2016 Matrix Search Algorithm Using Binary Search Trees Research & Reviews: Journal of

3: Sorting and Searching. Reading, MA: Addiso. Wesley,1973 Structures.. [2]Quadratic Research Paper International Journal of. Computer Applications (975