CN109257360B - Hidden information sending and analyzing method based on transmission path in SDN network - Google Patents
Hidden information sending and analyzing method based on transmission path in SDN network Download PDFInfo
- Publication number
- CN109257360B CN109257360B CN201811168158.4A CN201811168158A CN109257360B CN 109257360 B CN109257360 B CN 109257360B CN 201811168158 A CN201811168158 A CN 201811168158A CN 109257360 B CN109257360 B CN 109257360B
- Authority
- CN
- China
- Prior art keywords
- turning
- time
- sending
- transmission path
- hidden information
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- 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/02—Topology update or discovery
-
- 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/12—Shortest path evaluation
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a hidden information sending and analyzing method based on a transmission path in an SDN network, wherein different transmission paths are set by an SDN controller, and hidden information bits to be sent are represented by the grouped different transmission paths; the receiver judges the transmission path according to the transmission time of the packet, and further analyzes the hidden information bit; the invention realizes the transmission of the hidden information between any two hosts under the SDN network environment, and improves the information hiding performance by carrying the hidden information through the grouped transmission path.
Description
Technical Field
The invention belongs to the technical field of information security, and particularly relates to a transmission path-based hidden information sending and analyzing method in an SDN network.
Background
The covert channel is defined as "capable of transferring confidential information from one process (user) to another process (user) using a normal channel without violating the security policy of a host", and the network covert channel is divided into a network storage covert channel and a network time covert channel according to different transmission modes. The network storage covert channel fills covert information into redundant bits or reserved bits of a data packet, and then the covert information is sent along with the network data packet to complete covert information transmission. The network time hidden channel transmits hidden information by modulating the time interval between normal data packets, and the method has strong concealment but is easily influenced by network jitter, time delay and the like. For this situation, in the environment of Software Defined Network (SDN), it is a good solution to transmit hidden information by adjusting the transmission path of network data packets.
Software Defined Networking (SDN) is a novel Network innovation architecture, and is an implementation manner of Network virtualization, and a core technology of the SDN is an OpenFlow technology, so that separation of Network data and Network device control is realized, and programming capability of a Network is introduced. The SDN has been developed at a high speed since its appearance, and is now widely used in the fields of data center networks, wireless local area networks, cloud computing, and the like.
The software defined networking fabric comprises a controller and a switch supporting the OpenFlow protocol. The hidden information transmission method based on the transmission path is used for transmitting the hidden information by adjusting the transmission path of a network data packet under the environment of a Software Defined Network (SDN). Specifically, in an SDN environment, a controller may analyze and specify a transmission path of a network packet, a sending end may select the transmission path through the controller to send hidden information, and a receiving end may extract the hidden information by statistically analyzing a transmission time of the packet.
Disclosure of Invention
In view of the above existing problems, the present invention provides a transmission path-based hidden information sending and parsing method in an SDN network, so as to improve the concealment of information transmission.
In order to achieve the purpose, the specific technical scheme of the invention is as follows: a hidden information sending and analyzing method based on a transmission path in an SDN network comprises the following steps:
1) constructing an SDN network topology set Stopo, namely a controller obtains the SDN network topology through a link layer discovery protocol, and constructing the topology set Stopo, wherein the topology set Stopo is marked as { E1, E2, … … En }, each element in the set Stopo consists of a triplet (Sx, Sy, isSwitch), wherein Sx represents a switch in the SDN network, Sy represents a switch or a host directly connected with Sx, and the isSwitch distinguishes whether Sy is a switch or a host;
2) constructing an SDN network topology set Stopow with a weight value;
3) constructing a switch set Lpath on the shortest path from a sending end to a receiving end;
4) acquiring the transmission time Ltime of information on an Lpath transmission path;
5) the sending end selects different paths according to the 1 or 0 to be sent and sends bits in sequence;
6) the receiving end analyzes whether the hidden information bit is 1 or 0 through the time of receiving the data packet until the receiving of the hidden information is finished.
Further, in the step 2), the method for constructing the aggregate Stopow is as follows:
2.1) for the triplets (Sx, Sy, isSwitch) corresponding to each element in the network topology set Stopo, the controller controls the Sx to send test data packets to the Sy, and a weight W from the Sx to the Sy is obtained, wherein the weight W represents the time that the data packets pass from the Sx to the Sy;
2.2) adding the weight W into the triad (Sx, Sy, isSwitch) to obtain a quadruple (Sx, Sy, isSwitch, W);
2.3) constructing an SDN network topology set Stopow with weight values by taking all four-tuples (Sx, Sy, isSwitch, W) as set elements.
Further, in the step 3), the method for constructing the switch set Lpath on the shortest path from the sending end to the receiving end is as follows:
3.1) determining a transmitting end and a receiving end, wherein the transmitting end is marked as h1, and the receiving end is marked as h 2;
3.2) initializing the shortest path set Lpath to be null;
3.3) judging whether h1 and h2 are in the same network segment, if so, turning to the step 4), and otherwise, turning to the step 3.4);
3.4) finding the switch which is directly connected with h1 and has the smallest weight as Si by using the SDN network topology set Stopow with the weight, and marking the switch which is directly connected with h2 and has the smallest weight as Sj;
3.5) judging whether Si and Sj are the same exchanger, if so, turning to the step 3.6), and otherwise, turning to the step 3.7);
3.6) adding Si into the set Lpath, and turning to the step 4);
3.7) judging whether Si and Sj are directly connected, if so, turning to the step 3.8), otherwise, turning to the step 3.9);
3.8) adding Si and Sj into the set Lpath, and turning to the step 4);
3.9) h1 ═ Si, h2 ═ Sj, go to step 3.4).
Further, in the step 5), the method for sending the hidden information includes:
5.1) sending the synchronous information;
5.2) determining a transmission path of a bit to be sent, if 1 is to be sent, controlling the transmission path of the packet to be an Lpath by the controller, namely, sending a flow table to a switch in the Lpath by the controller, and if 0 is to be sent, controlling the transmission path of the packet not to be the Lpath by the controller;
5.3) the timer starts to count time from 0;
5.4) sending the packet according to the transmission path;
5.5) judging whether the timing is less than a time threshold T, if so, turning to the step 5.4), and if not, turning to the step 5.6);
5.6) judging whether the sending of the hidden information is finished, if so, turning to the step 5.7), and if not, turning to the step 5.2);
5.7) the transmitting end sends an end mark.
Further, in step 6), the method for the receiving end to analyze the hidden information is as follows:
6.1) receiving and detecting the synchronous information sent by the sending end;
6.2) the timer starts to count time from 0;
6.3) the receiver receives the data packet sent by the sender;
6.4) judging whether the timing is less than a time threshold T, if so, turning to the step 6.3), and if not, turning to the step 6.5);
6.5) analyzing the data packets to obtain a time set Srecvtime ═ T of all the data packets in a time threshold T1，t2，t3，…，tk}；
6.6) normalization of Srecvtimen’＝(tn-tmin)/(tmax-tmin) Wherein n is 1, 2, 3 …, k; t is tmin＝min(t1，t2，t3，…，tk)；tmax＝max(t1，t2，t3，…，tk) Let Srecvtime ═ t1’，t2’，t3’，…，tk' }; wherein t isminIs the minimum value in the set of times Srecvtime，tmaxIs the maximum value in the time set Srecvtime, Srecvtime' is the time set after normalization processing, t1’，t2’，t3’，…，tkIs' t1，t2，t3，…，tkNormalizing the result;
6.7) averaging Srecvtime
6.8) the concealment bits are parsed, i.e. if time-Ltime <10ms, a data bit "1" is obtained; if | time-Ltime | > is 10ms, a data bit "0" is obtained;
6.9) judging whether an end mark is received, if so, turning to the step 6.10), and if not, turning to the step 6.2);
6.10) the reception of the hidden information is finished.
Compared with the prior art, the method and the device realize the transmission of the hidden information between any two hosts under the SDN network environment, and improve the information hiding performance by carrying the hidden information through the grouped transmission path.
Drawings
Fig. 1 is a flow chart of covert information transmission.
Detailed Description
The present invention is further described with reference to the accompanying drawings, and a transmission path-based hidden information sending and parsing method in an SDN network is shown in fig. 1, and includes the following steps:
1) constructing an SDN network topology set Stopo, namely a controller obtains the SDN network topology through a Link Layer Discovery Protocol (LLDP), constructing the topology set Stopo, wherein the topology set Stopo is recorded as { E1, E2 and … … En }, each element in the set Stopo consists of a triplet (Sx, Sy and isSwitch), wherein Sx represents a switch in the SDN network, Sy represents a switch or a host directly connected with Sx, and the isSwitch distinguishes whether Sy is a switch or a host;
2) constructing an SDN network topology set Stopow with weight values, wherein the method comprises the following steps:
2.1) for the triplets (Sx, Sy, isSwitch) corresponding to each element in the network topology set Stopo, the controller controls the Sx to send test data packets to the Sy, and a weight W from the Sx to the Sy is obtained, wherein the weight W represents the time that the data packets pass from the Sx to the Sy;
2.2) adding the weight W into the triad (Sx, Sy, isSwitch) to obtain a quadruple (Sx, Sy, isSwitch, W);
2.3) constructing an SDN network topology set Stopow with weight values by taking all four-tuples (Sx, Sy, isSwitch, W) as set elements;
3) a switch set Lpath on the shortest path from a sending end to a receiving end is constructed, and the method comprises the following steps:
3.1) determining a transmitting end and a receiving end, wherein the transmitting end is marked as h1, and the receiving end is marked as h 2;
3.2) initializing the shortest path set Lpath to be null;
3.3) judging whether h1 and h2 are in the same network segment, if so, turning to the step 4), otherwise, turning to the step 3.4)
3.4) finding the switch which is directly connected with h1 and has the smallest weight as Si by using the SDN network topology set Stopow with the weight, and marking the switch which is directly connected with h2 and has the smallest weight as Sj;
3.5) judging whether Si and Sj are the same exchanger, if so, turning to the step 3.6), otherwise, turning to the step 3.7)
3.6) adding Si into the set Lpath, and turning to the step 4);
3.7) judging whether Si is directly connected with Sj, if so, turning to the step 3.8), otherwise, turning to the step 3.9)
3.8) adding Si and Sj into the set Lpath, and turning to the step 4);
3.9) h1 ═ Si, h2 ═ Sj, go to step 3.4);
4) acquiring the transmission time Ltime of information on an Lpath, namely setting a transmission path from a sender to a receiver as the Lpath through a controller, sending a data packet to the receiver by the sender, and analyzing the shortest path time Ltime by receiving the data packet by the receiver;
5) the sending end sends the hidden information, and the specific method is as follows:
5.1) sending the synchronous information;
5.2) determining a transmission path of a bit to be sent, if 1 is to be sent, controlling the transmission path of the packet to be an Lpath by the controller, namely, sending a flow table to a switch in the Lpath by the controller, and if 0 is to be sent, controlling the transmission path of the packet not to be the Lpath by the controller;
5.3) the timer starts to count time from 0;
5.4) sending the packet according to the transmission path;
5.5) judging whether the timing is less than a time threshold T, if so, turning to the step 5.4), and if not, turning to the step 5.6);
5.6) judging whether the sending of the hidden information is finished, if so, turning to the step 5.7), and if not, turning to the step 5.2);
5.7) the sending end sends an end mark;
6) the receiving end analyzes the hidden information, and the specific method comprises the following steps:
6.1) receiving and detecting the synchronous information sent by the sending end;
6.2) the timer starts to count time from 0;
6.3) the receiver receives the data packet sent by the sender;
6.4) judging whether the timing is less than a time threshold T, if so, turning to the step 6.3), and if not, turning to the step 6.5);
6.5) analyzing the data packets to obtain a time set Srecvtime ═ T of all the data packets in a time threshold T1，t2，t3，…，tk}；
6.6) normalization of Srecvtimen’＝(tn-tmin)/(tmax-tmin) Wherein n is 1, 2, 3 …, k; t is tmin＝min(t1，t2，t3，…，tk)；tmax＝max(t1，t2，t3，…，tk) Let Srecvtime ═ t1’，t2’，t3’，…，tk' }; wherein t isminIs the minimum value in the set of times Srecvtime, tmaxIs the maximum value in the time set Srecvtime, Srecvtime' is the time set after normalization processing, t1’，t2’，t3’，…，tk' ist1，t2，t3，…，tkNormalizing the result;
6.7) averaging Srecvtime
6.8) the concealment bits are parsed, i.e. if time-Ltime <10ms, a data bit "1" is obtained; if | time-Ltime | > is 10ms, a data bit "0" is obtained;
6.9) judging whether an end mark is received, if so, turning to the step 6.10), and if not, turning to the step 6.2);
6.10) the reception of the hidden information is finished.
Claims (1)
1. A hidden information sending and analyzing method based on a transmission path in an SDN network is characterized by comprising the following steps:
1) constructing an SDN network topology set Stopo, namely a controller obtains the SDN network topology through a link layer discovery protocol, and constructing the topology set Stopo, wherein the topology set Stopo is marked as { E1, E2, … … En }, each element in the set Stopo consists of a triplet (Sx, Sy, isSwitch), wherein Sx represents a switch in the SDN network, Sy represents a switch or a host directly connected with Sx, and the isSwitch distinguishes whether Sy is a switch or a host;
2) constructing an SDN network topology set Stopow with a weight value;
2.1) for the triplets (Sx, Sy, isSwitch) corresponding to each element in the network topology set Stopo, the controller controls the Sx to send test data packets to the Sy, and a weight W from the Sx to the Sy is obtained, wherein the weight W represents the time that the data packets pass from the Sx to the Sy;
2.2) adding the weight W into the triad (Sx, Sy, isSwitch) to obtain a quadruple (Sx, Sy, isSwitch, W);
2.3) constructing an SDN network topology set Stopow with weight values by taking all four-tuples (Sx, Sy, isSwitch, W) as set elements;
3) constructing a switch set Lpath on the shortest path from a sending end to a receiving end;
3.1) determining a transmitting end and a receiving end, wherein the transmitting end is marked as h1, and the receiving end is marked as h 2;
3.2) initializing the shortest path set Lpath to be null;
3.3) judging whether h1 and h2 are in the same network segment, if so, turning to the step 4), otherwise, turning to the step 3.4)
3.4) finding the switch which is directly connected with h1 and has the smallest weight as Si by using the SDN network topology set Stopow with the weight, and marking the switch which is directly connected with h2 and has the smallest weight as Sj;
3.5) judging whether Si and Sj are the same exchanger, if so, turning to the step 3.6), otherwise, turning to the step 3.7)
3.6) adding Si into the set Lpath, and turning to the step 4);
3.7) judging whether Si is directly connected with Sj, if so, turning to the step 3.8), otherwise, turning to the step 3.9)
3.8) adding Si and Sj into the set Lpath, and turning to the step 4);
3.9) h1 ═ Si, h2 ═ Sj, go to step 3.4);
4) acquiring the transmission time Ltime of information on an Lpath transmission path;
5) the sending end selects different paths according to the 1 or 0 to be sent and sends bits in sequence;
the method for sending the hidden information comprises the following steps:
5.1) sending the synchronous information;
5.2) determining a transmission path of a bit to be sent, if 1 is to be sent, controlling the transmission path of the packet to be an Lpath by the controller, namely, sending a flow table to a switch in the Lpath by the controller, and if 0 is to be sent, controlling the transmission path of the packet not to be the Lpath by the controller;
5.3) the timer starts to count time from 0;
5.4) sending the packet according to the transmission path;
5.5) judging whether the timing is less than a time threshold T, if so, turning to the step 5.4), and if not, turning to the step 5.6);
5.6) judging whether the sending of the hidden information is finished, if so, turning to the step 5.7), and if not, turning to the step 5.2);
5.7) the sending end sends an end mark;
6) the receiving end analyzes whether the hidden information bit is 1 or 0 through the time of receiving the data packet until the receiving of the hidden information is finished;
6.1) receiving and detecting the synchronous information sent by the sending end;
6.2) the timer starts to count time from 0;
6.3) the receiver receives the data packet sent by the sender;
6.4) judging whether the timing is less than a time threshold T, if so, turning to the step 6.3), and if not, turning to the step 6.5);
6.5) analyzing the data packets to obtain a time set Srecvtime ═ T of all the data packets in a time threshold T1，t2，t3，…，tk}；
6.6) normalization of Srecvtimen’＝(tn-tmin)/(tmax-tmin) Wherein n is 1, 2, 3 …, k; t is tmin＝min(t1，t2，t3，…，tk)；tmax＝max(t1，t2，t3，…，tk) Let Srecvtime ═ t1’，t2’，t3’，…，tk' }, where t isminIs the minimum value in the set of times Srecvtime, tmaxIs the maximum value in the time set Srecvtime, Srecvtime' is the time set after normalization processing, t1’，t2’，t3’，…，tkIs' t1，t2，t3，…，tkNormalizing the result;
6.7) averaging Srecvtime
6.8) the concealment bits are parsed, i.e. if time-Ltime <10ms, a data bit "1" is obtained; if | time-Ltime | > is 10ms, a data bit "0" is obtained;
6.9) judging whether an end mark is received, if so, turning to the step 6.10), and if not, turning to the step 6.2);
6.10) the reception of the hidden information is finished.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811168158.4A CN109257360B (en) | 2018-10-08 | 2018-10-08 | Hidden information sending and analyzing method based on transmission path in SDN network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811168158.4A CN109257360B (en) | 2018-10-08 | 2018-10-08 | Hidden information sending and analyzing method based on transmission path in SDN network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109257360A CN109257360A (en) | 2019-01-22 |
| CN109257360B true CN109257360B (en) | 2020-08-28 |
Family
ID=65045388
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811168158.4A Active CN109257360B (en) | 2018-10-08 | 2018-10-08 | Hidden information sending and analyzing method based on transmission path in SDN network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109257360B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101848461A (en) * | 2010-05-04 | 2010-09-29 | 中国人民解放军信息工程大学 | Method for secure routing and channel allocation in cognitive Mesh network |
| CN103581168A (en) * | 2013-08-02 | 2014-02-12 | 中国科学技术大学苏州研究院 | Hidden information communication method based on IP fragmentation camouflage technology |
| CN104660591A (en) * | 2015-02-03 | 2015-05-27 | 中国科学技术大学苏州研究院 | Covert communication method used for packet length feedback network and based on IP (internet protocol) address |
| CN105871772A (en) * | 2015-01-18 | 2016-08-17 | 吴正明 | Working method of SDN network architecture aimed at network attack |
| CN105871771A (en) * | 2015-01-18 | 2016-08-17 | 吴正明 | SDN network architecture aimed at DDoS network attack |
| CN107078898A (en) * | 2014-05-20 | 2017-08-18 | 神秘双八达通有限公司 | A kind of method that the private interconnection of safety is set up on multi-path network |
| WO2017167371A1 (en) * | 2016-03-31 | 2017-10-05 | Nec Europe Ltd. | Rapid topology-independent path protection in sdn networks |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9742648B2 (en) * | 2015-03-23 | 2017-08-22 | Brocade Communications Systems, Inc. | Efficient topology failure detection in SDN networks |
-
2018
- 2018-10-08 CN CN201811168158.4A patent/CN109257360B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101848461A (en) * | 2010-05-04 | 2010-09-29 | 中国人民解放军信息工程大学 | Method for secure routing and channel allocation in cognitive Mesh network |
| CN103581168A (en) * | 2013-08-02 | 2014-02-12 | 中国科学技术大学苏州研究院 | Hidden information communication method based on IP fragmentation camouflage technology |
| CN107078898A (en) * | 2014-05-20 | 2017-08-18 | 神秘双八达通有限公司 | A kind of method that the private interconnection of safety is set up on multi-path network |
| CN105871772A (en) * | 2015-01-18 | 2016-08-17 | 吴正明 | Working method of SDN network architecture aimed at network attack |
| CN105871771A (en) * | 2015-01-18 | 2016-08-17 | 吴正明 | SDN network architecture aimed at DDoS network attack |
| CN104660591A (en) * | 2015-02-03 | 2015-05-27 | 中国科学技术大学苏州研究院 | Covert communication method used for packet length feedback network and based on IP (internet protocol) address |
| WO2017167371A1 (en) * | 2016-03-31 | 2017-10-05 | Nec Europe Ltd. | Rapid topology-independent path protection in sdn networks |
Non-Patent Citations (3)
| Title |
|---|
| Dynamic searchable encryption with privacy protection for cloud computing;Xiaowei Li,Selasi Kwame Ocansey;《nternational Journal of Communication System》;20170930;全文 * |
| 基于SDN的多路径并行传输数据调度方法;于萌，卓越;《信息通信》;20161231;全文 * |
| 基于多维度抽象和广度优先搜索空间划分的隐秘信息流检测方法;王昌达，朱锦;《计算机应用研究》;20160531;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109257360A (en) | 2019-01-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Polese et al. | A survey on recent advances in transport layer protocols | |
| Zhang et al. | Novel quick start (QS) method for optimization of TCP | |
| WO2019137524A1 (en) | Method and system for determining quality of service flow of network, and network element | |
| US20200358886A1 (en) | Data Transmission Method, Apparatus, And System | |
| US8094550B2 (en) | Methods and systems for controlling network communication parameters | |
| EP2008493A1 (en) | Methods and apparatus for supporting quality of service in communication systems | |
| US8917599B2 (en) | Systems and methods for controlling data transmission rates | |
| KR20020071010A (en) | Adaptive link layer for point to multipoint communication system | |
| US20080071919A1 (en) | Determination of link qualities between an access point and a plurality of clients | |
| CN108881031B (en) | Self-adaptive reliable data transmission method based on SDN network | |
| TWI531186B (en) | Multiple-interface network device and selection method for transmitting network packets | |
| TWI580226B (en) | Method for determining maximum segment size | |
| WO2019061516A1 (en) | Concealed wireless communication physical-layer slope authentication method and apparatus | |
| WO2019144802A1 (en) | Data transmission method and related device | |
| US11218912B2 (en) | Method and apparatus for controlling traffic of network device in wireless communication network | |
| CN109257360B (en) | Hidden information sending and analyzing method based on transmission path in SDN network | |
| He et al. | Resilient QUIC protocol for emerging wireless networks | |
| JPWO2004091148A1 (en) | Mobile terminal and wireless access point in wireless access system | |
| WO2023122592A1 (en) | Deterministic radio networks configured for time-sensitive networking (tsn) communication | |
| US20160241684A1 (en) | Method and apparatus for link discovery among domains | |
| Dias et al. | Traditional TCP congestion control algorithms evaluation in wired-cum-wireless networks | |
| Nguyen et al. | An implementation of scalable, Vegas, Veno, and YeAH congestion control algorithms in ns-3 | |
| WO2019173984A1 (en) | Data transmission method and device | |
| Ito et al. | GridFTP-APT: Automatic parallelism tuning mechanism for GridFTP in long-fat networks | |
| WO2023213202A1 (en) | Communication method and apparatus |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230418 Address after: No.246 Xingta Fourth Village, Xingta Town, Jinshan District, Shanghai, 201500 Patentee after: Shanghai Jiexuan Electronic Technology Co.,Ltd. Address before: 212013 No. 301, Xuefu Road, Zhenjiang, Jiangsu Patentee before: JIANGSU University |