CN107864092A - A kind of cloud content distribution method, device based on multicasting technology - Google Patents

A kind of cloud content distribution method, device based on multicasting technology Download PDF

Info

Publication number
CN107864092A
CN107864092A CN201711049341.8A CN201711049341A CN107864092A CN 107864092 A CN107864092 A CN 107864092A CN 201711049341 A CN201711049341 A CN 201711049341A CN 107864092 A CN107864092 A CN 107864092A
Authority
CN
China
Prior art keywords
node
cloud
message
distribution path
distribution
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201711049341.8A
Other languages
Chinese (zh)
Other versions
CN107864092B (en
Inventor
陆佃杰
刘玉洁
张桂娟
刘弘
徐卫志
于惠
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shandong Normal University
Original Assignee
Shandong Normal University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shandong Normal University filed Critical Shandong Normal University
Priority to CN201711049341.8A priority Critical patent/CN107864092B/en
Publication of CN107864092A publication Critical patent/CN107864092A/en
Application granted granted Critical
Publication of CN107864092B publication Critical patent/CN107864092B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/16—Multipoint routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations
    • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/1845—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast broadcast or multicast in a specific location, e.g. geocast
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations
    • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/185—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with management of multicast group membership
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/18—Loop-free operations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/30—Routing of multiclass traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network

Abstract

The present invention relates to a kind of cloud content distribution method based on multicasting technology and device, method to include：The node of cloud website is received, set of node is established, set of node is divided into some subsets, the node uses coordinate representation；According to the average coordinates of each subset, the method for the most short Euclidean distance of utilization determines the key node of each subset；Using the source server node in cloud website as multicast group group leader's node, key node is as multicast members' node；Send and broadcast the message from multicast group group leader node to member node, member node determines the distribution path of cloud content according to the broadcast message, and cloud content is transmitted according to the distribution path.

Description

A kind of cloud content distribution method, device based on multicasting technology
Technical field
The present invention relates to cloud content distributing network field, specifically a kind of cloud content distribution method based on multicasting technology, Device.
Background technology
Source station content distribution to all nodes in the whole nation, can effectively be shortened user and check object by cloud content distributing network Delay, improve user and access the response speed of website and the availability of website, solve network bandwidth is small, user's visit capacity is big, The problems such as network point distribution inequality.At present, data content is distributed using cloud content distributing network, although with traditional content Distribution network, which is compared, can save a large amount of running costs, but with the continuous development of cloud storage content distributing network, content distribution Cost is big, distributes high energy consumption, and increasingly severe the problems such as QoS of customer difference, traditional content distribution energy optimization strategy is Cloud storage distribution is not adapted to, therefore finds a kind of distribution method of energy optimization to turn into focus.
The content of the invention
For the deficiencies in the prior art, the invention provides a kind of cloud content distribution side based on multicasting technology Method, by the key node Selection Strategy of beeline, cloud content distribution is set to cover whole network as much as possible, with reference to minimum The cloud content for distributing cost places QoS routing selection strategy, saves cloud copy of content distribution cost.
The technical scheme is that：
A kind of cloud content distribution method based on multicasting technology, including：
The node of cloud website is received, set of node is established, set of node is divided into some subsets, the node uses coordinates table Show；
According to the average coordinates of each subset, the method for the most short Euclidean distance of utilization determines the key node of each subset；
Saved the source server node in cloud website as multicast group group leader's node, key node as multicast members Point；
Send and broadcast the message from multicast group group leader node to member node, member node determines cloud according to the broadcast message The distribution path of content, cloud content is transmitted according to the distribution path.
Further, set of node is divided into some subsets includes：
Number of packet is determined using K-Canopy methods, set of node is divided into by several subsets according to the number of packet.
Further, determine that the number of packet in the set of node includes using K-Canopy methods：
(31) initial threshold value T1,T2, wherein T2For the average distance of all nodes in set of node, T1For twice of T2, just Beginningization k is 0；
(32) if set of node is not sky, a node r is randomly selected from set of node0Add as center, and by k value 1；
(33) calculate node concentrates remaining node to r0Distance d, if d is less than T2, then the node is grouped into r0For in In the subset of the heart, and the node is deleted from set of node；If d is more than T2Less than T1, then the node is grouped into r0Centered on Subset in；If d is more than T1Do not operate then；
(34) repeat step (31)-(33), until set of node for sky, obtain number of packet k.
Further, member node determines that the distribution path of cloud content includes according to the broadcast message：Broadcast is received to disappear The member node of breath is activated, and distributes road for the purpose of being established between the member node being activated so that distribution is energy consumption minimized Footpath.
Further, establish so that it is that purpose distribution path includes to distribute energy consumption minimized：
The member node being activated sends solicited message as sending node, to remaining member node, request with remaining into Member's node establishes connection；
The member node for receiving the solicited message judges whether its own is optimal node, if optimal node, then according to Reverse route replys the solicited message to sending node；
When the reply quantity that sending node receives is more than or equal to 1, saved in sending node and the member nearest from its own Exclusive path is established between point, travels through each member node, forms distribution path.
Further, the selection of the optimal node includes：Compare its own to multicast group group leader's node distance whether Distance than sending node to multicast group group leader's node is small, if it is not, then being judged as non-optimal node；If it is, check Whether its own received the solicited message that identical sending node is sent, if do not received, was judged as optimal node, such as Fruit receives, and compares historical requests information, selects the sending node that path length is most short and hop count is minimum, and according to reverse route The solicited message is replied to sending node.
Further, traveling through each member node includes：Determine the upper hop node and next-hop section of the exclusive path Point, the path is sent to next-hop node.
Further, in addition in the distribution path via node is added, if the via node and distribution path shape Into loop, then the loop is deleted.
The invention also provides a kind of storage device, is stored with a plurality of instruction, and the instruction is loaded and performed by processor Handle below：
The node of cloud website is received, set of node is established, set of node is divided into some subsets, the node uses coordinates table Show；
According to the average coordinates of each subset, the method for the most short Euclidean distance of utilization determines the key node of each subset；
Saved the source server node in cloud website as multicast group group leader's node, key node as multicast members Point；
Send and broadcast the message from multicast group group leader node to member node, member node determines cloud according to the broadcast message The distribution path of content, cloud content is transmitted according to the distribution path.
The present invention also proposed a kind of cloud content delivering apparatus based on multicasting technology on the basis of above-mentioned storage device, Including processor, for realizing each instruction；And storage device, for storing a plurality of instruction, the instruction is loaded by processor And perform following handle：
The node of cloud website is received, set of node is established, set of node is divided into some subsets, the node uses coordinates table Show；
According to the average coordinates of each subset, the method for the most short Euclidean distance of utilization determines the key node of each subset；
Saved the source server node in cloud website as multicast group group leader's node, key node as multicast members Point；
Send and broadcast the message from multicast group group leader node to member node, member node determines cloud according to the broadcast message The distribution path of content, cloud content is transmitted according to the distribution path.
Beneficial effects of the present invention：
The present invention distributes the copy of cloud content and covered as much as possible by the key node Selection Strategy based on beeline Lid whole network, the Replica placement QoS routing selection strategy of cost is distributed by minimizing, save copy distribution cost.Should Method constructs the distribution tree of all key nodes of connection, and copy content need to only distribute along distribution tree, with existing cloud Content distributing network is compared, and can effectively reduce the message complexity of system, reduces energy consumption, improves the service quality of user.
Brief description of the drawings
Accompanying drawing 1 is flow chart of the method for the present invention.
Embodiment：
The invention will be further described with embodiment below in conjunction with the accompanying drawings：
It is noted that described further below is all exemplary, it is intended to provides further instruction to the application.It is unless another Indicate, all technologies used herein and scientific terminology are with usual with the application person of an ordinary skill in the technical field The identical meanings of understanding.
It should be noted that term used herein above is merely to describe embodiment, and be not intended to restricted root According to the illustrative embodiments of the application.As used herein, unless the context clearly indicates otherwise, otherwise singulative It is also intended to include plural form, additionally, it should be understood that, when in this manual using term "comprising" and/or " bag Include " when, it indicates existing characteristics, step, operation, device, component and/or combinations thereof.
The present invention a kind of exemplary embodiments be：
As shown in figure 1, embodiments of the invention input the coordinate set of all cloud websites in cloud content distributing network first R, number of packet number k is then determined by K-Canopy algorithms, whole network is divided into k followed by K-Means clusters Subset, can also turn into cluster, and the key node Algorithms of Selecting based on beeline is selected a key node to each cluster, that is, closed Key node, we use M (M0,M1,M2,...,Mk) represent that node set is pressed in the first all joints.
Determine that the method for number of packet includes in the present embodiment：
Initial threshold value T first1,T2, wherein T2For the average distance of all nodes in set of node, T1For twice of T2, just Beginningization k is 0；
If then set of node is not sky, a node r is randomly selected from set of node0Add as center, and by k value 1；
Then calculate node concentrates remaining node to r0Distance d, if d is less than T2, then the node is grouped into r0For in In the subset of the heart, and the node is deleted from set of node；If d is more than T2Less than T1, then the node is grouped into r0Centered on Subset in；If d is more than T1Do not operate then；
Finally repeat the above steps, until set of node for sky, obtain number of packet number k.
After number of packet determines, set of node is divided into by multiple subsets according to number of packet, calculates being averaged for each subset Coordinate value, find key node of the node nearest from average coordinates Euclidean distance as each subset, that is, key node. Wherein M0Represent source server node, M1,M2,...,MkRepresent the key node selected
After determining key node, the cloud copy of content that we distribute cost according to minimizing places QoS routing selection Strategy establishes the distribution tree of all key nodes of connection, and during this, we select source server node as the distribution Group leader's node of tree, the key node selected is as multicast mem's node, by establishing a connection for each member node To the mode of its nearest-neighbors member node, establish a connection all-multicast group membership node and allow via node to add Distribution tree.
We mainly introduce the distribution tree that a connection all-multicast member node is established by QoS routing selection below Detailed process.
Step 1：As multicast group group leader's node, the key node selected saves source server node as multicast members Point.Group leader's node sends broadcast message and wakes up all member nodes.
The form to be broadcast the message during this is：Group leader's node address, destination node address #1, destination node address # 2...
The node of the message is received if member node, each member node has unique QoS routing table, when After receiving the broadcast message, the QoS routing table of oneself is updated, group address is arranged to the group address of the multicast group, by multicast group Group leader address is arranged to the group leader address of the multicast group.If not member node, then continue to forward the message, until all more Group membership's node is broadcast all to be activated.
QoS routing table includes following information：Multicast group group ID, multicast group group leader address, destination node address, next-hop Address
Step 2：Each multicast members' node sends RREQ_JOIN solicited messages, also may be used using itself as sending node To be request message.
RREQ_JOIN message formats are：Multicast group group ID, sending node address, sequence node, path length, hop count, on One hop node address
Step 3：The member node for receiving the solicited message judges whether its own is optimal node, if optimal node, Then the solicited message is replied according to reverse route to sending node；
The judgement of optimal node uses following methods：Updating that the path length of the message jumps to for path length plus one ought The path length of front nodal point；By hop count plus 1；Oneself is added into sequence node, continues to forward the message；Check the multicast road of oneself By table, see oneself whether be sending node want the group membership's node i.e. multicast group group ID of oneself of multicast group that adds whether with The group ID of sending node is identical, if it is, compare oneself to source node distance whether than sending node to source node distance It is small, if whether oneself is smaller than the distance of sending node to source node to the distance of source node, then check whether oneself receives The RREQ_JOIN messages that identical sending node is sent are crossed, if so, comparing the path length of the two, and reaches and sends section The hop count of point, we select the minimum RREQ_JOIN of path length most short and hop count, if the node preferentially finishes, just according to Entrained reverse routing iinformation sends RREP_J to sending node when RREQ_JOIN is sent.
RREP_J message formats are：Multicast group group ID, sending node address, response node address, sequence node, path length Degree, hop count.
For RREP_J while being propagated along reverse path, it is more to this to add the node in its unicast routing table for node on the way The routing information of group is broadcast, wherein source node address fills out the node Self address, and the hair for sending RREQ_JOIN is filled in and issued in destination node address Send node address.
Unicast routing table includes following information：Source node address, destination node address, upper hop address, next hop address
Step 4：Sending node waits RREP_J, is more than if receiving quantity after RREQ_JOIN is broadcasted for a period of time 1 RREP_J, then sending node just needs to carry out preferentially process, selects the multicast members node nearest from oneself to send RREP_J.During this, if smaller than the distance of sending node to source node without the distance of member node to source node, that The sending node directly establishes the link with source node.
Step 5：After the completion of preferentially process, sending node just have selected the path for reaching multicast group.So send Node just by inversely routeing to the multicast mem node transmission MACT_Confirm message nearest from oneself, receives the multicast of message Member node then sends MACT route active informations, activates a path from the member node to sending node, adds multicast Destination node address is the address of sending node in routing table, and next hop address is with reaching the next-hop node of sending node Location, while the neighbor node for receiving MACT information adds a column information in unicast routing table<Mj1, Mj2, PHj, NHj>, Mj1,Mj2 Represent to send the member node address of MACT message respectively and need to receive the member node address of the MACT message, PHj, NHj Represent that present node reaches the upper hop and next-hop of destination node respectively.
The form of MACT_Confirm message is：Source node address, destination node address, sequence node
The form of MACT message is：Source node address, destination node address, sequence node
Further, for a via node u, if u is multipair member node to shared relaying, then be possible to Have loop to produce, in the present embodiment, cancel loop using MACT_Eliminate message is sent, specifically include：
If via node u is multigroup receiving node to shared relaying, then would be possible to produce loop, this process Such loop is checked for, and cancels loop.
If via node u is the relaying of k group receiving nodes pair, these nodes are to being expressed as (M11,M12), (M21, M22) ..., (Mk1, Mk2), it will be assumed that Mi1It is to compare Mi2(1≤i≤k) from source node closer to multicast members' node, relaying Nodes records are from Mi1To Mi2Path in its upper hop and next-hop, use PH respectivelyiAnd NHiRepresent.Randomly choose one group Receiving node is to (Mj1,Mj2), keep information (Mj1, Mj2, PHj, NHj) constant, for others (Mi1, Mi2) right, work as Mi1≠Mj1, The information of unicast routing table is revised as (M by via node uj1, Mi2, PHj, NHi), i.e., source node is revised as to the path of reservation Source node, upper hop are revised as the upper hop of via node in the path of reservation.Finally send MACT_Eliminate message< Mi1, Mi2,PHi>。
The node w of MACT_Eliminate message is received if upper hop node PHiAnd node non-multicast member saves Point, then do following operation：Change the PH of MACT_Eliminate messageiFor from Mi1To Mi2The upper hop of w nodes on path；Continue MACT_Eliminate message is sent to upper hop；Delete the routing iinformation of w nodes in unicast routing table<Mi1,Mi2,PHi,NHi >.The operation is repeated until PHiFor multicast mem's node, thus eliminating the need unnecessary path.
The form of MACT_Eliminate message is：Source node address destination node address upper hop address
So far, we set up the distribution tree of a connection all-multicast member node, that is, distribution path, along upper State distribution path and enter the transmission of content of racking, advantageously reduce energy consumption.
Finally we introduce set forth herein EEDM models energy consumption consumption, and with using broadcast carry out copy distribution energy Consumption consumption is contrasted.Detailed process is as follows：
1. calculate the energy consumption consumption of EEDM models.
The first step：Determine the energy consumption formulas of EEDM models.
The energy consumption of data distribution mainly exchanges the number of message by distribution tree tree length and when building distribution tree in EEDM models Amount determines, and energy consumption cost is long to distribution tree tree, it is directly proportional to exchange message number.The energy consumption that we establish CCDN data distributions is public Formula, it is expressed as：
P=T × (La+mb) (1)
Wherein P represents total energy consumption caused by distribution department data, and unit is J；T is the packet number sent；L is structure The overall length for the distribution tree built；M is the total quantity that information is exchanged in data dissemination process；A and b is power consumption parameter, represents hair respectively Send unit length data and exchange energy consumption needed for an information.
Second step：Arrange parameter value.
We assume that it is T=10 that Node distribution, which in 100 × 100 square area, sets current distributed tasks,3Individual data Bag, each data package size is 20k, and sets a=b=50nJ/bit.
3rd step：Specific calculating process.
Formula (1) is carried out abbreviation by us according to the parameter value determined first, and we can obtain parameter value substitution formula：
P=T × (La+mb)=20 × 103×103×(L+m)×50×10-9=(L+m)
When node Normal Distribution, when clustering algorithm uses K-Means, by taking current network size 500 as an example, we obtain The distribution tree overall length arrived is 283, and obtained exchange information total quantity is 806, and the total energy consumption now obtained is 1089J.
2. calculate the energy consumption consumption that copy distribution is carried out using broadcast.
The first step：Determine energy consumption formulas.
When carrying out copy distribution using broadcast, source node and destination node known to us, source node send broadcast message, Transmit data to all destination nodes.The distribution tree that data distribution is carried out using the mode of broadcast is a length of from source node arrival The path length undergone during all purposes node, all sections when exchanging message number to reach all purposes node from source node The quantity of point broadcast message.We still use formula (1) to be used as energy consumption formulas.
Second step：Arrange parameter value.
We assume that it is T=10 that Node distribution, which in 100 × 100 square area, sets current distributed tasks,3Individual data Bag, each data package size is 20k, and sets a=b=50nJ/bit.
3rd step：Specific calculating process.
When node Normal Distribution, when clustering algorithm uses K-Means, by taking current network size 500 as an example, we obtain The distribution tree overall length arrived is 860, and obtained exchange information total quantity is 2960, and the total energy consumption now obtained is 3820J.
3. work as node Normal Distribution, when clustering algorithm uses K-Means, by taking network size 500 as an example, EEDM models With the energy consumption consumption respectively 1089,3820 for carrying out data distribution using broadcasting and being tried to achieve.Obviously line number is entered using EEDM models Want low more according to the energy consumption consumption of distribution.
The preferred embodiment of the application is the foregoing is only, is not limited to the application, for the skill of this area For art personnel, the application can have various modifications and variations.It is all within spirit herein and principle, made any repair Change, equivalent substitution, improvement etc., should be included within the protection domain of the application.

Claims (10)

  1. A kind of 1. cloud content distribution method based on multicasting technology, it is characterised in that including：
    The node of cloud website is received, set of node is established, set of node is divided into some subsets, the node uses coordinate representation；
    According to the average coordinates of each subset, the method for the most short Euclidean distance of utilization determines the key node of each subset；
    Using the source server node in cloud website as multicast group group leader's node, key node is as multicast members' node；
    Send and broadcast the message from multicast group group leader node to member node, member node determines cloud content according to the broadcast message Distribution path, according to the distribution path transmit cloud content.
  2. 2. according to the method for claim 1, it is characterised in that set of node is divided into some subsets includes：
    Number of packet is determined using K-Canopy methods, coordinate set is divided into by several subsets according to the number of packet.
  3. 3. according to the method for claim 2, it is characterised in that determine that number of packet includes using K-Canopy methods：
    (31) initial threshold value T1,T2, wherein T2For the average distance of all nodes in set of node, T1For twice of T2, initialize k For 0；
    (32) if set of node is not sky, a node r is randomly selected from set of node0Add 1 as center, and by k value；
    (33) calculate node concentrates remaining node to r0Distance d, if d is less than T2, then the node is grouped into r0Centered on In subset, and the node is deleted from set of node；If d is more than T2Less than T1, then the node is grouped into r0Centered on son Concentrate；If d is more than T1Do not operate then；
    (34) repeat step (31)-(33), until set of node for sky, obtain number of packet k.
  4. 4. according to the method for claim 1, it is characterised in that member node determines cloud content according to the broadcast message Distribution path includes：The member node for receiving broadcast message is activated, and is established between the member node being activated so that distribution Energy consumption minimized is purpose distribution path.
  5. 5. according to the method for claim 4, it is characterised in that establish so that it is purpose distribution path to distribute energy consumption minimized Including：
    The member node being activated sends solicited message, request saves with remaining member as sending node to remaining member node Point establishes connection；
    The member node for receiving the solicited message judges whether its own is optimal node, if optimal node, then according to reverse It route to sending node and replys the solicited message；
    When the reply quantity that sending node receives is more than or equal to 1, sending node and the member node nearest from its own it Between establish exclusive path, travel through each member node, form distribution path.
  6. 6. according to the method for claim 5, it is characterised in that the selection of the optimal node includes：Compare its own to arrive Whether the distance of multicast group group leader's node is smaller than the distance of sending node to multicast group group leader's node, if it is not, then being judged as Non-optimal node；If it is, check whether its own received the solicited message that identical sending node is sent, if do not had Receive, be then judged as optimal node, if receiving, compare historical requests information, select path length most short minimum with hop count Sending node, and reply the solicited message to sending node according to reverse route.
  7. 7. according to the method for claim 5, it is characterised in that traveling through each member node includes：Determine unique road The upper hop node and next-hop node in footpath, the path is sent to next-hop node.
  8. 8. according to the method for claim 5, it is characterised in that also include adding via node in the distribution path, If the via node forms loop with distribution path, the loop is deleted.
  9. 9. a kind of storage device, it is characterised in that be stored with a plurality of instruction, the instruction is loaded by processor and performed following Reason：
    The node of cloud website is received, set of node is established, set of node is divided into some subsets, the node uses coordinate representation；
    According to the average coordinates of each subset, the method for the most short Euclidean distance of utilization determines the key node of each subset；
    Using the source server node in cloud website as multicast group group leader's node, key node is as multicast members' node；
    Send and broadcast the message from multicast group group leader node to member node, member node determines cloud content according to the broadcast message Distribution path, according to the distribution path transmit cloud content.
  10. 10. a kind of cloud content delivering apparatus based on multicasting technology, including processor, for realizing each instruction；And storage dress Put, for storing a plurality of instruction, it is characterised in that the instruction is loaded by processor and performs following processing：
    The node of cloud website is received, set of node is established, set of node is divided into some subsets, the node uses coordinate representation；
    According to the average coordinates of each subset, the method for the most short Euclidean distance of utilization determines the key node of each subset；
    Using the source server node in cloud website as multicast group group leader's node, key node is as multicast members' node；
    Send and broadcast the message from multicast group group leader node to member node, member node determines cloud content according to the broadcast message Distribution path, according to the distribution path transmit cloud content.
CN201711049341.8A 2017-10-31 2017-10-31 Cloud content distribution method and device based on multicast technology Expired - Fee Related CN107864092B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711049341.8A CN107864092B (en) 2017-10-31 2017-10-31 Cloud content distribution method and device based on multicast technology

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711049341.8A CN107864092B (en) 2017-10-31 2017-10-31 Cloud content distribution method and device based on multicast technology

Publications (2)

Publication Number Publication Date
CN107864092A true CN107864092A (en) 2018-03-30
CN107864092B CN107864092B (en) 2020-03-27

Family

ID=61697029

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711049341.8A Expired - Fee Related CN107864092B (en) 2017-10-31 2017-10-31 Cloud content distribution method and device based on multicast technology

Country Status (1)

Country Link
CN (1) CN107864092B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109922161A (en) * 2019-04-10 2019-06-21 山东师范大学 Content distribution method, system, equipment and the medium of dynamic cloud content distributing network
CN111629037A (en) * 2020-05-14 2020-09-04 山东师范大学 Dynamic cloud content distribution network content placement method based on collaborative reinforcement learning
CN112218121A (en) * 2019-07-09 2021-01-12 中国移动通信集团安徽有限公司 Content delivery network scheduling method and device
CN115086884A (en) * 2022-04-22 2022-09-20 三维通信股份有限公司 Narrow-wave multicast directional transmission method, system and readable storage medium

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007036681A (en) * 2005-07-27 2007-02-08 Hitachi Communication Technologies Ltd Multicast distribution method and system, and content server
JP2010148046A (en) * 2008-12-22 2010-07-01 Toshiba Corp Distribution management apparatus and content distribution method
CN103179037A (en) * 2012-12-13 2013-06-26 清华大学 Data transmission method of content-centric datacenter network
CN103188278A (en) * 2011-12-27 2013-07-03 中国电信股份有限公司 Method and system for content data distribution
CN103905315A (en) * 2012-10-22 2014-07-02 阿瓦亚公司 Architecture for virtualization and distribution of routing information used in a transport network
CN106162209A (en) * 2016-06-30 2016-11-23 中国科学院计算技术研究所 A kind of content distributing network live broadcast system based on SDN technology and method
CN106330731A (en) * 2016-09-12 2017-01-11 北京交通大学 Wireless Ad hoc network multicast tree establishing method

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007036681A (en) * 2005-07-27 2007-02-08 Hitachi Communication Technologies Ltd Multicast distribution method and system, and content server
JP2010148046A (en) * 2008-12-22 2010-07-01 Toshiba Corp Distribution management apparatus and content distribution method
CN103188278A (en) * 2011-12-27 2013-07-03 中国电信股份有限公司 Method and system for content data distribution
CN103905315A (en) * 2012-10-22 2014-07-02 阿瓦亚公司 Architecture for virtualization and distribution of routing information used in a transport network
CN103179037A (en) * 2012-12-13 2013-06-26 清华大学 Data transmission method of content-centric datacenter network
CN106162209A (en) * 2016-06-30 2016-11-23 中国科学院计算技术研究所 A kind of content distributing network live broadcast system based on SDN technology and method
CN106330731A (en) * 2016-09-12 2017-01-11 北京交通大学 Wireless Ad hoc network multicast tree establishing method

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
MACHAL AIBIN: "《Multicasting versus anycasting: How to efficiently deliver content in elastic optical networks》", 《2016 18TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS》 *
陈强等: "《K-Canopy: 一种面向话题发现的快速数据切分算法》", 《山东大学学报（理学版）》 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109922161A (en) * 2019-04-10 2019-06-21 山东师范大学 Content distribution method, system, equipment and the medium of dynamic cloud content distributing network
CN109922161B (en) * 2019-04-10 2021-10-19 山东师范大学 Content distribution method, system, device and medium for dynamic cloud content distribution network
CN112218121A (en) * 2019-07-09 2021-01-12 中国移动通信集团安徽有限公司 Content delivery network scheduling method and device
CN111629037A (en) * 2020-05-14 2020-09-04 山东师范大学 Dynamic cloud content distribution network content placement method based on collaborative reinforcement learning
CN115086884A (en) * 2022-04-22 2022-09-20 三维通信股份有限公司 Narrow-wave multicast directional transmission method, system and readable storage medium
CN115086884B (en) * 2022-04-22 2023-10-17 三维通信股份有限公司 Narrow-wave multicast directional transmission method, system and readable storage medium

Also Published As

Publication number Publication date
CN107864092B (en) 2020-03-27

Similar Documents

Publication Publication Date Title
CN108112049B (en) A kind of wireless sensor network efficiency optimization cluster-dividing method based on whale group algorithm
CN107864092A (en) A kind of cloud content distribution method, device based on multicasting technology
CN104394236B (en) Node combines the distributed collaborative caching method perceived with message status
Verma et al. Integrated routing protocol for opportunistic networks
Das et al. Selfish node detection and low cost data transmission in MANET using game theory
Du et al. A routing protocol for UAV-assisted vehicular delay tolerant networks
Robinson et al. FPSOEE: Fuzzy-enabled particle swarm optimization-based energy-efficient algorithm in mobile ad-hoc networks
Ramamoorthy et al. An improved distance‐based ant colony optimization routing for vehicular ad hoc networks
Srinivas Cluster based energy efficient routing protocol using ANT colony optimization and breadth first search
CN107690167A (en) A kind of expansible network clustering method of wireless sensor
CN107846719A (en) A kind of wireless sensor network routing method based on improvement gam algorithm
CN105050149A (en) Routing method for overcoming congestion of tree type Zigbee network
CN106209627A (en) Vehicle-mounted distributing based on node-node transmission ability focuses on Routing Protocol method
CN100471166C (en) Distribution type QoS multi-broadcast routing method based on mobile Ad Hoc network
Quy et al. A High-Performance Routing Protocol for Multimedia Applications in MANETs.
CN102480692B (en) As-demanded multicast routing method of distributed bandwidth constraint in Wireless Ad Hoc Networks
Gong et al. A distributed algorithm to construct multicast trees in WSNs: An approximate steiner tree approach
CN100534042C (en) Two-stage distributed application layer multicasting method facing to MSVMT problem
CN107040466A (en) The routing resource of domain collaborative multi data transfer based on Internet of Things layer architecture
Lodhi et al. Transient Multipath routing protocol for low power and lossy networks.
Leão et al. Latency and network lifetime trade-off in geographic multicast routing for multi-sink wireless sensor networks
Chavan et al. Event Based Clustering Localized Energy Efficient Ant Colony Optimization for Performance Enhancement of Wireless Sensor Network.
CN110891253B (en) Community popularity-based vehicle-mounted delay tolerant network routing method
Chengetanai et al. Q-PSO: Hybridisation of Particle Swarm Optimisation with Queuing Theory for Mitigating Congestion on Mobile Ad-hoc Networks While Optimising Network Lifetime.
Liu et al. A grid and vehicle density prediction-based communication scheme in large-scale urban environments

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20200327

Termination date: 20211031