Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userStudy the effect of congestion control in improving the performance of computer networks algorithms
دراسة تأثير خوارزميات التحكم بالازدحام في تحسين أداء الشبكات الحاسوبية
2502
0 81
0
(
0
)
Authors
محمد حجازية( باحث )
Created by
Shamra Editor
Ask ChatGPT about the research
تطورت شبكات الحاسوب كثيراً خلال السنوات القليلة الماضية من ناحية التزايد الكبير في كميات البيانات المتبادلة عبر الشبكة بسبب تزايد عدد الأجهزة المترابطة، و التي يمكن ان تتبادل البيانات في اطار الشبكة و هذا ما ادى الى ظهور ما يُعرف بمشكلات الازدحام Congestion و أظهرت دراسات حول بعض هذه المشاكل أن السبب الأكبر يقع في تنفيذ قواعد الإرسال، و هذا ادى الى ظهور أنواع متعددة من البروتوكولات في أنظمة الاتصالات و شبكات الحواسيب لضرورة التعامل مع الأنظمة الحاسوبية المختلفة, و بذلك ظهرت أيضاً الحاجة إلى ضرورة وجود آليات للتمييز بين الحواسيب العديدة في الشبكة الواحدة , و العديد من التطبيقات ضمن النظام الواحد : و العديد من نسخ هذه التطبيقات , حيث يسبب ذلك في كثير من الأحيان أخطاء على مستوى البت الخانة (bit) و مستوى الرزم ((packet ,رزم مفقودة ,رزم مكررة , رزم وردت بشكل عشوائي, و الأهم ظهور الازدحام في الشبكة. يهدف هذا البحث الى تحديد كيفية تحسين أداء الشبكة بالتخلص من الازدحام و ذلك بالاستفادة من الخوارزميات المستخدمة في تجنب الازدحام الذي قد يحصل في الشبكات التي تعتمد بروتوكول TCP حيث أن الهدف من هذه الخوارزميات هو الوصول الى الاستقرار في الشبكة من خلال العمل على تحقيق مبدأ حفظ الرزمة. و لذلك و ضمن هذا الاطار أيضاً تم دراسة، و مقارنة بعض الخوارزميات المستخدمة في تجنب الازدحام بشكل عام دون الاعتماد على بروتوكول معين او صنف خدمة محدد .
Computer networks have evolved considerably in the past few years of big increases in mutual amounts of data across the network hand because of the increasing number of interconnected devices, which can exchange data as part of the network and this is what led to the emergence of what is known as the problems of congestion Studies showed about some of these problems that the largest reason is involved in the implementation of the transmission rules, and this led to the urgent of multiple types of protocols in the computer networks that needs to deal with different computer and communication systems, and many other applications, which often causes errors at the level of the bit and level of the packets, missing packets, duplicate packets, randomly received packets, and most importantly the appeared congestion in the network. This research aims to determine how to improve the performance of the network to get rid of the congestion by using advantages of the algorithms used to avoid congestion that may occur in the networks that rely TCP protocol . The goals of these algorithms is to reach stability in the network by working to achieve the principle of package saving. Also within this scope it has been studied, and compared some of the algorithms that used to avoid congestion in general, without relying on a specific protocol or specific service category.
References used
SALLY FLOYD. TCP and Explicit Congestion Notification, ACM Computer Communications Review, October 1994, p. 10-23
HARRIS INTERACTIVE. P.C. and Internet Use Continue to Grow at Record Pace. Press Release, February 7, 2010
FLOYD S.; HENDERSON, T.. The New Reno Modification to TCP’s Fast Recovery Mechanism, April 1999, RFC 2582
rate research
Read More
Nowadays, wireless networks are spreading more and more. The majority of installed networks have become wireless due to the simplicity of installation; where they do not need an infrastructure. This does not mean that the role of the wired networks i
s being eliminated. Instead, the wireless networks
are considered as a complementary of the wired networks. With all types of networks from personal and local area networks (PAN and LAN) to wide area networks (WAN) especially the Internet,
research has become oriented to focus on the quality of service (QoS) and the integration among all these networks taking into account the Internet which is considered as the backbone for each network that wants to exchange the information with any other network all over the world. In our research, we take into account the quality of service in the broadband networks such as the WiMax network (Worldwide Interoperability for Microwave Access) with IEEE 802.16e standard which covers cities and supports the mobility. This network can be used to interconnect the rural zones with the center of cities, this kind is called point-to-point, or it can be used to cover the cities and is called point-tomultipoint,
The last one is used to interconnect different wireless networks especially the local one which has infrastructure (Wi-fi: Wireless Fidelity) and networks which have many users and called
hotspots. However, the cells of Wi Max in the cities are called hotzones.
We propose a system model that performs the load balancing process between the base stations of WiMax network. This means, the proposed load balancing algorithm exchanges the terminals between the adjacent base stations in order to make the throughput in each base station equals to the throughput
in the others. This will improve the performance of the overall network and increase the available bandwidth for each terminal; in addition, this will increase the number of terminals which can be
served. On one side, these advantages return to the subscribers, they also return to the operator on the other side, not to mention the good renown that the operator will get from subscribers that will make more subscribers join to this network.
The proposed load balancing system can be centralized; implemented in a centralized server connected
to all base stations or distributed system implemented in each base station. The load balancing algorithm which consists of several steps is placed in a controller that achieves it. The load balancing process and the handover procedure have to be fast enough in order to prevent the adverse effect on
the quality of service especially for the real-time applications users.
The location of wireless sensor nodes located in the center is necessary for applications
where information about the site is important information such as security, protection,
object tracking and other applications.
localization algorithms are c
lassified into two types: Range-based and Range-free. The
study focused on Range-free localization algorithms because they are less expensive in
terms of hardware requirements.
The MATLAB was used to simulate the algorithms, whose performance was evaluated by
changing the number of network nodes, the number of Anchor nodes, and the contract area
of communication in order to illustrate performance differences in terms of localization
error.
The results showed the superiority of the amorphous algorithm, achieving high localization
accuracy and lower cost for the number of Anchor nodes needed to achieve a small error.
This paper presents the effects of enhancing control systems' work conditions on active power filter performance in improving power quality. We will convert the changeable inputs of the controllers into static ones. The high harmonics' amplitude will
be the set-values of the controllers, so the active filter reduces them into zero and then THD will be in its permitted limits.
The Branch and Bound algorithms which are refereed to as B & B are
commonly used to solve NP - hard combinatorial optimization problems.
Although these algorithms were efficient, the size of problems which can solved
and proved the optimality of s
olution by these algorithms was limited, because
of the limitation of computers capabilities although of it’s highly development.
When the parallel programming 46
and Multiprocessors computers were appeared, the researcher thought to
use the capabilities of these techniques and machines to increase the size of
solved problems. Three main anomalies may occur when the parallelism is
used.
This research aimed to design a new model of Branch and Bound
algorithms in order to analyze the performance. This model based on a new
rule to choose the best node among the equal evaluation node. Tight bounds of
each rules were computed and proved the ability to achieve it. Sufficient and
necessary condition anomalous are given regarding the predisposition for each
of the three classes of behavior.
In this research, we discussed and compared the results of further
relaxations on the assumptions used in branch and bound algorithms. We
suggested using the asynchronous models to have the utmost benefit of the
capabilities of parallel programming.
Application-Level Multicast (ALM) has been proposed as an alternative solution to
overcome the lack of deployment of the IP Multicast group communication model. It
builds an overlay tree consisting of end-to-end unicast connections between end-host
s
based on the collaboration of group members with each other. The efficiency of the
constructed overlay tree depends entirely on the honesty and on the cooperation of all
participating members. However such behaviour can not be guaranteed and some selfish
and non-cooperative nodes may take profit from the honesty of other members in the
overlay.
Recently, many researchers have been investigating the impact of selfishness of
nodes in the overlay multicast. Our contribution in this paper is to describe in detail the
basic algorithms used to construct the overlay tree, and evaluate the impact of cheating
nodes on the stability and on the performance of constructed overlay tree using these
algorithms.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
