These are: Wife, husband, biological father, biological mother, adoptive father, adoptive mother, biological child, adopted child; Paternal grandfather, paternal grandmother, maternal grandfather, paternal grandmother, biological brother, biological sister; Paternal great-grandfather, maternal great-grandfather of one of the above persons; paternal uncle, paternal aunt, paternal aunt; paternal grandchild whose surname is paternal uncle, paternal aunt, paternal aunt.” [24].
These people have certain emotional relationships with the accused, defendant, victim, civil plaintiff, civil defendant and people with rights and obligations related to the case. The power of blood relations will make people behave in a biased manner, protecting each other when there is a matter affecting the rights and interests of their relatives. Therefore, if the THTT conducts activities to resolve a criminal case against their relatives, it is inevitable that they will "inadvertently" be biased in favor of the relatives.
Thus, if the THTT person is also the subjects analyzed above, they cannot THTT. Because then, the assessments and decisions they make will no longer come from impartiality and will hardly be convincing. The consequence is creating arbitrary orders and lack of objectivity in the litigation process, which can even lead to criminals being let go, innocent people being wrongly convicted, justice not being enforced, and more seriously, reducing people's trust in the fairness of the law.
Second: the THTT person participated as a defender, witness, expert, or interpreter in that case.
Maybe you are interested!
-
Some Other Provisions Related to the Principle of Ensuring the Impartiality of Judges, Interpreters, and Experts -
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 -
Current Status of Facilities Management, Ensuring Equipment for Self-Study Activities -
Ensuring human rights for people arrested during the investigation phase of criminal cases - 13 -
Working Principle Diagram Of Continuous Butter Making Equipment
According to this regulation, the person performing the procedural activities in accordance with their functions and duties is not allowed to perform the procedural activities in accordance with their functions and duties if they have participated in the case as a defender, witness, expert, or interpreter. Defenders, witnesses, experts, and interpreters are the persons performing the procedural activities out of duty or to protect justice. Their rights and interests are not affected by the criminal settlement decisions of the procedural people, but the Law on Procedures still stipulates that if a person has performed the procedural activities in the above capacity, if assigned to perform the procedural activities in the same case, they must refuse or will be replaced. This regulation is aimed at avoiding subjective prejudices of the procedural people in resolving criminal cases.
A defense attorney is a person invited by a detainee, suspect, or defendant to protect his or her rights or is assigned by the criminal investigation agencies to defend the suspect or defendant according to the provisions of law. The purpose of a criminal investigation attorney is mainly to clarify

exculpatory or mitigating circumstances and assisting the accused in legal matters. Thus, the defense counsel has formed a view of the case in a direction that is favorable to the people they are defending. If they are the litigants, the people who have the obligation to prove in a criminal case, it is easy to confuse their duties if they play both the role of litigator and defender. Therefore, the law stipulates that a person who has participated as a defense counsel cannot participate as a litigator and vice versa. At the same time, at Point 2, Clause 1, Article 56 of the Criminal Procedure Code, it is also stipulated that they cannot act as defenders when they are relatives of those who have or are litigating in that case. With this provision, not only the litigator in that case cannot become a defender, but even relatives of the litigator cannot become defenders. According to the guidance of Resolution No. 03/2004/HDTP, in cases where the accused, defendant, or their legal representative has hired a defense attorney in previous stages of the proceedings and now continues to hire that person to defend them, it is necessary to consider whether that person is related to the Judge, Jury, or Court Secretary assigned to the case. If there is a relationship with someone assigned to the case, it is necessary to assign another person who is not related to the person assigned to defend them to replace the defense attorney and issue a defense attorney certificate to that person. Such a provision is reasonable because if the defense attorney has participated in defending the accused from the investigation stage, to the first instance or appeal trial stage, the assigned defense attorney is a relative of the defense attorney, then the defense attorney will not be assigned to defend the accused anymore, but will not replace the defense attorney to avoid difficulties in the defense of the accused because if another person is invited to defend, the new defense attorney will have to start over from the beginning, wasting time, effort and often ineffective.
Witnesses, experts, and interpreters are the people who assist the investigation agency at the request of the investigation agency. Their participation is to provide the investigation agency with necessary information and documents (sources of evidence) such as witnesses providing what they know about the case, experts giving expert conclusions at the request of the competent authority or interpreters, third parties, acting as intermediaries between the investigation agency and the person who assists the investigation agency in the process of proving the truth of the case. Therefore, if they
It is very difficult to be objective when one is both the provider and the evaluator of the information and documents they provide. Therefore, they cannot be the reviewer at the same time.
Third : There are other clear grounds to believe that the THTT person may not be impartial in the performance of his duties .
This is a general basis and anticipates situations that may occur while resolving criminal cases. In reality, it is impossible to list in the law all the cases that may lead to the lack of impartiality of the arbitrators. In society, there will be many situations that can easily lead to the lack of impartiality of the arbitrators, but to apply this basis, it is required that the arbitrators, when refusing or the person with the right to change or request a change, must provide clear evidence to prove the lack of impartiality or lack of impartiality of the arbitrators. With this basis, according to the guidance at Point c, Section 4, Part I, Resolution 03/2004/NQ-HDTP of the Council of Judges dated October 2, 2004:
…c) There is another clear basis to believe that they may not be impartial while performing their duties. In addition to the cases specified in Clause 1 and Clause 2, Article 42 of the Criminal Procedure Code, in other cases (such as in love relationships, in-law relationships, work relationships, economic relationships, etc.), there is a clear basis to affirm that the Judge, the Jury, and the Court Secretary cannot be impartial while performing their duties. For example: The Jury is the sworn brother of the suspect or defendant; the Judge is the son-in-law of the defendant; the victim is the Head of the agency where the Judge's wife works... and there is clear basis to prove that in their lives there is a close emotional relationship, an economic relationship, etc.
It is also considered that there are other clear grounds to believe that they may not be impartial in the performance of their duties if, in the same criminal trial, the Prosecutor, Judge, Jury and Court Clerk are related to each other [24].
Thus, the guidance of the Council of Judges has provided a number of cases that may lead to lack of impartiality when performing the duties of a THTT person, however, it is not possible to list all the cases that may occur in life. Based on the guidance, it can be seen that the factors leading to lack of impartiality of a person
Emotional, material, and spiritual factors of others affect the person with emotional factors, causing them to have behaviors and decisions that are beneficial or disadvantageous to the person with emotional factors.
The emotional factor can be understood as in addition to the kinship relationship guided in Resolution No. 03 of the Council of Judges as analyzed above, in society, people can have many other relationships that give rise to feelings with each other, which can be feelings between people who have gratitude for each other, between people who love each other, know each other or between them have certain conflicts. Those relationships create an attitude of love or hate between the THTT and the TGTT. Therefore, if in the process of resolving a case, between the THTT and the TGTT there are such feelings, it will lead to the inability to suppress the emotions inside while performing their responsibilities and from there will be actions that are not impartial when resolving criminal cases.
Material factors also have a significant impact on the impartiality of the THTT when conducting criminal proceedings. As human life needs are increasingly improved, material things are an important factor, determining the existence and development of human beings. People work and participate in social relations with the first purpose of ensuring the lives of themselves, their families and their loved ones. Currently, if those who have responsibilities and roles in resolving criminal cases are not guaranteed by the State, meeting the needs of material life or those who have unclear professional conscience, it will lead to them being unable to avoid the temptation of money and from there will lead to not being impartial when performing their duties.
The spiritual factor is a difficult factor to determine in the relationship between people, but it has a significant impact on human behavior in their activities. One of the spiritual relationships that has a great impact on human perception, including the THTT and the TGTT, is the relationship of power. Interventions by leaders who do not have direct authority in resolving criminal cases or the fact that the offender is a "son of a boss" will lead to THTT and the TGTT being unbiased and objective because of respect or pressure from "superiors". Therefore, it is required that THTT and the TGTT must be clear-headed, impartial and have solid professional qualifications to be able to carry out their responsibilities.
Thus, if there is clear basis for the THTT person and the TGTT person to bear the cost
The combination of emotional, material and spiritual factors while performing their responsibilities needs to be changed immediately or these people themselves need to refuse if they realize that they cannot be impartial in resolving criminal cases.
Fourth: A person may not hold multiple positions of a judge in the same case as stipulated in Point b, Clause 1, Article 44, Point b, Clause 1, Article 45, Point c, Clause 1, Article 46, Point b, Clause 1, Article 47 of the Criminal Procedure Code. If a person has held a trial as an investigator, he/she may not hold a trial as a prosecutor or judge and vice versa.
The Law on Criminal Procedure stipulates that the settlement of criminal cases goes through different stages of proceedings and is carried out by different procedural subjects. Each stage of proceedings has a clear assignment of tasks and powers to the procedural person. So, a person who has conducted the procedural matter at the previous stage, they have certain assessments of the case, at the next stage, they take on the role of the procedural person and continue to evaluate the case, then certainly there will be certain prejudices towards their assessments. If the investigator has concluded the investigation that the defendant is guilty, then when conducting the procedural matter in a different capacity from their subjective belief, they will only focus on the evidence of the crime and disregard the evidence of exoneration, and may even use many other measures to force the defendant to confess or vice versa, if before that if they had good thoughts and feelings for a certain procedural person, they will continue to be influenced by that feeling. All of these cases lead to the resolution of criminal cases lacking impartiality and objectivity, easily letting criminals escape and wrongfully convicting innocent people, and at the same time failing to achieve the purpose of the activities of the next stage of the proceedings, which is to check the correctness and basis of the activities of the previous stage of the proceedings. In addition, at Point c, Clause 1, Article 46 of the Criminal Procedure Code, it is also stipulated that: Judges and Jurors must refuse to participate in the trial or be replaced if they have participated in the first instance or appeal trial of that case. With this provision, at Point c, Section 6, Part I of Resolution 03/2004/NQ-HDTP, it is stipulated that: "Having participated in the first instance or appeal trial... in that case" (Point c, Clause 1, Article 46 of the Criminal Procedure Code) means having participated in the resolution of the case and having issued a first instance or appeal judgment or a decision to suspend the case. If a Judge or Juror is assigned to participate in a first-instance or appeal trial but only participates in making decisions: returning the case file for further investigation, temporarily suspending the case, canceling the decision to suspend the case, or postponing the trial, then
The case is still allowed to continue to be resolved. According to this provision, the Judge who is changed in this case is not the Judge who participated in reviewing the judgment or decision that has come into legal effect of the Court according to the procedure of cassation or retrial. And not all cases of Judges and Jurors will have to refuse or be changed, but only the Jurors and Judges who issued the judgment of first instance, the judgment of appeal or the decision to suspend the case must refuse or be changed. These are Judges and Jurors who have participated in resolving the case in terms of content, have made their own assessments of the case through procedural decisions, therefore, it is difficult to be objective, overcome their own prejudices to re-try the case that they have resolved.
Fifth: The Judge and the Juror are on the same Trial Panel and are related to each other .
This basis comes from the fact that a person is only considered guilty when there is a legally effective verdict of the Court and all issues under the jurisdiction of the Trial Panel are only the Judge and the Jury. Members of the Trial Panel must decide all issues of the case by majority vote. Therefore, the relationship of relatives will affect the "voting by majority". This can be the relationship between Judge and Judge, Judge and Jury, Jury and Jury. When there is a relationship of relatives with each other in the same Trial Panel, there may be discussions and mutual influence in the process of assessing the details of the case as well as making the Court's judgments, affecting the settlement of the criminal case. Therefore, the Law on Criminal Procedure requires those who have a close relationship in the same Trial Council to refuse or be changed. However, according to Point a, Section 6, Part I of Resolution No. 03/2004/NQ – HDTP, it is stipulated that “…when there are two close relatives, only one person must refuse or be changed.” This provision is appropriate because changing only one person is enough to eliminate that close relationship.
* Grounds for refusal, change of appraiser, interpreter
In addition to ensuring the impartiality of the expert witness in the process of resolving criminal cases, the impartiality of the expert witness and the interpreter is very necessary. These are the expert witnesses because of legal obligations. They help the expert witness to resolve
to decide the case quickly, correctly and objectively. Therefore, they must stand in an objective and impartial position when performing their duties. Therefore, they must also refuse or be changed when there are certain grounds.
According to the provisions of Clause 4, Article 60, Clause 3, Article 61 of the Criminal Procedure Code, the expert and interpreter must refuse to provide expert advice or be replaced if:
- The expert or interpreter is also the victim, civil plaintiff, civil defendant; a person with rights and obligations related to the case; a legal representative or relative of those people or of the accused;
- There are other clear grounds to believe that the expert or interpreter may not be impartial in the performance of his or her duties;
- An expert or interpreter who has participated in the trial as the Head, Deputy Head of the Investigation Agency, Investigator, Chief, Deputy Chief of the Procuracy, Prosecutor, Chief Justice, Deputy Chief Justice of the Court, Judge, Juror, Court Secretary or has participated as a defender, witness, or has participated as an expert shall not participate as an interpreter and vice versa in that case.
Above are three grounds for which an expert or interpreter must refuse or be replaced if participating in a criminal proceeding. These grounds are similar to the grounds for refusal or being replaced for a person conducting a criminal proceeding. However, the third ground stipulates that an expert or interpreter must refuse or be replaced when they have acted in the role of all persons conducting a criminal proceeding, not just those directly conducting the proceedings, as they would have to refuse or be replaced when they have acted in the capacity of the Head or Deputy Head of the Investigation Agency or as the Chief Prosecutor or Chief Justice of the Court.
b. Right to request or request a change of the mediator or mediator
According to the provisions of the Law on Administrative Procedures, in addition to the refusal of the mediators and mediators themselves when they find themselves unable to be impartial in performing their duties, the competent persons also have the right to change them when they see grounds stipulated in the Law on Administrative Procedures. However, the competent persons to change the mediators and mediators do not always know that these persons are not impartial, so the Law on Administrative Procedures stipulates the persons who have the right to propose and request the change of the mediators and mediators.
According to Article 43 of the Criminal Procedure Code, the following persons have the right to request a change of the investigator: First , the Prosecutor: this is the investigator who represents the Procuracy to perform two functions of exercising the right to prosecute and supervising compliance with the law in judicial activities. Therefore, with these functions, the Prosecutor is the person who can detect cases showing signs of non-objectivity and non-impartiality of the investigator and from there propose a change of the investigator. In addition, at Point b, Clause 2, Article 36 of the Criminal Procedure Code stipulates the duties and powers of the Chief Prosecutor and at Clause 3, Article 112 stipulates the duties and powers of the Procuracy when performing its functions in the process of resolving criminal cases, it has the right to request the Head of the Investigation Agency to change the Investigator. However, Article 37 of the Criminal Procedure Code stipulates the duties, powers and responsibilities of the Prosecutor, but does not stipulate the right to request a change of the investigator for the Prosecutor; Second are the accused, defendant, victim, civil plaintiff, civil defendant and their legal representatives. As analyzed above, these people are people whose interests are affected by the decisions of the court. Therefore, they want fairness and objectivity in the process of resolving criminal cases. They are always concerned about the impartiality and impartiality of the court. Once the court still has doubts about the impartiality of the court, they will no longer trust the decisions of the court and from there will no longer trust the law. Therefore, in order for the court to be assured of the actions and decisions of the court, the Law on Criminal Procedure stipulates that the accused, defendant, victim, civil plaintiff, civil defendant and their legal representatives have the right to request a change of the court to protect their interests. This right of the mediators is clearly affirmed when regulating the rights of these people in Point d, Clause 2, Article 49, Point d, Clause 2, Article 50, Point c, Clause 2, Article 51, Point c, Clause 2, Article 52 and Point d, Clause 2, Article 53. However, the Law on Criminal Procedure does not stipulate that the mediator is a person with related rights and obligations as prescribed in Article 54 of the Criminal Procedure Code who has the right to request a change of the mediator. Although Article 54 of the Criminal Procedure Code does not provide the concept of a person with related rights and obligations in a case, in reality, their rights and interests may also be affected by the decisions of the mediator, because they themselves do not have the right to request a change of the mediator even though they see grounds, so their legal representatives do not have this right;


![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)


