Rumor Spread Mechanism in Typical Rumor Case 1A

96. Rakow, L.F., & Kranich, K. (1991), “Woman as sign in television news”,

Journal of Communication 41(1), pp. 8-23.

97. Richins, ML (1983), “Negative word-of-mouth by dissatisfied consumers: A pilot study”, The journal of marketing , pp. 68-78.

98. Rice, RE, & Richards, WD (1985), “An overview of network analysis methods and programs”, Progress in communication sciences ( 6) , pp. 105- 165.

99. Rosnow, RL (2001), Rumor and gossip in interpersonal interaction and beyond: A social exchange perspective , In RM

100. Rosnow, RL (1988), “Rumor as communication: A contextualist approach”, Journal of Communication 38(1), pp. 12-28.

101. Rosnow, R.L., Esposito, J.L., & Gibney, L. (1988), “Factors involving rumor spreading: Replication and extension,” Language & Communication .

102. Rosnow, RL, Yost, JH, & Esposito, JL (1986), “elief in rumor and likelihood of rumor transmission”, Language & Communication .

103. Rosnow, RL, & Kimmel, AJ (1979), “Lives of a rumor”, Psychology Today 13 (1), pp. 88-92.

104. Rosnow, RL (1991), “Inside rumor: A personal journey”, American Psychologist 46 (5), pp. 484.

105. Rowan, R. (1979), “Where did that rumor come from”, Fortune 100 (3), 130.

106. Rosen, E. (2000), “The Anatomy of uzz: How to create word-of-mouth marketing”, Marketing Management 9 (4), pp. 62.

107. Rosnow, RL, & Foster, EK (2005), “Rumor and gossip research”,

Psychological Science Agenda 19 (4), pp. 1-2.

108. Rogers, E.M. (1986). Communication technology (Vol. 1). Simon and Schuster.

109. Rogers, CR (1962), “The interpersonal relationship”, Harvard Educational Review 32 (4), pp. 416-429.

110. Schachter, S., & urdick, H. (1955), “A field experiment on rumor transmission and distortion”, The Journal of Abnormal and Social Psychology 50 (3), pp. 363.

111. Schudson, Michael (2003), The Sociology of News , Edited by Jeffrey Alexander, Contemporary Societies. New York: WW Norton & Company, Inc.

112. Sennett, Richard. (1992), The fall of public man, New York.

113. Sellnow, TL, & Seeger, MW (2013), Theorizing crisis communication (Vol. 4), John Wiley & Sons.

114. Smith, RD (2002), “Instant messaging as a scale-free network”, arXiv preprint cond-mat/0206378 .

115. Sweetser, KD, & Metzgar, E. (2007), “Communicating during crisis: Use of blogs as a relationship management tool”, Public Relations Review 33 (3), pp. 340-342.

116. Shirky, C. (2011), “The political power of social media: Technology, the public sphere, and political change”, Foreign affairs , pp. 28-41.

117. Stephens, KK, & Malone, PC (2009), “If the organizations won't give us information…: The use of multiple new media for crisis technical translation and dialogue”, Journal of Public Relations Research 21 (2), pp. 229-239.

118. Solove, DJ (2007), The future of reputation: Gossip, rumor, and privacy on the Internet , Yale University Press.

119. Schieman, S., & Van Gundy, K. (2000), “The personal and social links between age and self-reported empathy”, Social Psychology Quarterly , pp. 152-174.

120. Shibutani, T. (1966), Improvised news , Ardent Media.

121. Silver, N. (2012), The signal and the noise: the art and science of prediction , Penguin UK.

122. Sinha, D. (1952), “Ehaviour in a catastrophic situation: A psychological study of reports and rumors”, British Journal of Psychology. General Section 43 (3), pp. 200-209.

123. Simmons, D. . (1985, November), “The nature of the organizational grapevine”, Supervisory Management , pp. 39-42.

124. Schlesinger, Robert (April 14, 2017), "Fake News in Reality", US News & World Report .

125. Stewart, PJ, & Strathern, A. (2004), Witchcraft, sorcery, rumors and gossip (Vol. 1), Cambridge University Press.

126. Speier, H. (1950), “Historical development of public opinion” American Journal of Sociology 55 (4), 376-388.

127. Smith, RE, & Vogt, CA (1995), “The effects of integrating advertising and negative word - of - mouth communications on message processing and response” Journal of Consumer Psychology 4 (2), pp. 133-151.

128. Smith, BC (1985), Decentralization: the territorial dimension of the state, Taylor & Francis.

129. Sinclair, J., Jacka, E., & Cunningham, S. (1996), “New patterns in global television”, Media Studies: A Reader , pp. 170-189.

130. Swan, JE, & Oliver, RL (1989), “Postpurchase communications by consumers”, Journal of Retailing , (65), pp. 16-533.

131. TARP/Technical Assistance Research Program. (1981), Measuring the grapevine: Consumer response and word-of-mouth , The Coca-Cola Co., Atlanta, GA.

132. Tuchman, G. (1972), “Objectivity as strategic ritual: An examination of newsmen's notions of objectivity”, American Journal of sociology 77(4), pp. 660-679.

133. Turner, PA (1992), “Ambivalent patrons: The role of rumor and contemporary legends in African-American consumer decisions”, Journal of American folklore , pp. 424-441.

134. Tarp/Technical Assistance Research Program. (1981), Measuring the grapevine: Consumer response and word-of-mouth, The Coca-Cola Co., Atlanta, GA.Turner, RH, & Killian, LM (1972). 1972Collective Behavior.

135. Voas, JM (2002), “Corporate rumors and conspiracy theories”, IT Professional 4 (2), pp. 62-64.

136. Walker, CJ, & eckerle, CA (1987), “The effect of state anxiety on rumor transmission”, Journal of Social Behavior and Personality 2 (3), pp. 353.

137. Walker, C. (1995, July), “Word of mouth” American Demographics, pp. 38- 44.

138. Wasserman, S., & Faust, K. (1994), Social network analysis: Methods and applications (Vol. 8), Cambridge university press.

139. Wells, KD, & Schwartz, JJ (1984), “Vocal communication in a neotropical treefrog, Hyla ebraccata: advertisement calls”, Animal Behavior, 32(2), pp. 405-420.

140. 133. Wolfe, MA (1978), Numerical methods for unconstrained optimization: An introduction, Van Nostrand Reinhold.

141. Zhou, L., & Zhang, D. (2007), An ontology-supported rumor model: Toward a digital rumor library, Systems, Man and Cybernetics , Part A: Systems and Humans, IEEE Transactions on, 37(5), pp. 804-813.

142. Ziegler, D., & White, A. (1990), “Women and suffering on network television news: An examination of correspondents and newsmakers”, Journal of Broadcasting & Electronic Media, 34(2), pp. 215-223.

143. World Journals, Database of Academic Research Journals. (nd). Public space. Retrieved from http://worldjournal.org/articles/Public_space

APPENDIX

Table 1 Mechanism of rumor dissemination in typical rumor case 1A

Day

Topics of rumors and phenomena	Messenger group
Day 1	- Heavy rain leads to flooding in many places	- Government agencies
	-Trung Son Hydropower Plant has discharged flood water with flow 1,800 m3/s	- Government agencies
Day 2	- Continued rain leads to rising water levels	- People
	- With this rain and flood, we're almost there.	- People
	-Trung Son Hydropower Plant is still releasing flood water.	- People
	- Trung Son Hydropower Plant continues to discharge floodwaters	- Government agencies
Day 3	- "The Zhongshan Dam broke, exactly." "You should move out."	- Facebook “T c Hai Nguyen”
	- “The Trung Son Hydropower Dam has broken. Please share it with me. So that everyone knows where to run, Co people. Salary is gone"	- Facebook "Tung Co Cuc"
	- Heavy rains flooded 5,000 houses, causing major damage to traffic and agriculture. career	- Press and people channels
	- Thousands of houses were flooded	- People
	- The dam is broken.	- People
	- The Co Luong people all ran away.	- People
Day 4	- Storm number 6 has arrived.	-People
	- Outside the dike above the dam broken	-People
	- The flood is here, let's run away!	-People
	- Hydroelectric plant discharges water leading to rupture	-People

Maybe you are interested!

• 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
• The relationship between travel motivation, destination image and destination choice - A case study of Binh Dinh province tourism destination - 1
• Characteristics of the Practice of the Right to Prosecute During the Investigation Stage of a Case of Intentionally Causing Injury or Harm to the Health of Another Person.
• The relationship between market orientation, learning orientation and business results of hotel and restaurant enterprises: A case study in Ho Chi Minh City - 36
• The impact of social capital on business performance - a case study of the Textile and Garment industry in the Southern region of Vietnam - 36

smashed
- "Currently, Quan Ha district is directing the district police to investigate and track down those who spread fabricated news about the "Trung Son hydroelectric dam collapse incident" to deal with it. according to the provisions of law".	- Government agencies, press channels (vnexpress.net) reported
- "The spreading of false rumors has caused anxiety for many people, negatively affecting the response and recovery work. flood	- Government agencies, press channels (vnexpress.net) reported.
- Searching for the person spreading the rumor of dam break Electricity in Thanh Hoa	- Press channel (ngoisao.net, dantri.com.vn, tienphong.vn)
- Summoned 2 subjects spreading news about dam break hydroelectric power in Thanh Ha	-Press channel (vietnamnet.vn)
Day 5	- Tien Phong newspaper on September 1 quoted information from the Fire Prevention and Fighting Police Department of Thanh Hoa province saying that 7 people have died and gone missing due to floods in the past few days in this province. According to Tien Phong, heavy rains from August 28 to 30 in Thanh Hoa caused floods, inundating 5,000 houses and causing great damage to transportation and agriculture. Tien Phong newspaper quoted Lieutenant Colonel Vo Van Hau, Chief of Police of Ky Son district, Nghe An, saying that a young man who spread rumors about a dam breaking was punished. 12.5 million dong	- Website www.rfa.org

Table 2 Mechanism of rumor dissemination in typical rumor case 1B

Day

Information and rumor topics	Messenger group
Day 1	99-year land allocation in special economic zones only 'benefits land speculators'	Member of National Assembly
	99-year land lease is a form of concession.	Member of National Assembly
	Special economic zones leasing land for 99 years is meaningless	Member of National Assembly
	Special economic zones leasing land for 99 years is meaningless	Member of National Assembly
	disagree with land lease term up to 99 years	Member of National Assembly
	99-year land lease is the mindset of real estate traders	Member of National Assembly
	Regulations on 99-year land allocation in the "burning land" special economic zone National Assembly School	Member of National Assembly
Day 2	Special economic zone law 'has many incentives but lacks constraints' responsibility'	Member of National Assembly
Day 3	Unhealthy competition between countries	Member of National Assembly
	Signs of policy corruption right from the consultation stage draft	Member of National Assembly
	Vietnam has agreed to lease land to China in special economic zones. with a term of 99 years.	Facebook
	Lai Van Sam speaks out against China's leasing back to VAN DON economic zone	Facebook
	Leasing special economic zones to foreigners means losing the country. Vietnam agrees to lease land to China for 99 years	Facebook
Day 4	Special economic zone for 99-year land lease: Prime Minister receives many letters, messages	Politicians, journalists
	Prime Minister: 99-year land lease term is not must be the key point in the Bill that with special economic zones,	Politicians, journalists

The important thing is to create mechanisms and an investment environment. favorable business
Day 5,6	Security risks when establishing special economic zones for 99-year lease	Member of National Assembly
	National Assembly Delegate: The 3 special economic zones are all "fertile lands" of the country.	Member of National Assembly
Day 7 to 10	On the morning of June 7, the Prime Minister said that he will absorb feedback to make appropriate adjustments to the situation; along with other solutions to ensure the nation's longevity, independent, sustainable development".	Politicians, journalists
	99-year land lease in special economic zones: People have rights and cause for concern!	Member of National Assembly
	Reduce land lease period of special economic zone from 99 years to 70 years year	Member of National Assembly
	Draft Law on Special Economic Zones will remove regulations on land lease 99 year	Real estate, media information
	Delay in passing law; people "surf" special economic zone land big mistake	Member of National Assembly
	Abolish regulations on land lease up to 99 years in special economic zones	Member of National Assembly
One month later	Continuing discussion on the Law on Special Economic Zones: Will continue to listen to opinions people, experts	Member of National Assembly
	Topics reach saturation point. Rumors swirl old topics