CN101582878B - Transmission method aiming at time-delayed sensitive data - Google Patents
Transmission method aiming at time-delayed sensitive data Download PDFInfo
- Publication number
- CN101582878B CN101582878B CN200810106441A CN200810106441A CN101582878B CN 101582878 B CN101582878 B CN 101582878B CN 200810106441 A CN200810106441 A CN 200810106441A CN 200810106441 A CN200810106441 A CN 200810106441A CN 101582878 B CN101582878 B CN 101582878B
- Authority
- CN
- China
- Prior art keywords
- node
- source
- packet
- path
- transmission
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a transmission method aiming at time-delayed sensitive data. The method is realized on the basis of an overlapped network platform and comprises the following steps: (1) a source service terminal sends a data transmission request to a source ON node transferred for an agent flow, wherein the data transmission request comprises a network address of a target terminal and a network address of a target ON node transferred for the agent flow of the target terminal; (2) the source ON node selects n transmission paths reaching the target ON node from a local transmission path table; (3) the source ON node transfers data pockets of the source service terminal to the target ON node according to the selected transmission paths, wherein the adjacent data pockets are dispersed to different transmission paths for transmission; and (4) the target ON node transfers the data pockets to a target service terminal. The invention can reduce the time delay and lower the time-delayed variation, has a certain fault-tolerance and can effectively prevent the pockets from continuously losing, thereby improving the audio-visible quality.
Description
Technical field
The present invention relates to a kind of data transmission method of on network, realizing, specifically, The present invention be more particularly directed to a kind of transmission method to time-delayed sensitive data.
Background technology
Along with people's also realizes that to the application of delay sensitive the characteristic of doing one's best of the Internet more and more can not satisfy demands of applications based on the applied more and more, particularly VoIP and video communication etc. of the Internet exploitation on the internet.
On the IP aspect, people have researched and developed multiple technologies, like RSVP, DiffServ, MPLS traffic engineering etc., guarantee different flows is provided different service quality.But these technological enforcements need be transformed internet infrastructure, are not what accomplish in one move.Obtained popularizing widely based on P2P overlay network The Application of Technology in recent years, these application have improved edge, the Internet bandwidth utilization, have obtained better transfer of data QoS.
According to demand, can be divided three classes based on the application of the Internet to QoS: based on the business of audio-video frequency content, based on mutual professional with based on the business of communicating by letter.Video request programs etc. promptly belong to the business based on audio-video frequency content; Based on mutual business such as web browsing, online game etc.; Business such as VoIP, video communication etc. based on communication.
In these business, VoIP and video conference are the highest to the requirement of time delay.Existing technology based on P2P is after having solved the shared distribution problem of big data quantity (like BitTorrent); (like various P2P Streaming Media multicasts and VOD system) also begins to make progress at aspects such as audio and video stream medias; Aspect VoIP, the Skype technological based on P2P obtained very big success.At present, the realization details of Skype is not open, and existing a small amount of result of study to it shows; It has adopted the P2P technology; Utilize more stable user node converting flow, and used a kind of very effective compression algorithm, the flow occupied bandwidth is significantly reduced; Its success that obtains simultaneously also part gives the credit to that it is fine to the effect that NAT passes through, and makes it obtain user widely.But, aspect video communication, also do not obtain the solution of very good effect at present.The main difficult point of video communication is embodied in its code check bigger (reaching hundreds of Kbps), and required bandwidth is difficult to be guaranteed on the internet, and needs to consider the stationary problem of audio frequency and video.The video code rate of some present video communication schemes (like QQ) is low, resolution is low, window is little, and effect is also unsatisfactory.
Summary of the invention
The objective of the invention is the application to delay sensitive to the big bandwidth of needs, propose a kind ofly can reduce time delay, the reduction delay variation is improved service quality and is had the data transmission method of certain fault-tolerance concurrently.
The transmission method that is directed against time-delayed sensitive data provided by the invention is based on overlapping network (ON:Overlay Network) Platform Implementation; Said overlapping network platform comprises some ON server nodes (describe for convenient, hereinafter abbreviate the ON server node as the ON node) composition; Communication flows between two ON nodes can be directly through the transmission of IP path, also can be through the transmission of overlapping network path, said overlapping network path be meant two communication flowss between the ON node by other ON node on behalf of the network path of transmitting.The flow that each said ON node is the service terminal of some provides the agency to transmit service.Through disposing the overlapping network platform; Can carry out distributed control to communication flows; The selection algorithm of implementing multipath by overlay network nodes can be simplified the realization of user side, when disposing overlay network nodes, can be optimized the performance of design to obtain to topology.
Transmission method to time-delayed sensitive data provided by the invention comprises the steps:
1) the source service terminal sends data transfer request to act on behalf of the source ON node that flow transmits for it, comprises the network address at purpose terminal in the said data transfer request, acts on behalf of the network address of the purpose ON node of flow forwarding for the purpose terminal;
2) ON node in source is selected the transmission path that the n bar arrives purpose ON node from the transmission path table of this locality, and said n is at least 2;
3) ON node in source is accordinged to the transmission path of being selected with the packet of source service terminal and is forwarded to purpose ON node, and wherein the adjacent data bag is distributed to different transmission paths and transmits;
4) purpose ON node is transmitted to the purpose service terminal with packet.
In the technique scheme, said step 2) in, the time delay and the packet loss information of each transmission path of record in the said transmission path table, said source ON node is selected the transmission path that said n bar arrives purpose ON node according to time delay and packet loss information.
In the technique scheme, said step 2) in, said transmission path comprises direct IP path and overlapping network path.
In the technique scheme, said step 2) in, after source ON node was confirmed transmission path, source ON node sent transmission permission message to said source service terminal; The source service terminal begins to transmit the packet that need be sent to the purpose service terminal then.
In the technique scheme, in the said step 3), said packet is worked out sequence number in order, and it is one group that source ON node is compiled adjacent k packet, and composes and give a group #, and its group # of different groups increases progressively; Said then source ON node sends every group of packet in regular turn, and the packet in same group is distributed to different said transmission paths and transmits; The k span is 2～10.
In the technique scheme, each grouping of said packet also comprises an xor data bag; Said source ON node carries out the step-by-step XOR with the load of k raw data packets of each group, and the data behind the resulting XOR form said xor data bag as new load; The raw data packets of said xor data bag and its place group is sent to purpose ON node simultaneously.
In the technique scheme, said packet has a flag bit, shows raw data packets or xor data bag.And source ON node is to giving a stream numbering from same service terminal, the packet that mails to same service terminal.The terminal point of transmitting is a purpose ON node.
In the technique scheme, in the said step 4), after purpose ON node is received packet, if raw data packets then is transmitted to the purpose service terminal.If after k-1 raw data packets of the xor data bag of receiving certain group and this group; Also have a raw data packets not receive; Then paid-in raw data packets and the xor data bag through this group carries out XOR; Recover this raw data packets, and be transmitted to the purpose terminal, and think that initial data packet loss.
In the technique scheme, in the said step 4), the packet loss of said each transmission path of purpose ON node statistics if packet loss is then serious to this path packet loss of source ON node report above set point, and sends to source ON node to the packet loss in current each path.
In the technique scheme, in the said step 4), said source ON node is abandoned the serious path of packet loss with Probability p, and from the transmission path table, selects a new route to substitute the path of being abandoned.
In the technique scheme, said step 2) in, each list item of path performance table all has the sign that lost efficacy, if this list item update time last time apart from current time greater than Δ, then this list item is marked as " inefficacy ".The typical span of Δ can be 1～5 minute.
In the technique scheme, said step 2) in, if there is the list item of certain proportion (such as 50%) to lose efficacy in the path performance table, then node will initiatively be initiated detection process one time, refreshes these list items.
In the technique scheme, said step 2) in, source node is following to the active probe step in path:
Source ON node is along directly IP path and all overlay paths are to purpose ON node transmission probe messages, and non-purpose ON node is transmitted to purpose ON node after receiving message immediately;
Destination node is put into the time difference of being separated by between message sequence that receives and the message in the response message, returns to source ON node along direct IP path;
In the active probe scheme, each probe messages is carried a unique numbering, and this surveys the message total order that sends, this number correspondence the number of path of being surveyed;
In the active probe scheme, each probe messages length is with consistent with the message length of initiation session;
In the active probe scheme; Destination node is after receiving first probe messages from source ON node; It is 150 milliseconds that timer is set, if timer expiry perhaps receives whole probe messages, just with the time difference of being separated by between message arrival order and the message; Be put in the response message, return to source ON node;
In the active probe scheme, source ON node will receive that the moment of response message deducts the moment of sending first probe messages, try to achieve the wherein time delay of a paths, simultaneously according to the time difference between the message, can obtain the time delay in other paths.
In the technique scheme, said step 2) in, when the path delay of time is identical, then select the low path of packet loss;
In the technique scheme, in the said step 4), not only one of the session of being transmitted on every paths, the packet loss that is counted is as far as all sessions;
In the technique scheme, in the said step 4), if packet loss surpasses thresholding, purpose ON node sends message to source ON node, and it is serious to announce this path packet loss, and all sends to source ON node to the packet loss information in current all paths.The threshold value of packet loss is according to employed audio/video coding form, different and different according to the demand of upper layer application, and possible span is 1%-5%.
In the technique scheme, in the said step 4), the Probability p value interval (0,1], its value is relevant with the packet loss size in this path.Desirable following linear relationship: if packet loss is 1%, then value is 0.5, if 2%, value 0.6, the rest may be inferred, if more than or equal to 5%, then value 0.9.
In the technique scheme, in the said step 4), if do not have alternative path of not losing efficacy in the routing table, then ON node in source starts a new detection process.After detection process finishes, upgrade routing table.And select a paths (not comprising the path that current session used) to replace the high path of packet loss to transmit in view of the above.
In the technique scheme, the value of said k can dynamically be adjusted with whether busy the forwarding task of ON platform is.When network is busy, but the k value is more greatly, otherwise, but value is littler.
The present invention has following technique effect:
Owing on different paths, transmit adjacent packet,, also can not cause too big influence to the quality of audio frequency and video even continuous packet loss takes place in certain path.And if on a paths, transmit, continuous packet loss is very big to the audio frequency and video quality influence.For example, if n paths transmission is arranged, continuous two packet losses on certain paths then, in original audio/video flow, n-1 the bag of being separated by between these two bags.If want original audio/video flow lose two continuous bags, mean then almost to go wrong simultaneously in two paths will transmitting these two bags and cause packet loss that this probability is very low.
Owing to adopted the XOR bag, when one of arbitrary group k data packet loss, can recover with corresponding XOR bag and other packets.
Chain-circuit time delay on the Internet is shaken, and for the oversize packet of those time delays, can think to have lost, thereby adopt other packets to recover, and has avoided occurring under the situation of shake at chain-circuit time delay, and the transmission delay of packet is long.
Adopted monitoring and feedback mechanism,, when packet loss becomes big, can replace with new path very soon when certain path quality worsens to link packet drop rate.
Thisly assign to the method for a plurality of paths transmission to packet, can more balancedly utilize the bandwidth of network, reduce the probability that bottleneck occurs.
Description of drawings
Below, specify embodiments of the invention in conjunction with accompanying drawing, wherein:
Fig. 1 is elastic overlapping platform and terminal topology sketch map;
Fig. 2 be the present invention at k=2, the data packet transmission situation sketch map during n=3;
Fig. 3 be the present invention at k=6, the data packet transmission situation sketch map during n=3;
Fig. 4 be the present invention at k=3, the data packet transmission situation during n=6 (this figure has omitted the explanation to the XOR bag).
Embodiment
Below in conjunction with description of drawings embodiment of the present invention.
As shown in Figure 1, the overlay network platform is deployed with 6 nodes, and the service terminal that each node is responsible for some provides service.Node and its terminal of being responsible for can be within the network of same residence network or same the Internet access provider.Audio frequency and video communication data between the node carries with the mode of RTP/UDP.
When service terminal A had audio, video data will send to service terminal B, the A at first ON node S1 under it sent request, and this request comprises the IP address of B, the IP address of the overlay network node S2 under the B etc.
After S1 received the request from A, the own path performance table of being safeguarded of inquiry if can not select the meet the requirements path of (for example time delay is less than 300ms) of 3 performances, then sent 5 probe messages along r0, r1, r2, r3, r4 path to S2 respectively.Wherein r0 is the direct IP path between S1 and the S2, and other paths are the path of transmitting through a node.Message numbering is from 0～4, and each message is 5 in " this is surveyed and sends message total " territory.Each message is arbitrarily filled, and making its length is the message length of audio frequency and video session, if audio frequency and video session message length is unfixing, then probe messages length is that the audio frequency and video session message length frequency of occurrences is maximum.
After S2 receives first probe messages from S1, start the 150ms timer, S2 writes down the time interval that probe messages arrives when receiving probe messages.If timer expiry or receive all probe messages, then S2 returns a response message along r0 to S1.Comprise the arrival order of probe messages and the blanking time that message arrives in the response message.Here we suppose that message arrival is 0,2,3,1,4 in proper order, other messages except that 0 and be spaced apart δ t the time of advent of its front message
2, δ t
3, δ t
1, δ t
4
S1 receives this response message, obtains and receives this message moment and the time delay of sending first probe messages, and deduct each time interval successively, tries to achieve the time delay of each paths.S1 refresh path performance table.And select 3 suitable paths.Suppose that selected path is r0, r2, r3.
S1 sends to terminal A and replys, and allows A to begin the audio frequency and video session, can send audio, video data.
Audio, video data bag after terminal A will encapsulate sends to S1, shown in accompanying drawing two.S1 in twos as one group, divides two-way to forward every group packet packet, and r0 and r2 are transferred to S2 through the path respectively.Packet through r0 is that label is 0,2,4 ... Packet, be that label is 1,3,5 through the packet of r 2 ... Packet.S1 also r3 sends from the path behind the load step-by-step XOR of the 0th packet and the 1st packet, is given to S2 via S5.The XOR of remainder data bag by that analogy.
S2 will receive the packet from three paths, for the packet from three paths that belongs to same group, after it receives wherein any two, just can obtain initial data, when it receives this group another one packet, directly abandon.For example: if S2 receives packet 0 and packet 1 earlier, then directly be transmitted to terminal B, and the XOR of the packet 0 received of back and 1 encapsulates and abandons.If receive and XOR bag and packet 0, can recover packet 1 earlier then with both XORs, also can be when receiving XOR bag and packet 1 recovery data packets 0, and then forwarding packet 0 and 1 is to terminal B.S2 just is provided with the 100ms timer when for the first time receiving packet that belongs to certain group, work as timer expiry, has then thought packet loss that this group is not also received.S2 will carry out the packet loss statistics of each paths simultaneously.
S2 is transmitted to terminal B with raw data packets (containing after xor operation recovers).
After if a period of time is carried out in session, S2 finds that the packet loss of path r0 continues to be higher than 1%, then initiates a message to S1, and feeds back to S1 to the packet loss statistics.
S1 selects a paths from current path performance table.If current path all lost efficacy, can not select available path, then initiate once new detection.S1 selects a suitable path from result of detection, substitute the high path of packet loss and transmit.
Previous embodiment is at k=2, an example under the n=3 situation, and in fact, k and n can be inequality.Two examples when accompanying drawing 3 and accompanying drawing 4 have been enumerated k ≠ n respectively.
If k=6, n=3, then raw data packets and xor data wrap in 3 paths (be designated as r0, r1, the transmission situation on r2) is shown in accompanying drawing 3.
If k=3, n=6, then raw data packets and xor data wrap in 6 paths (be designated as r0, r1, r2, r3, r4, the transmission situation on r5) is shown in accompanying drawing 4.
In practical implementation, can preferentially adopt the mode (the for example situation of accompanying drawing 2) of n=k+1 usually, if avoid the too for a short time too much bandwidth of XOR bag consumption that causes of k, then can adopt the mode (the for example situation of accompanying drawing 3) of k＞n-1.
In the preferred implementation like accompanying drawing 2, when number of paths allowed, n can get bigger as far as possible, for example n＞5.
Present embodiment does not comprise the part that the XOR bag is handled.
1) the source service terminal sends data transfer request to act on behalf of the source ON node that flow transmits for it, comprises the network address at purpose terminal in the said data transfer request, acts on behalf of the network address of the purpose ON node of flow forwarding for the purpose terminal;
2) ON node in source is selected the transmission path that n bar (n is at least 2) arrives purpose ON node from the transmission path table of this locality.
In this step, the time delay and the packet loss information of each transmission path of record in the said transmission path table, said source ON node is selected the transmission path that said n bar arrives purpose ON node according to time delay and packet loss information.Said transmission path comprises direct IP path and overlapping network path.After source ON node was confirmed transmission path, source ON node sent transmission permission message to said source service terminal; The source service terminal begins to transmit the packet that need be sent to the purpose service terminal then.
The maintenance of transmission path table and the system of selection of transmission path are following:
By the packet loss of each transmission path of purpose ON node statistics,, and send to source ON node to the packet loss in current each path if packet loss is then serious to this path packet loss of source ON node report above set point.
Said source ON node is abandoned the serious path of packet loss with Probability p, and from the transmission path table, selects a new route to substitute the path of being abandoned.
Each list item of path performance table all has the sign that lost efficacy, if this list item update time last time apart from current time greater than Δ, then this list item is marked as " inefficacy ".The typical span of Δ can be 1～5 minute.
If there is the list item of certain proportion (such as 50%) to lose efficacy in the path performance table, then node will initiatively be initiated detection process one time, refreshes these list items.
Source node is following to the active probe step in path:
Source ON node is along directly IP path and all overlay paths are to purpose ON node transmission probe messages, and non-purpose ON node is transmitted to purpose ON node after receiving message immediately;
Destination node is put into the time difference of being separated by between message sequence that receives and the message in the response message, returns to source ON node along direct IP path;
In the active probe scheme, each probe messages is carried a unique numbering, and this surveys the message total order that sends, this number correspondence the number of path of being surveyed;
In the active probe scheme, each probe messages length is with consistent with the message length of initiation session;
In the active probe scheme; Destination node is after receiving first probe messages from source ON node; It is 150 milliseconds that timer is set, if timer expiry perhaps receives whole probe messages, just with the time difference of being separated by between message arrival order and the message; Be put in the response message, return to source ON node;
In the active probe scheme, source ON node will receive that the moment of response message deducts the moment of sending first probe messages, try to achieve the wherein time delay of a paths, simultaneously according to the time difference between the message, can obtain the time delay in other paths.
When from the transmission path table, choosing the n transmission paths, at first select the less path of time delay, when the path delay of time is identical, then select the low path of packet loss.
3) ON node in source is accordinged to the transmission path of being selected with the packet of source service terminal and is forwarded to purpose ON node, and wherein the adjacent data bag is distributed to different transmission paths and transmits.
In this step, said packet is worked out sequence number in order, and it is one group that source ON node is compiled adjacent k packet, and composes and give a group #, and its group # of different groups increases progressively; Said then source ON node sends every group of packet in regular turn, and the packet in same group is distributed to different said transmission paths and transmits; The k span is 2～10.
4) purpose ON node is transmitted to the purpose service terminal with packet.
In this step, after purpose ON node is received packet, this packet is transmitted to the purpose service terminal.Meanwhile, purpose ON node also need be added up packet loss.
In actual conditions, not only one of the session of being transmitted on every paths, the packet loss that is counted is as far as all sessions of same path.
If packet loss surpasses thresholding, purpose ON node sends message to source ON node, and it is serious to announce this path packet loss, and all sends to source ON node to the packet loss information in current all paths.The threshold value of packet loss is according to employed audio/video coding form, different and different according to the demand of upper layer application, and possible span is 1%-5%.
The Probability p value interval (0,1], its value is relevant with the packet loss size in this path.Desirable following linear relationship: if packet loss is 1%, then value is 0.5, if 2%, value 0.6, the rest may be inferred, if more than or equal to 5%, then value 0.9.
If do not have alternative path of not losing efficacy in the routing table, then ON node in source starts a new detection process.After detection process finishes, upgrade routing table.And select a paths (not comprising the path that current session used) to replace the high path of packet loss to transmit in view of the above.
The value of said k can dynamically be adjusted with whether busy the forwarding task of ON platform is.When network is busy, but the k value is more greatly, otherwise, but value is littler.
In the present embodiment,,, can not cause too big influence to the quality of audio frequency and video even continuous packet loss takes place in certain path owing on different paths, transmit adjacent packet yet.And if on a paths, transmit, continuous packet loss is very big to the audio frequency and video quality influence.For example, if n paths transmission is arranged, continuous two packet losses on certain paths then, in original audio/video flow, n-1 the bag of being separated by between these two bags.If want original audio/video flow lose two continuous bags, mean then almost to go wrong simultaneously in two paths will transmitting these two bags and cause packet loss that this probability is very low.
This and, present embodiment has adopted the monitoring of link packet drop rate and feedback mechanism, when certain path quality worsens, when packet loss becomes big, can be very soon with new path replacement.Present embodiment is this assigns to the method that transmit in a plurality of paths to packet, can more balancedly utilize the bandwidth of network, reduces the probability that bottleneck occurs.
Claims (7)
1. transmission method to time-delayed sensitive data, this method comprises the steps: based on the overlapping network Platform Implementation
1) the source service terminal sends data transfer request to act on behalf of the source ON node that flow transmits for it, comprises the network address at purpose terminal in the said data transfer request, acts on behalf of the network address of the purpose ON node of flow forwarding for the purpose terminal;
2) ON node in source is selected the transmission path that the n bar arrives purpose ON node from the transmission path table of this locality, and said n is at least 2;
3) ON node in source is accordinged to the transmission path of being selected with the packet of source service terminal and is forwarded to purpose ON node, and wherein the adjacent data bag is distributed to different transmission paths and transmits;
4) purpose ON node is transmitted to the purpose service terminal with packet;
In the said step 3), said packet is worked out sequence number in order, and it is one group that source ON node is compiled adjacent k packet, and composes and give a group #, and its group # of different groups increases progressively; Each grouping of said packet also comprises an xor data bag; Said source ON node carries out the step-by-step XOR with the load of k raw data packets of each group, and the data behind the resulting XOR form said xor data bag as new load; The raw data packets of dividing into groups in said xor data bag and its place is sent to purpose ON node simultaneously; Said source ON node sends every group of packet in regular turn by group #, and the packet in same group is distributed to different said transmission paths and transmits; The k span is 2～10;
In the said step 4), after purpose ON node is received packet, if raw data packets then is transmitted to the purpose service terminal; If after k-1 raw data packets of the xor data bag of receiving certain group and this group; Also have a raw data packets not receive; Then paid-in raw data packets and the xor data bag through this group carries out XOR; Recover this raw data packets, and be transmitted to the purpose terminal, and the raw data packets that is not received is judged to loses.
2. the transmission method to time-delayed sensitive data according to claim 1; It is characterized in that; Said step 2) in; The time delay and the packet loss information of each transmission path of record in the said transmission path table, said source ON node is selected the transmission path that said n bar arrives purpose ON node according to time delay and packet loss information.
3. the transmission method to time-delayed sensitive data according to claim 1 is characterized in that said step 2) in, said transmission path comprises direct IP path and overlapping network path.
4. the transmission method to time-delayed sensitive data according to claim 1 is characterized in that said step 2) in, after source ON node was confirmed transmission path, source ON node sent transmission permission message to said source service terminal; The source service terminal begins to transmit the packet that need be sent to the purpose service terminal then.
5. the transmission method to time-delayed sensitive data according to claim 1 is characterized in that said packet has a flag bit, shows raw data packets or xor data bag.
6. the transmission method to time-delayed sensitive data according to claim 1; It is characterized in that; In the said step 4), the packet loss of said each transmission path of purpose ON node statistics is if packet loss surpasses set point; Then serious to this path packet loss of source ON node report, and send to source ON node to the packet loss in current each path.
7. the transmission method to time-delayed sensitive data according to claim 6 is characterized in that in the said step 4), said source ON node is abandoned the serious path of packet loss with Probability p, and from the transmission path table, selects a new route to substitute the path of being abandoned; The linear variation of the packet loss of said Probability p and this transmission path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810106441A CN101582878B (en) | 2008-05-13 | 2008-05-13 | Transmission method aiming at time-delayed sensitive data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810106441A CN101582878B (en) | 2008-05-13 | 2008-05-13 | Transmission method aiming at time-delayed sensitive data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101582878A CN101582878A (en) | 2009-11-18 |
| CN101582878B true CN101582878B (en) | 2012-09-05 |
Family
ID=41364841
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200810106441A Expired - Fee Related CN101582878B (en) | 2008-05-13 | 2008-05-13 | Transmission method aiming at time-delayed sensitive data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101582878B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20140092885A (en) | 2010-04-16 | 2014-07-24 | 인터디지탈 패튼 홀딩스, 인크 | Inter-unit transfer support using mobile internet protocol |
| CN102137454B (en) * | 2010-09-26 | 2013-09-25 | 华为技术有限公司 | Content storage method and device in service overlay network |
| CN102739517B (en) * | 2012-05-25 | 2015-10-07 | 中国人民解放军国防科学技术大学 | Based on route selection method and the system of laminated network |
| EP3378194B1 (en) | 2015-12-09 | 2022-02-02 | Huawei Technologies Co., Ltd. | Nodes and methods for performance measurement in segment routing network |
| CN109150722B (en) * | 2017-06-16 | 2021-03-30 | 华为技术有限公司 | Service forwarding method and network equipment |
| CN110290026A (en) * | 2019-07-08 | 2019-09-27 | 黑龙江电力调度实业有限公司 | A kind of electric power internet of things service synchroballistic method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1893707A (en) * | 2005-06-29 | 2007-01-10 | 株式会社Ntt都科摩 | Communication terminal device and communication method |
| CN101047633A (en) * | 2006-05-17 | 2007-10-03 | 华为技术有限公司 | Method, device and system for implementing multi-route transmission |
-
2008
- 2008-05-13 CN CN200810106441A patent/CN101582878B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1893707A (en) * | 2005-06-29 | 2007-01-10 | 株式会社Ntt都科摩 | Communication terminal device and communication method |
| CN101047633A (en) * | 2006-05-17 | 2007-10-03 | 华为技术有限公司 | Method, device and system for implementing multi-route transmission |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101582878A (en) | 2009-11-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mukerjee et al. | Practical, real-time centralized control for cdn-based live video delivery | |
| CN101582878B (en) | Transmission method aiming at time-delayed sensitive data | |
| CN103166959B (en) | A kind of multipath real-time Transmission control system and method | |
| JP2004529533A (en) | Method and system for packet communication utilizing path diversity | |
| CN102668472A (en) | Driven multicast traffic distribution on link-aggregate-group | |
| CN101796882A (en) | Be used for using simultaneously the intelligent connectivity framework (INTELICON) of a plurality of interfaces | |
| CN101764812A (en) | Method, router and network system for transmitting active source messages | |
| Wu et al. | Redesigning multi-channel P2P live video systems with View-Upload Decoupling | |
| Lucas et al. | MESH: Distributed error recovery for multimedia streams in wide-area multicast networks | |
| Saghir et al. | Load balancing qos multicast routing protocol in mobile ad hoc networks | |
| Shijie et al. | Cross-layer and one-hop neighbour-assisted video sharing solution in mobile ad hoc networks | |
| Ververidis et al. | Experimenting with services over an information-centric integrated satellite-terrestrial network | |
| Chaitanya et al. | Load distribution using multipath-routing in wired packet networks: A comparative study | |
| Zhang et al. | Considerations for application‐layer multipath transport control | |
| Jurca et al. | Distributed media rate allocation in multipath networks | |
| Jeon et al. | Overlay multicast tree recovery scheme using a proactive approach | |
| CN101291242A (en) | Method, system and apparatus for PIM DM to support bandwidth reservation and establishing multicast list | |
| Zhang et al. | Delay-constrained streaming in hybrid cellular and cooperative ad hoc networks | |
| Cao et al. | Background Traffic‐Based Retransmission Algorithm for Multimedia Streaming Transfer over Concurrent Multipaths | |
| KR100946663B1 (en) | Multicasting transmission method in mobile ad hoc network | |
| To et al. | Parallel overlays for high data-rate multicast data transfer | |
| CN101437222B (en) | Method for recovering broadcast multimedia broadcast/multicast business of mobile communication network | |
| Milic et al. | Video broadcasting using overlay multicast | |
| Tsai et al. | A concurrent multi-path transmission control scheme to reduce packet reordering latency at the receiver | |
| JP2010233175A (en) | System and server for distributing multicast, client terminal and multicast distribution method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120905 Termination date: 20160513 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |