Covering over 60% of households, 100% of communes and wards; 100% of villages covered by mobile or Internet; over 90% of mobile phone users using smartphones; over 95% of families using at least 01 smart device. Developing high-speed Internet, secure digital infrastructure, meeting the needs of connection and big data processing.
Direct telecommunications businesses to deploy plans to ensure communication before, during and after major national events.
Research and propose pilot mechanisms to promote the development of new services, expand new spaces for telecommunications businesses: deploy mobile money and new digital infrastructures such as electronic identification, cloud, AI, etc.
Issue the Program to promote and support IPv6 conversion for state agencies (IPv6 For Gov) for the period 2021-2025 to enhance the application of IPv6 on state agency networks and services. Expand domestic Internet connectivity through direct peer-to-peer connections, connecting with Internet exchange points (IXP) to the national Internet exchange point VNIX.
Continue to implement measures to thoroughly handle telecommunications waste (junk SIMs, junk calls, fake calls), protect consumer rights with the aim of developing a healthy and sustainable market.
Summary of the implementation of the Law on Telecommunications; Law on Frequency; implementation of the Decree on collection of fees for granting the right to use radio frequencies, auction, licensing, and transfer of the right to use radio frequencies for auctioned frequency bands.
Field of Information Technology Application
Continue to focus on improving national rankings on e-Government and digital government, and soon complete the development of the e-Government development strategy towards digital government.
Research and develop policies on open data; guide state agencies to develop data sharing solutions; develop integrated platforms
Integrate, connect, and share national data for joint exploitation and use; facilitate data commercialization.
Successfully complete the objectives set out in Resolution No. 17/NQ-CP dated March 7, 2019 of the Government on a number of key tasks and solutions for e-Government development in the 2019-2020 period, with a vision to 2025, and the Prime Minister's instructions. Focus on implementing: Providing online public services at levels 3 and 4, striving to apply 100% to practical public services for the people; applying digital technology to make processes and procedures transparent; mobilizing the participation and contribution of businesses and people in government building; connecting and sharing shared databases to serve state management.
Support the formation of at least 3 smart cities, gradually moving towards forming a number of smart urban chains in 3 key economic regions (North, Central, South) and deploying 5G coverage in these cities.
Perfecting the legal environment for digital government, specifically: Researching and amending the Law on Electronic Transactions; Researching and amending or promulgating a Decree replacing Decree No. 43/2011/ND-CP of the Government regulating the provision of information and online public services on the websites or portals of state agencies; Developing a Prime Minister's Decision approving: Project on developing Vietnam's digital economy to 2025, with a vision to 2030; Project on raising awareness, training and developing human resources for digital transformation to 2025, with a vision to 2030; Developing a Prime Minister's Decision approving the National Data Strategy for the period 2021 - 2025, with a vision to 2030.
In 2021, ministries, branches and localities need to complete the issuance of the Digital Transformation Program for their sectors, fields and localities according to Decision No. 749/QD-TTg dated June 3, 2020 approving the National Digital Transformation Program to 2025, with a vision to 2030. 100% of communes have at least 01 digital service (health, education, e-commerce, ...) serving directly.
receive people. The Ministry of Information and Communications must be the leading ministry in digital transformation in all areas of the Ministry; continue to preside over the organization of launching Make in Vietnam Digital Platforms to serve national digital transformation.
Continue to deploy and replicate the model of pilot ministries, pilot provinces, and pilot communes on digital transformation; localities prioritize allocating funding from 1-2% of the budget expenditure ratio at all levels (central budget and local budget) for the construction and development of e-Government. Implement the goals set out in the Digital Government Development Strategy for the 2021-2025 period, with a vision to 2030, after being signed and promulgated by the Prime Minister.
Accelerate and comprehensively implement the digital transformation support program for Vietnamese enterprises, focusing on small and medium enterprises.
ICT Industry Sector
The goal is to promote Made in Vietnam technology products. Vietnam must become a technology country, master technology and develop products, not only for the domestic market but also the international market. Develop Vietnamese digital technology enterprises. Apply digital technology to all aspects of economic - cultural - social life.
Focus resources on research and development of IT products and services, telecommunications electronics, including: 5G network equipment, 5G terminals, broadband network equipment, smartphones, IoT devices, smart cameras, smart household devices; Digital platforms, products, solutions, services for digital government, digital transformation in priority areas such as healthcare, education, finance - banking, agriculture, transportation, construction, energy, resources and environment. Pilot research to establish a digital university focusing on training in digital technology. The number of concentrated IT parks and members of the Quang Trung Software Park Chain will reach 9 parks by 2021.
Carry out the tasks assigned in Directive No. 01/CT-TTg dated January 14, 2020 of the Prime Minister on promoting the development of Vietnamese digital technology enterprises. Focus on developing 4 types of enterprises: Enterprises doing
core technology owners, product development enterprises, implementation enterprises and innovative startups with the goal that by 2025 Vietnam will have from 70,000 to 100,000 digital technology enterprises.
Building and perfecting mechanisms and policies to create conditions for the development of the information technology, electronics and telecommunications industry, such as: Researching and developing the Law on Digital Technology Development to replace the Law on Information Technology to promote the development of digital technology. Program for the development of the IT, electronics and telecommunications industry until 2025, with a vision to 2030, proactively participating in the Fourth Industrial Revolution.
Put into operation the Vietnam 4.0 Industrial Revolution Center in association with the World Economic Forum (WEF) and simultaneously implement a number of projects and tasks to build 4.0 Industrial Revolution policies in cooperation with WEF.
Developing a digital technology business ecosystem; Organizing activities to connect supply and demand, connecting large enterprises, small and medium enterprises, innovative startups; Establishing a Vietnam Digital Technology Business Development Fund with capital mobilized from socialization.
Field of Journalism and Media
The goal of the press and media is to honestly reflect the mainstream of society, spread positive energy, contribute to creating consensus, creating social trust, and arousing the aspiration for a strong and prosperous Vietnam, contributing to creating spiritual strength for the country to break through and rise up. The mission of the press is very great in the new period when Vietnam aims to become a high-income developed country by the middle of the century.
Press management must go hand in hand with the development of revolutionary press. Especially the press support project for the period 2021-2025, building key press agencies that are truly key. Support the press in digital transformation. Press activities must be in line with its principles and purposes. Thoroughly resolve the situation of harassment; turn into newspapers, magazines, news sites, and social networks; summarize and rectify joint activities.
Table 3.1 : Specific figures in the goals of the information and communication industry in the coming period
Field
Market size in 2020 | Growth yearly | Target increase growth in the next 5 years | Revenue/Market Size Target 2025 | Global ranking target | |
Postal | 1.58 billion USD | 30% | Over 30% | 6-8 billion USD | From top 50 top 40 |
Telecommunications | 16.5 billion USD | 8% | 8-10% | 25 billion USD | Digital/telecom infrastructure from 80 into the top 30 |
IT Applications | 10 billion USD | 20-30% | 25-30 billion USD | Digital Government Ranking from 86 to top 50 | |
Information security | 100 million USD | 25% | 35-40% | 500 million USD | Top 50 up top 30 |
Digital Economy | 8.2% of GDP | 15-20% | 20-25% | 20% of GDP | |
ICT Industry | 123 billion USD | 15.2% | 2-3 times GDP | 250-300 billion USD |
Maybe you are interested!
-
Developing a team of information security lecturers at defense and security universities in the current context - 27 -
Building a reasonable capital structure to improve financial quality for T&H Information Technology and Telecommunication Joint Stock Company - 2 -
Vinaphone Mobile Information Service Development Goals of Vnpt Thua Thien Hue Business Center 2021 - 2025. -
Solutions for tourism development in Tien Lang - 10
zt2i3t4l5ee
zt2a3gstourism, tourism development
zt2a3ge
zc2o3n4t5e6n7ts
- District People's Committees and authorities of communes with tourist attractions should support, promote, and provide necessary information to people, helping them improve their knowledge about tourism. Raise tourism awareness for local people.
*
* *
Due to limited knowledge and research time, the thesis inevitably has shortcomings. Therefore, I look forward to receiving guidance from teachers, experts as well as your comments to make the thesis more complete.
Chapter III Conclusion
Through the issues presented in Chapter II, we can come to some conclusions:
Based on the strengths of available tourism resources, the types of tourism in Tien Lang that need to be promoted in the coming time are sightseeing and resort tourism, discovery tourism, weekend tourism. To improve the quality and diversify tourism products, Tien Lang district needs to combine with local cultural tourism resources, at the same time combine with surrounding areas, build rich tourism products. The strengths of Tien Lang tourism are eco-tourism and cultural tourism, so developing Tien Lang tourism must always go hand in hand with restoring and preserving types of cultural tourism resources. Some necessary measures to support and improve the efficiency of exploiting tourism resources in Tien Lang are: strengthening the construction of technical facilities and labor force serving tourism, actively promoting and advertising tourism, and expanding forms of capital mobilization for tourism development.
CONCLUDE
I Conclusion
1. Based on the results achieved within the framework of the thesis's needs, some basic conclusions can be drawn as follows:
Tien Lang is a locality with great potential for tourism development. The relatively abundant cultural tourism resources and ecological tourism resources have great appeal to tourists. Based on this potential, Tien Lang can build a unique tourism industry that is competitive enough with other localities within Hai Phong city and neighboring areas.
In recent years, the exploitation of the advantages of resources to develop tourism and build tourist routes in Tien Lang has not been commensurate with the available potential. In terms of quantity, many resource objects have not been brought into the purpose of tourism development. In terms of time, the regular service time has not been extended to attract more visitors. Infrastructure and technical facilities are still weak. The labor force is still thin and weak in terms of expertise. Tourism programs and routes have not been organized properly, the exploitation content is still monotonous, so it has not attracted many visitors. Although resources have not been mobilized much for tourism development, they are facing the risk of destruction and degradation.
2. Based on the results of investigation, analysis, synthesis, evaluation and selective absorption of research results of related topics, the thesis has proposed a number of necessary solutions to improve the efficiency of exploiting tourism resources in Tien Lang such as: promoting the restoration and conservation of tourism resources, focusing on investment and key exploitation of ecotourism resources, strengthening the construction of infrastructure and tourism workforce. Expanding forms of capital mobilization. In addition, the thesis has built a number of tourist routes of Hai Phong in which Tien Lang tourism resources play an important role.
Exploiting Tien Lang tourism resources for tourism development is currently facing many difficulties. The above measures, if applied synchronously, will likely bring new prospects for the local tourism industry, contributing to making Tien Lang tourism an important economic sector in the district's economic structure.
REFERENCES
1. Nhuan Ha, Trinh Minh Hien, Tran Phuong, Hai Phong - Historical and cultural relics, Hai Phong Publishing House, 1993
2. Hai Phong City History Council, Hai Phong Gazetteer, Hai Phong Publishing House, 1990.
3. Hai Phong City History Council, History of Tien Lang District Party Committee, Hai Phong Publishing House, 1990.
4. Hai Phong City History Council, University of Social Sciences and Humanities, VNU, Hai Phong Place Names Encyclopedia, Hai Phong Publishing House. 2001.
5. Law on Cultural Heritage and documents guiding its implementation, National Political Publishing House, Hanoi, 2003.
6. Tran Duc Thanh, Lecture on Tourism Geography, Faculty of Tourism, University of Social Sciences and Humanities, VNU, 2006
7. Hai Phong Center for Social Sciences and Humanities, Some typical cultural heritages of Hai Phong, Hai Phong Publishing House, 2001
8. Nguyen Ngoc Thao (editor-in-chief, Tourism Geography, Hai Phong Publishing House, two volumes (2001-2002)
9. Nguyen Minh Tue and group of authors, Hai Phong Tourism Geography, Ho Chi Minh City Publishing House, 1997.
10. Nguyen Thanh Son, Hai Phong Tourism Territory Organization, Associate Doctoral Thesis in Geological Geography, Hanoi, 1996.
11. Decision No. 2033/QD – UB on detailed planning of Tien Lang town, Hai Phong city until 2020.
12. Department of Culture, Information, Hai Phong Museum, Hai Phong relics
- National ranked scenic spot, Hai Phong Publishing House, 2005. 13. Tien Lang District People's Committee, Economic Development Planning -
Culture - Society of Tien Lang district to 2010.
14.Website www.HaiPhong.gov.vn
APPENDIX 1
List of national ranked monuments
STT
Name of the monument
Number, year of decisiondetermine
Location
1
Gam Temple
938 VH/QĐ04/08/1992
Cam Khe Village- Toan Thang commune
2
Doc Hau Temple
9381 VH/QĐ04/08/1992
Doc Hau Village –Toan Thang commune
3
Cuu Doi Communal House
3207 VH/QĐDecember 30, 1991
Zone II of townTien Lang
4
Ha Dai Temple
938 VH/QĐ04/08/1992
Ha Dai Village –Tien Thanh commune
APPENDIX II
STT
Name of the monument
Number, year of decision
Location
1
Phu Ke Pagoda Temple
178/QD-UBJanuary 28, 2005
Zone 1 - townTien Lang
2
Trung Lang Temple
178/QD-UBJanuary 28, 2005
Zone 4 – townTien Lang
3
Bao Khanh Pagoda
1900/QD-UBAugust 24, 2006
Nam Tu Village -Kien Thiet commune
4
Bach Da Pagoda
1792/QD-UB11/11/2002
Hung Thang Commune
5
Ngoc Dong Temple
177/QD-UBNovember 27, 2005
Tien Thanh Commune
6
Tomb of Minister TSNhu Van Lan
2848/QD-UBSeptember 19, 2003
Nam Tu Village -Kien Thiet commune
7
Canh Son Stone Temple
2160/QD-UBSeptember 19, 2003
Van Doi Commune –Doan Lap
8
Meiji Temple
2259/QD-UBSeptember 19, 2002
Toan Thang Commune
9
Tien Doi Noi Temple
477/QD-UBSeptember 19, 2005
Doan Lap Commune
10
Tu Doi Temple
177/QD-UBJanuary 28, 2005
Doan Lap Commune
11
Duyen Lao Temple
177/QD-UBJanuary 28, 2005
Tien Minh Commune
12
Dinh Xuan Uc Pagoda
177/QD-UBJanuary 28, 2005
Bac Hung Commune
13
Chu Khe Pagoda
177/QD-UBJanuary 28, 2005
Hung Thang Commune
14
Dong Dinh
2848/QD-UBNovember 21, 2002
Vinh Quang Commune
15
President's Memorial HouseTon Duc Thang
177/QD-UBJanuary 28, 2005
NT Quy Cao
Ha Dai Temple
Ben Vua Temple
Tien Lang hot spring
div.maincontent .p { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; margin:0pt; } div.maincontent p { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; margin:0pt; } div.maincontent .s1 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; font-size: 16pt; } div.maincontent .s2 { color: black; font-family:"Times New Roman", serif; font-style: italic; font-weight: bold; text-decoration: none; font-size: 14pt; } div.maincontent .s3 { color: black; font-family:"Times New Roman", serif; font-style: italic; font-weight: normal; text-decoration: none; font-size: 14pt; } div.maincontent .s4 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; font-size: 14pt; } div.maincontent .s5 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: bold; font-size: 14pt; } div.maincontent .s6 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; } div.maincontent .s7 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: bold; text-decoration: none; font-size: 14pt; } div.maincontent .s8 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 9pt; vertical-align: 6pt; } div.maincontent .s9 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: bold; text-decoration: none; font-size: 12pt; } div.maincontent .s11 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; tex -
Qos Assurance Methods for Multimedia Communications
zt2i3t4l5ee
zt2a3gs
zt2a3ge
zc2o3n4t5e6n7ts
low. The EF PHB requires a sufficiently large number of output ports to provide low delay, low loss, and low jitter.
EF PHBs can be implemented if the output port's bandwidth is sufficiently large, combined with small buffer sizes and other network resources dedicated to EF packets, to allow the router's service rate for EF packets on an output port to exceed the arrival rate λ of packets at that port.
This means that packets with PHB EF are considered with a pre-allocated amount of output bandwidth and a priority that ensures minimum loss, minimum delay and minimum jitter before being put into operation.
PHB EF is suitable for channel simulation, leased line simulation, and real-time services such as voice, video without compromising on high loss, delay and jitter values.
Figure 2.10 Example of EF installation
Figure 2.10 shows an example of an EF PHB implementation. This is a simple priority queue scheduling technique. At the edges of the DS domain, EF packet traffic is prioritized according to the values agreed upon by the SLA. The EF queue in the figure needs to output packets at a rate higher than the packet arrival rate λ. To provide an EF PHB over an end-to-end DS domain, bandwidth at the output ports of the core routers needs to be allocated in advance to ensure the requirement μ > λ. This can be done by a pre-configured provisioning process. In the figure, EF packets are placed in the priority queue (the upper queue). With such a length, the queue can operate with μ > λ.
Since EF was primarily used for real-time services such as voice and video, and since real-time services use UDP instead of TCP, RED is generally
not suitable for EF queues because applications using UDP will not respond to random packet drop and RED will strip unnecessary packets.
2.2.4.2 Assured Forwarding (AF) PHB
PHB AF is defined by RFC 2597. The purpose of PHB AF is to deliver packets reliably and therefore delay and jitter are considered less important than packet loss. PHB AF is suitable for non-real-time services such as applications using TCP. PHB AF first defines four classes: AF1, AF2, AF3, AF4. For each of these AF classes, packets are then classified into three subclasses with three distinct priority levels.
Table 2.8 shows the four AF classes and 12 AF subclasses and the DSCP values for the 12 AF subclasses defined by RFC 2597. RFC 2597 also allows for more than three separate priority levels to be added for internal use. However, these separate priority levels will only have internal significance.
PHB Class
PHB Subclass
Package type
DSCP
AF4
AF41
Short
100010
AF42
Medium
100100
AF43
High
100110
AF3
AF31
Short
011010
AF32
Medium
011100
AF33
High
011110
AF2
AF21
Short
010010
AF22
Medium
010100
AF23
High
010110
AF1
AF11
Short
001010
AF12
Medium
001100
AF13
High
001110
Table 2.8 AF DSCPs
The AF PHB ensures that packets are forwarded with a high probability of delivery to the destination within the bounds of the rate agreed upon in an SLA. If AF traffic at an ingress port exceeds the pre-priority rate, which is considered non-compliant or “out of profile”, the excess packets will not be delivered to the destination with the same probability as the packets belonging to the defined traffic or “in profile” packets. When there is network congestion, the out of profile packets are dropped before the in profile packets are dropped.
When service levels are defined using AF classes, different quantity and quality between AF classes can be realized by allocating different amounts of bandwidth and buffer space to the four AF classes. Unlike
EF, most AF traffic is non-real-time traffic using TCP, and the RED queue management strategy is an AQM (Adaptive Queue Management) strategy suitable for use in AF PHBs. The four AF PHB layers can be implemented as four separate queues. The output port bandwidth is divided into four AF queues. For each AF queue, packets are marked with three “colors” corresponding to three separate priority levels.
In addition to the 32 DSCP 1 groups defined in Table 2.8, 21 DSCPs have been standardized as follows: one for PHB EF, 12 for PHB AF, and 8 for CSCP. There are 11 DSCP 1 groups still available for other standards.
2.2.5.Example of Differentiated Services
We will look at an example of the Differentiated Service model and mechanism of operation. The architecture of Differentiated Service consists of two basic sets of functions:
Edge functions: include packet classification and traffic conditioning. At the inbound edge of the network, incoming packets are marked. In particular, the DS field in the packet header is set to a certain value. For example, in Figure 2.12, packets sent from H1 to H3 are marked at R1, while packets from H2 to H4 are marked at R2. The labels on the received packets identify the service class to which they belong. Different traffic classes receive different services in the core network. The RFC definition uses the term behavior aggregate rather than the term traffic class. After being marked, a packet can be forwarded immediately into the network, delayed for a period of time before being forwarded, or dropped. We will see that there are many factors that affect how a packet is marked, and whether it is forwarded immediately, delayed, or dropped.
Figure 2.12 DiffServ Example
Core functionality: When a DS-marked packet arrives at a Diffservcapable router, the packet is forwarded to the next router based on
Per-hop behavior is associated with packet classes. Per-hop behavior affects router buffers and the bandwidth shared between competing classes. An important principle of the Differentiated Service architecture is that a router's per-hop behavior is based only on the packet's marking or the class to which it belongs. Therefore, if packets sent from H1 to H3 as shown in the figure receive the same marking as packets from H2 to H4, then the network routers treat the packets exactly the same, regardless of whether the packet originated from H1 or H2. For example, R3 does not distinguish between packets from h1 and H2 when forwarding packets to R4. Therefore, the Differentiated Service architecture avoids the need to maintain router state about separate source-destination pairs, which is important for network scalability.
Chapter Conclusion
Chapter 2 has presented and clarified two main models of deploying and installing quality of service in IP networks. While the traditional best-effort model has many disadvantages, later models such as IntServ and DiffServ have partly solved the problems that best-effort could not solve. IntServ follows the direction of ensuring quality of service for each separate flow, it is built similar to the circuit switching model with the use of the RSVP resource reservation protocol. IntSer is suitable for services that require fixed bandwidth that is not shared such as VoIP services, multicast TV services. However, IntSer has disadvantages such as using a lot of network resources, low scalability and lack of flexibility. DiffServ was born with the idea of solving the disadvantages of the IntServ model.
DiffServ follows the direction of ensuring quality based on the principle of hop-by-hop behavior based on the priority of marked packets. The policy for different types of traffic is decided by the administrator and can be changed according to reality, so it is very flexible. DiffServ makes better use of network resources, avoiding idle bandwidth and processing capacity on routers. In addition, the DifServ model can be deployed on many independent domains, so the ability to expand the network becomes easy.
Chapter 3: METHODS TO ENSURE QoS FOR MULTIMEDIA COMMUNICATIONS
In packet-switched networks, different packet flows often have to share the transmission medium all the way to the destination station. To ensure the fair and efficient allocation of bandwidth to flows, appropriate serving mechanisms are required at network nodes, especially at gateways or routers, where many different data flows often pass through. The scheduler is responsible for serving packets of the selected flow and deciding which packet will be served next. Here, a flow is understood as a set of packets belonging to the same priority class, or originating from the same source, or having the same source and destination addresses, etc.
In normal state when there is no congestion, packets will be sent as soon as they are delivered. In case of congestion, if QoS assurance methods are not applied, prolonged congestion can cause packet drops, affecting service quality. In some cases, congestion is prolonged and widespread in the network, which can easily lead to the network being "frozen", or many packets being dropped, seriously affecting service quality.
Therefore, in this chapter, in sections 3.2 and 3.3, we introduce some typical network traffic load monitoring techniques to predict and prevent congestion before it occurs through the measure of dropping (removing) packets early when there are signs of impending congestion.
3.1. DropTail method
DropTail is a simple, traditional queue management method based on FIFO mechanism. All incoming packets are placed in the queue, when the queue is full, the later packets are dropped.
Due to its simplicity and ease of implementation, DropTail has been used for many years on Internet router systems. However, this algorithm has the following disadvantages:
− Cannot avoid the phenomenon of “Lock out”: Occurs when 1 or several traffic streams monopolize the queue, making packets of other connections unable to pass through the router. This phenomenon greatly affects reliable transmission protocols such as TCP. According to the anti-congestion algorithm, when locked out, the TCP connection stream will reduce the window size and reduce the packet transmission speed exponentially.
− Can cause Global Synchronization: This is the result of a severe “Lock out” phenomenon. Some neighboring routers have their queues monopolized by a number of connections, causing a series of other TCP connections to be unable to pass through and simultaneously reducing the transmission speed. After those monopolized connections are temporarily suspended,
Once the queue is cleared, it takes a considerable amount of time for TCP connections to return to their original speed.
− Full Queue phenomenon: Data transmitted on the Internet often has an explosion, packets arriving at the router are often in clusters rather than in turn. Therefore, the operating mechanism of DropTail makes the queue easily full for a long period of time, leading to the average delay time of large packets. To avoid this phenomenon, with DropTail, the only way is to increase the router's buffer, this method is very expensive and ineffective.
− No QoS guarantee: With the DropTail mechanism, there is no way to prioritize important packets to be transmitted through the router earlier when all are in the queue. Meanwhile, with multimedia communication, ensuring connection and stable speed is extremely important and the DropTail algorithm cannot satisfy.
The problem of choosing the buffer size of the routers in the network is to “absorb” short bursts of traffic without causing too much queuing delay. This is necessary in bursty data transmission. The queue size determines the size of the packet bursts (traffic spikes) that we want to be able to transmit without being dropped at the routers.
In IP-based application networks, packet dropping is an important mechanism for indirectly reporting congestion to end stations. A solution that prevents router queues from filling up while reducing the packet drop rate is called dynamic queue management.
3.2. Random elimination method – RED
3.2.1 Overview
RED (Random Early Detection of congestion; Random Early Drop) is one of the first AQM algorithms proposed in 1993 by Sally Floyd and Van Jacobson, two scientists at the Lawrence Berkeley Laboratory of the University of California, USA. Due to its outstanding advantages compared to previous queue management algorithms, RED has been widely installed and deployed on the Internet.
The most fundamental point of their work is that the most effective place to detect congestion and react to it is at the gateway or router.
Source entities (senders) can also do this by estimating end-to-end delay, throughput variability, or the rate of packet retransmissions due to drop. However, the sender and receiver view of a particular connection cannot tell which gateways on the network are congested, and cannot distinguish between propagation delay and queuing delay. Only the gateway has a true view of the state of the queue, the link share of the connections passing through it at any given time, and the quality of service requirements of the
traffic flows. The RED gateway monitors the average queue length, which detects early signs of impending congestion (average queue length exceeding a predetermined threshold) and reacts appropriately in one of two ways:
− Drop incoming packets with a certain probability, to indirectly inform the source of congestion, the source needs to reduce the transmission rate to keep the queue from filling up, maintaining the ability to absorb incoming traffic spikes.
− Mark “congestion” with a certain probability in the ECN field in the header of TCP packets to notify the source (the receiving entity will copy this bit into the acknowledgement packet).
Figure 3. 1 RED algorithm
The main goal of RED is to avoid congestion by keeping the average queue size within a sufficiently small and stable region, which also means keeping the queuing delay sufficiently small and stable. Achieving this goal also helps: avoid global synchronization, not resist bursty traffic flows (i.e. flows with low average throughput but high volatility), and maintain an upper bound on the average queue size even in the absence of cooperation from transport layer protocols.
To achieve the above goals, RED gateways must do the following:
− The first is to detect congestion early and react appropriately to keep the average queue size small enough to keep the network operating in the low latency, high throughput region, while still allowing the queue size to fluctuate within a certain range to absorb short-term fluctuations. As discussed above, the gateway is the most appropriate place to detect congestion and is also the most appropriate place to decide which specific connection to report congestion to.
− The second thing is to notify the source of congestion. This is done by marking and notifying the source to reduce traffic. Normally the RED gateway will randomly drop packets. However, if congestion
If congestion is detected before the queue is full, it should be combined with packet marking to signal congestion. The RED gateway has two options: drop or mark; where marking is done by marking the ECN field of the packet with a certain probability, to signal the source to reduce the traffic entering the network.
− An important goal that RED gateways need to achieve is to avoid global synchronization and not to resist traffic flows that have a sudden characteristic. Global synchronization occurs when all connections simultaneously reduce their transmission window size, leading to a severe drop in throughput at the same time. On the other hand, Drop Tail or Random Drop strategies are very sensitive to sudden flows; that is, the gateway queue will often overflow when packets from these flows arrive. To avoid these two phenomena, gateways can use special algorithms to detect congestion and decide which connections will be notified of congestion at the gateway. The RED gateway randomly selects incoming packets to mark; with this method, the probability of marking a packet from a particular connection is proportional to the connection's shared bandwidth at the gateway.
− Another goal is to control the average queue size even without cooperation from the source entities. This can be done by dropping packets when the average size exceeds an upper threshold (instead of marking it). This approach is necessary in cases where most connections have transmission times that are less than the round-trip time, or where the source entities are not able to reduce traffic in response to marking or dropping packets (such as UDP flows).
3.2.2 Algorithm
This section describes the algorithm for RED gateways. RED gateways calculate the average queue size using a low-pass filter. This average queue size is compared with two thresholds: minth and maxth. When the average queue size is less than the lower threshold, no incoming packets are marked or dropped; when the average queue size is greater than the upper threshold, all incoming packets are dropped. When the average queue size is between minth and maxth, each incoming packet is marked or dropped with a probability pa, where pa is a function of the average queue size avg; the probability of marking or dropping a packet for a particular connection is proportional to the bandwidth share of that connection at the gateway. The general algorithm for a RED gateway is described as follows: [5]
For each packet arrival
Caculate the average queue size avg If minth ≤ avg < maxth
div.maincontent .s1 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 15pt; }
div.maincontent .s2 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: bold; text-decoration: none; font-size: 15pt; }
div.maincontent .p { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; margin:0pt; }
div.maincontent p { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; margin:0pt; }
div.maincontent .s3 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: bold; text-decoration: none; font-size: 14pt; }
div.maincontent .s4 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; }
div.maincontent .s5 { color: black; font-family:"Times New Roman", serif; font-style: italic; font-weight: normal; text-decoration: none; font-size: 14pt; }
div.maincontent .s6 { color: black; font-family:"Times New Roman", serif; font-style: italic; font-weight: bold; text-decoration: none; font-size: 14pt; }
div.maincontent .s7 { color: black; font-family:Wingdings; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; }
div.maincontent .s8 { color: black; font-family:Arial, sans-serif; font-style: italic; font-weight: bold; text-decoration: none; font-size: 15pt; }
div.maincontent .s9 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: bold; text-decoration: none; font-size: 14pt; }
div.maincontent .s10 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 9pt; vertical-align: 6pt; }
div.maincontent .s11 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 13pt; }
div.maincontent .s12 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 10pt; }
div.maincontent .s13 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-d

Source: Report submitted to the Prime Minister by the Minister of Information and Communications in 2021
3.1.3. Development strategy of information and communication industry in the coming period
Thoroughly grasping the development orientation and goals assigned by the Party and State, all leaders of the Ministry of Information and Communications together with staff in the industry need to maintain the development viewpoint as follows:
The information and communication industry needs to become a spearhead industry, develop more strongly, and regularly update modern technology and techniques.
Development goes hand in hand with effective management and exploitation to facilitate application and promote sustainable development of the information and communication industry, contributing to the socio-economic development of the country and improving people's knowledge.
From there, implement development strategies such as:
Building and developing a national information and communication infrastructure with modern technology on par with advanced countries in the region, with wide coverage across the country with high quality, speed and efficiency, creating conditions for the whole society to exploit and share information, creating a foundation for the application and development of information and communication to serve the cause of industrialization and modernization of the country.
Provide society and consumers with modern, diverse and abundant services at prices lower than or equal to the average of countries in the region; meet all information and communication needs on economics, society, security and national defense. Implement universal information and communication services to all regions and areas in the country with increasingly high service quality.
3.2. Solutions to improve the efficiency of using official development assistance capital for the information and communication industry in the coming time
3.2.1. Training to improve the capacity of management and executive staff
Correctly perceive ODA with two intertwined political and economic factors to have a correct view on this resource in order to gain international support, effectively implement the policy of independence, self-reliance, diversification, and multilateralization of foreign relations of the Party and State. Each donor has a global strategy on ODA as well as a medium or long-term cooperation program with Vietnam, which clearly states the goals and concerns when providing ODA to Vietnam. Therefore, the Information and Communications Industry needs to carefully study those strategies and programs to have appropriate responses to ensure political and economic benefits. After all, both ODA loans and non-refundable ODA are loans in advance and paid later in material and/or responsibility. Being aware of this issue will help promote the sense of responsibility in the process of receiving, managing and using ODA.
In addition, the Government's general agencies should promote training and guidance on the processes and procedures for using ODA capital and organize the compilation and dissemination of documents on practical management. Regularly organize training for the Project Management Board on ODA policies, processes and procedures of the Government and donors.
to foresee and plan measures to handle inconsistent regulations of the two sides to ensure project implementation on schedule and promote disbursement of ODA capital.
In implementing ODA projects of the Information and Communications Industry, in order for the management and implementation of processes and procedures for using ODA capital sources to quickly come into practice, the Government's synthesizing agencies need to consult with investors before issuing guiding documents and after issuing, need to promote training and guidance so that investors can immediately grasp the State's requirements during the implementation process.
3.2.2. Have a mechanism to select suitable contractors
To limit the situation of contractors who are not qualified enough but win important projects in Vietnam in general and in the IT industry in particular, it is necessary to have mechanisms and policies to strictly manage contractors.
Resolving difficulties and obstacles in bidding is not easy, requiring the coordination of many ministries, branches and functional agencies, including recommendations for the National Assembly and the Government to promptly review, amend and supplement a number of articles of the Law on Bidding and Decree 25/2020/ND-CP detailing the Law on Bidding on investor selection. The Law on Bidding needs to be adjusted and supplemented to create favorable conditions for businesses and increase the possibility of winning international bids. In addition, a solid legal mechanism will become a "filter" to help eliminate and limit the abandonment of weak and unqualified contractors.
3.2.3. The pre-feasibility and feasibility studies of the Industry need to be given due attention.
Whether a project applying for ODA funding is approved by the Donor or not largely depends on the results of the pre-feasibility and feasibility studies. To achieve such results, in addition to objective solutions such as harmonizing procedures, the Industry needs to soon have specific solutions for this pre-feasibility and feasibility study. Specifically:
- Develop pre-feasibility reports for projects requesting ODA funding right from when the Vietnam Information and Communications Industry plans the development of the Industry for each stage as well as the socio-economic development strategy of Vietnam in general.
- The content of the pre-feasibility and feasibility study reports must be close to reality, clearly analyzing the financial, socio-economic efficiency, environmental impact of the project, the sustainability of the project after completion as well as other factors such as the ability and source of counterpart capital balance, etc.
- The budget for this work is extremely necessary, so the Information and Communications Industry needs to have a separate fund for this activity to ensure economic efficiency for pre-feasibility studies of projects that are planning to request ODA capital.
- The staff in charge of this work need to improve their technical expertise to be able to prepare pre-feasibility and feasibility study reports that are professionally convincing.
- For some projects with complex survey conditions and time-consuming, such as the North-South submarine cable project, the Industry needs to pay more special attention to coordination and cooperation with relevant departments to minimize limitations and difficulties, contributing to improving the quality of the feasibility report as well as speeding up the project approval process.
- Feasibility studies can use both domestic and international consultants as long as the consulting services are highly effective. Increase the use of domestic consultants (including the work of convincing sponsors) to contribute to improving the quality of project preparation in accordance with the actual conditions of units under the Vietnam Information and Communications Industry and reduce foreign consulting fees. For some sponsors such as Japan, the approval procedure for feasibility projects is very complicated, with many stages and steps, so carefully studying the sponsors' requirements before preparing feasibility reports is really necessary and ensures the Industry's initiative.





![Qos Assurance Methods for Multimedia Communications
zt2i3t4l5ee
zt2a3gs
zt2a3ge
zc2o3n4t5e6n7ts
low. The EF PHB requires a sufficiently large number of output ports to provide low delay, low loss, and low jitter.
EF PHBs can be implemented if the output ports bandwidth is sufficiently large, combined with small buffer sizes and other network resources dedicated to EF packets, to allow the routers service rate for EF packets on an output port to exceed the arrival rate λ of packets at that port.
This means that packets with PHB EF are considered with a pre-allocated amount of output bandwidth and a priority that ensures minimum loss, minimum delay and minimum jitter before being put into operation.
PHB EF is suitable for channel simulation, leased line simulation, and real-time services such as voice, video without compromising on high loss, delay and jitter values.
Figure 2.10 Example of EF installation
Figure 2.10 shows an example of an EF PHB implementation. This is a simple priority queue scheduling technique. At the edges of the DS domain, EF packet traffic is prioritized according to the values agreed upon by the SLA. The EF queue in the figure needs to output packets at a rate higher than the packet arrival rate λ. To provide an EF PHB over an end-to-end DS domain, bandwidth at the output ports of the core routers needs to be allocated in advance to ensure the requirement μ > λ. This can be done by a pre-configured provisioning process. In the figure, EF packets are placed in the priority queue (the upper queue). With such a length, the queue can operate with μ > λ.
Since EF was primarily used for real-time services such as voice and video, and since real-time services use UDP instead of TCP, RED is generally
not suitable for EF queues because applications using UDP will not respond to random packet drop and RED will strip unnecessary packets.
2.2.4.2 Assured Forwarding (AF) PHB
PHB AF is defined by RFC 2597. The purpose of PHB AF is to deliver packets reliably and therefore delay and jitter are considered less important than packet loss. PHB AF is suitable for non-real-time services such as applications using TCP. PHB AF first defines four classes: AF1, AF2, AF3, AF4. For each of these AF classes, packets are then classified into three subclasses with three distinct priority levels.
Table 2.8 shows the four AF classes and 12 AF subclasses and the DSCP values for the 12 AF subclasses defined by RFC 2597. RFC 2597 also allows for more than three separate priority levels to be added for internal use. However, these separate priority levels will only have internal significance.
PHB Class
PHB Subclass
Package type
DSCP
AF4
AF41
Short
100010
AF42
Medium
100100
AF43
High
100110
AF3
AF31
Short
011010
AF32
Medium
011100
AF33
High
011110
AF2
AF21
Short
010010
AF22
Medium
010100
AF23
High
010110
AF1
AF11
Short
001010
AF12
Medium
001100
AF13
High
001110
Table 2.8 AF DSCPs
The AF PHB ensures that packets are forwarded with a high probability of delivery to the destination within the bounds of the rate agreed upon in an SLA. If AF traffic at an ingress port exceeds the pre-priority rate, which is considered non-compliant or “out of profile”, the excess packets will not be delivered to the destination with the same probability as the packets belonging to the defined traffic or “in profile” packets. When there is network congestion, the out of profile packets are dropped before the in profile packets are dropped.
When service levels are defined using AF classes, different quantity and quality between AF classes can be realized by allocating different amounts of bandwidth and buffer space to the four AF classes. Unlike
EF, most AF traffic is non-real-time traffic using TCP, and the RED queue management strategy is an AQM (Adaptive Queue Management) strategy suitable for use in AF PHBs. The four AF PHB layers can be implemented as four separate queues. The output port bandwidth is divided into four AF queues. For each AF queue, packets are marked with three “colors” corresponding to three separate priority levels.
In addition to the 32 DSCP 1 groups defined in Table 2.8, 21 DSCPs have been standardized as follows: one for PHB EF, 12 for PHB AF, and 8 for CSCP. There are 11 DSCP 1 groups still available for other standards.
2.2.5.Example of Differentiated Services
We will look at an example of the Differentiated Service model and mechanism of operation. The architecture of Differentiated Service consists of two basic sets of functions:
Edge functions: include packet classification and traffic conditioning. At the inbound edge of the network, incoming packets are marked. In particular, the DS field in the packet header is set to a certain value. For example, in Figure 2.12, packets sent from H1 to H3 are marked at R1, while packets from H2 to H4 are marked at R2. The labels on the received packets identify the service class to which they belong. Different traffic classes receive different services in the core network. The RFC definition uses the term behavior aggregate rather than the term traffic class. After being marked, a packet can be forwarded immediately into the network, delayed for a period of time before being forwarded, or dropped. We will see that there are many factors that affect how a packet is marked, and whether it is forwarded immediately, delayed, or dropped.
Figure 2.12 DiffServ Example
Core functionality: When a DS-marked packet arrives at a Diffservcapable router, the packet is forwarded to the next router based on
Per-hop behavior is associated with packet classes. Per-hop behavior affects router buffers and the bandwidth shared between competing classes. An important principle of the Differentiated Service architecture is that a routers per-hop behavior is based only on the packets marking or the class to which it belongs. Therefore, if packets sent from H1 to H3 as shown in the figure receive the same marking as packets from H2 to H4, then the network routers treat the packets exactly the same, regardless of whether the packet originated from H1 or H2. For example, R3 does not distinguish between packets from h1 and H2 when forwarding packets to R4. Therefore, the Differentiated Service architecture avoids the need to maintain router state about separate source-destination pairs, which is important for network scalability.
Chapter Conclusion
Chapter 2 has presented and clarified two main models of deploying and installing quality of service in IP networks. While the traditional best-effort model has many disadvantages, later models such as IntServ and DiffServ have partly solved the problems that best-effort could not solve. IntServ follows the direction of ensuring quality of service for each separate flow, it is built similar to the circuit switching model with the use of the RSVP resource reservation protocol. IntSer is suitable for services that require fixed bandwidth that is not shared such as VoIP services, multicast TV services. However, IntSer has disadvantages such as using a lot of network resources, low scalability and lack of flexibility. DiffServ was born with the idea of solving the disadvantages of the IntServ model.
DiffServ follows the direction of ensuring quality based on the principle of hop-by-hop behavior based on the priority of marked packets. The policy for different types of traffic is decided by the administrator and can be changed according to reality, so it is very flexible. DiffServ makes better use of network resources, avoiding idle bandwidth and processing capacity on routers. In addition, the DifServ model can be deployed on many independent domains, so the ability to expand the network becomes easy.
Chapter 3: METHODS TO ENSURE QoS FOR MULTIMEDIA COMMUNICATIONS
In packet-switched networks, different packet flows often have to share the transmission medium all the way to the destination station. To ensure the fair and efficient allocation of bandwidth to flows, appropriate serving mechanisms are required at network nodes, especially at gateways or routers, where many different data flows often pass through. The scheduler is responsible for serving packets of the selected flow and deciding which packet will be served next. Here, a flow is understood as a set of packets belonging to the same priority class, or originating from the same source, or having the same source and destination addresses, etc.
In normal state when there is no congestion, packets will be sent as soon as they are delivered. In case of congestion, if QoS assurance methods are not applied, prolonged congestion can cause packet drops, affecting service quality. In some cases, congestion is prolonged and widespread in the network, which can easily lead to the network being frozen, or many packets being dropped, seriously affecting service quality.
Therefore, in this chapter, in sections 3.2 and 3.3, we introduce some typical network traffic load monitoring techniques to predict and prevent congestion before it occurs through the measure of dropping (removing) packets early when there are signs of impending congestion.
3.1. DropTail method
DropTail is a simple, traditional queue management method based on FIFO mechanism. All incoming packets are placed in the queue, when the queue is full, the later packets are dropped.
Due to its simplicity and ease of implementation, DropTail has been used for many years on Internet router systems. However, this algorithm has the following disadvantages:
− Cannot avoid the phenomenon of “Lock out”: Occurs when 1 or several traffic streams monopolize the queue, making packets of other connections unable to pass through the router. This phenomenon greatly affects reliable transmission protocols such as TCP. According to the anti-congestion algorithm, when locked out, the TCP connection stream will reduce the window size and reduce the packet transmission speed exponentially.
− Can cause Global Synchronization: This is the result of a severe “Lock out” phenomenon. Some neighboring routers have their queues monopolized by a number of connections, causing a series of other TCP connections to be unable to pass through and simultaneously reducing the transmission speed. After those monopolized connections are temporarily suspended,
Once the queue is cleared, it takes a considerable amount of time for TCP connections to return to their original speed.
− Full Queue phenomenon: Data transmitted on the Internet often has an explosion, packets arriving at the router are often in clusters rather than in turn. Therefore, the operating mechanism of DropTail makes the queue easily full for a long period of time, leading to the average delay time of large packets. To avoid this phenomenon, with DropTail, the only way is to increase the routers buffer, this method is very expensive and ineffective.
− No QoS guarantee: With the DropTail mechanism, there is no way to prioritize important packets to be transmitted through the router earlier when all are in the queue. Meanwhile, with multimedia communication, ensuring connection and stable speed is extremely important and the DropTail algorithm cannot satisfy.
The problem of choosing the buffer size of the routers in the network is to “absorb” short bursts of traffic without causing too much queuing delay. This is necessary in bursty data transmission. The queue size determines the size of the packet bursts (traffic spikes) that we want to be able to transmit without being dropped at the routers.
In IP-based application networks, packet dropping is an important mechanism for indirectly reporting congestion to end stations. A solution that prevents router queues from filling up while reducing the packet drop rate is called dynamic queue management.
3.2. Random elimination method – RED
3.2.1 Overview
RED (Random Early Detection of congestion; Random Early Drop) is one of the first AQM algorithms proposed in 1993 by Sally Floyd and Van Jacobson, two scientists at the Lawrence Berkeley Laboratory of the University of California, USA. Due to its outstanding advantages compared to previous queue management algorithms, RED has been widely installed and deployed on the Internet.
The most fundamental point of their work is that the most effective place to detect congestion and react to it is at the gateway or router.
Source entities (senders) can also do this by estimating end-to-end delay, throughput variability, or the rate of packet retransmissions due to drop. However, the sender and receiver view of a particular connection cannot tell which gateways on the network are congested, and cannot distinguish between propagation delay and queuing delay. Only the gateway has a true view of the state of the queue, the link share of the connections passing through it at any given time, and the quality of service requirements of the
traffic flows. The RED gateway monitors the average queue length, which detects early signs of impending congestion (average queue length exceeding a predetermined threshold) and reacts appropriately in one of two ways:
− Drop incoming packets with a certain probability, to indirectly inform the source of congestion, the source needs to reduce the transmission rate to keep the queue from filling up, maintaining the ability to absorb incoming traffic spikes.
− Mark “congestion” with a certain probability in the ECN field in the header of TCP packets to notify the source (the receiving entity will copy this bit into the acknowledgement packet).
Figure 3. 1 RED algorithm
The main goal of RED is to avoid congestion by keeping the average queue size within a sufficiently small and stable region, which also means keeping the queuing delay sufficiently small and stable. Achieving this goal also helps: avoid global synchronization, not resist bursty traffic flows (i.e. flows with low average throughput but high volatility), and maintain an upper bound on the average queue size even in the absence of cooperation from transport layer protocols.
To achieve the above goals, RED gateways must do the following:
− The first is to detect congestion early and react appropriately to keep the average queue size small enough to keep the network operating in the low latency, high throughput region, while still allowing the queue size to fluctuate within a certain range to absorb short-term fluctuations. As discussed above, the gateway is the most appropriate place to detect congestion and is also the most appropriate place to decide which specific connection to report congestion to.
− The second thing is to notify the source of congestion. This is done by marking and notifying the source to reduce traffic. Normally the RED gateway will randomly drop packets. However, if congestion
If congestion is detected before the queue is full, it should be combined with packet marking to signal congestion. The RED gateway has two options: drop or mark; where marking is done by marking the ECN field of the packet with a certain probability, to signal the source to reduce the traffic entering the network.
− An important goal that RED gateways need to achieve is to avoid global synchronization and not to resist traffic flows that have a sudden characteristic. Global synchronization occurs when all connections simultaneously reduce their transmission window size, leading to a severe drop in throughput at the same time. On the other hand, Drop Tail or Random Drop strategies are very sensitive to sudden flows; that is, the gateway queue will often overflow when packets from these flows arrive. To avoid these two phenomena, gateways can use special algorithms to detect congestion and decide which connections will be notified of congestion at the gateway. The RED gateway randomly selects incoming packets to mark; with this method, the probability of marking a packet from a particular connection is proportional to the connections shared bandwidth at the gateway.
− Another goal is to control the average queue size even without cooperation from the source entities. This can be done by dropping packets when the average size exceeds an upper threshold (instead of marking it). This approach is necessary in cases where most connections have transmission times that are less than the round-trip time, or where the source entities are not able to reduce traffic in response to marking or dropping packets (such as UDP flows).
3.2.2 Algorithm
This section describes the algorithm for RED gateways. RED gateways calculate the average queue size using a low-pass filter. This average queue size is compared with two thresholds: minth and maxth. When the average queue size is less than the lower threshold, no incoming packets are marked or dropped; when the average queue size is greater than the upper threshold, all incoming packets are dropped. When the average queue size is between minth and maxth, each incoming packet is marked or dropped with a probability pa, where pa is a function of the average queue size avg; the probability of marking or dropping a packet for a particular connection is proportional to the bandwidth share of that connection at the gateway. The general algorithm for a RED gateway is described as follows: [5]
For each packet arrival
Caculate the average queue size avg If minth ≤ avg < maxth
div.maincontent .s1 { color: black; font-family:Times New Roman, serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 15pt; }
div.maincontent .s2 { color: black; font-family:Times New Roman, serif; font-style: normal; font-weight: bold; text-decoration: none; font-size: 15pt; }
div.maincontent .p { color: black; font-family:Times New Roman, serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; margin:0pt; }
div.maincontent p { color: black; font-family:Times New Roman, serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; margin:0pt; }
div.maincontent .s3 { color: black; font-family:Times New Roman, serif; font-style: normal; font-weight: bold; text-decoration: none; font-size: 14pt; }
div.maincontent .s4 { color: black; font-family:Times New Roman, serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; }
div.maincontent .s5 { color: black; font-family:Times New Roman, serif; font-style: italic; font-weight: normal; text-decoration: none; font-size: 14pt; }
div.maincontent .s6 { color: black; font-family:Times New Roman, serif; font-style: italic; font-weight: bold; text-decoration: none; font-size: 14pt; }
div.maincontent .s7 { color: black; font-family:Wingdings; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; }
div.maincontent .s8 { color: black; font-family:Arial, sans-serif; font-style: italic; font-weight: bold; text-decoration: none; font-size: 15pt; }
div.maincontent .s9 { color: black; font-family:Times New Roman, serif; font-style: normal; font-weight: bold; text-decoration: none; font-size: 14pt; }
div.maincontent .s10 { color: black; font-family:Times New Roman, serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 9pt; vertical-align: 6pt; }
div.maincontent .s11 { color: black; font-family:Times New Roman, serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 13pt; }
div.maincontent .s12 { color: black; font-family:Times New Roman, serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 10pt; }
div.maincontent .s13 { color: black; font-family:Times New Roman, serif; font-style: normal; font-weight: normal; text-d](https://tailieuthamkhao.com/uploads/2022/05/15/danh-gia-hieu-qua-dam-bao-qos-cho-truyen-thong-da-phuong-tien-cua-chien-6-1-120x90.jpg)