-
公开(公告)号：US10001930B2
公开(公告)日：2018-06-19
申请号：US14972047
申请日：2015-12-16
Applicant: Macau University of Science and Technology
Inventor： Li Feng , Liang Zhou , Zhijun Xu , Yujun Zhang
IPC: G06F3/06
CPC classification number: G06F3/0613 , G06F3/0659 , G06F3/068 , G06F13/00 , H04L47/50 , H04L69/12 , H04L69/321
Abstract: A method for implementing a packet I/O engine on a programmable computing platform is provided, where the engine performs I/O functions for plural threads generated by a plurality of user applications. In the method, the platform is configured such that only one thread is permitted to initialize and configure the resources. Furthermore, I/O-device queues each for buffering packets either transmitted to or received from an individual external I/O device are set up. For a plurality of unsafe I/O-device queues determined, among the I/O-device queues, to be multi-thread unsafe, a plurality of multi-producer, multi-consumer software queues for buffering packets delivered between the plurality of the unsafe I/O-device queues and the plurality of user applications is set up. In particular, the plurality of multi-producer, multi-consumer software queues is configured such that the unsafe I/O-device queues are collectively synchronized to maintain data consistency in packet delivery in the presence of multiple threads.
-
公开(公告)号：US20170111816A1
公开(公告)日：2017-04-20
申请号：US14945306
申请日：2015-11-18
Applicant: Macau University of Science and Technology
Inventor： Li Feng
CPC classification number: H04W28/021 , H04L1/1854 , H04L47/70 , H04W74/08 , H04W74/0816
Abstract: In widely deployed wireless “hot-spot” networks, nodes frequently join or leave, inelastic/elastic and saturated/non-satuarted flows coexist. In such dynamic and diverse environments, it is challenging to maximize the channel utilization while providing satisfactory user experiences. In this invention, one proposes a novel contention-on-demand (CoD) MAC scheme to address this problem. The CoD scheme consists of a fixed-CW algorithm, a dynamic-CW algorithm, and an admission control unit. The fixed-CW algorithm allows elastic flows to access limited system bandwidth; the dynamic-CW algorithm enables inelastic flows to contend for channel on demand and quickly adapt to network change; and the admission control unit rejects overloaded traffic for providing good user experiences. One then performs an asymptotic analysis to develop a simple but efficient admission control rule. Finally, extensive simulations verify that the scheme is very effective and the theoretical result is very accurate.
-
公开(公告)号：US09769849B2
公开(公告)日：2017-09-19
申请号：US14840139
申请日：2015-08-31
Applicant: Macau University of Science and Technology
Inventor： Li Feng
CPC classification number: H04W74/0816 , H04W84/12
Abstract: A method for enabling one or more nodes to communicate with an access point (AP) according to a CSMA/CA protocol is provided. In one embodiment of the method, when the individual node enters into a state of having at least one packet of data to be transmitted to the AP, the individual node waits for a non-zero deterministic delay so that any packet arrived during the delay is allowed to be aggregated and transmitted upon one transmission opportunity, thereby improving channel utilization. The delay is determined such that a predicted system throughput is maximized. It is found that the system throughput is significantly affected by the relationship between the delay and the number of the one or more nodes. Hence, the delay is advantageously determined according to the number of the one or more nodes. After the delay expires, the individual node initiates a contending procedure.
-
Patent Agency Ranking
公开(公告)号：US09961002B2
公开(公告)日：2018-05-01
申请号：US14972062
申请日：2015-12-16
Applicant: Macau University of Science and Technology
Inventor： Li Feng , Liang Zhou , Zhijun Xu , Yujun Zhang
IPC: H04L12/803 , H04L12/707 , H04L12/851 , H04L29/06
CPC classification number: H04L47/125 , H04L45/24 , H04L47/2483 , H04L69/22
Abstract: Compute-intensive packet processing (CIPP) in a computer system comprising a programmable computing platform is accelerated by using a packet I/O engine, implemented on the platform, to perform packet I/O functions, where the packet I/O engine is configured to achieve direct access to a network interface card (NIC) from a user application. For a Linux-based computer system, standard I/O mechanisms of Linux are bypassed and only the packet I/O engine is used in performing the I/O functions. Furthermore, the computer system is configured to: process a batch of packets, instead of packet by packet, in every function call; and when moving a packet between a buffer of an individual user application and a queue of the packet I/O engine, copy a packet descriptor of the packet instead the entire packet. In addition, workflows across different working threads are balanced and parallelism is exploited to fully utilize resources of the platform.
-
公开(公告)号：US20170048887A1
公开(公告)日：2017-02-16
申请号：US14840139
申请日：2015-08-31
Applicant: Macau University of Science and Technology
Inventor： Li Feng
CPC classification number: H04W74/0816 , H04W84/12
Abstract: A method for enabling one or more nodes to communicate with an access point (AP) according to a CSMA/CA protocol is provided. In one embodiment of the method, when the individual node enters into a state of having at least one packet of data to be transmitted to the AP, the individual node waits for a non-zero deterministic delay so that any packet arrived during the delay is allowed to be aggregated and transmitted upon one transmission opportunity, thereby improving channel utilization. The delay is determined such that a predicted system throughput is maximized. It is found that the system throughput is significantly affected by the relationship between the delay and the number of the one or more nodes. Hence, the delay is advantageously determined according to the number of the one or more nodes. After the delay expires, the individual node initiates a contending procedure.
Abstract translation: 提供一种使一个或多个节点能够根据CSMA / CA协议与接入点（AP）进行通信的方法。 在该方法的一个实施例中，当个体节点进入具有要发送到AP的至少一个数据分组的状态时，各个节点等待非零确定性延迟，使得在延迟期间到达的任何分组为 允许在一次传输机会时进行聚合和传输，从而提高信道利用率。 确定延迟使得预测的系统吞吐量最大化。 发现系统吞吐量受到延迟与一个或多个节点数之间的关系的显着影响。 因此，有利地根据一个或多个节点的数量来确定延迟。 延迟到期后，个别节点启动竞争程序。
-
公开(公告)号：US20170160954A1
公开(公告)日：2017-06-08
申请号：US14972047
申请日：2015-12-16
Applicant: Macau University of Science and Technology
Inventor： Li Feng , Liang Zhou , Zhijun Xu , Yujun Zhang
IPC: G06F3/06
CPC classification number: G06F3/0613 , G06F3/0659 , G06F3/068 , G06F13/00 , H04L47/50 , H04L69/12 , H04L69/321
Abstract: A method for implementing a packet I/O engine on a programmable computing platform is provided, where the engine performs I/O functions for plural threads generated by a plurality of user applications. In the method, the platform is configured such that only one thread is permitted to initialize and configure the resources. Furthermore, I/O-device queues each for buffering packets either transmitted to or received from an individual external I/O device are set up. For a plurality of unsafe I/O-device queues determined, among the I/O-device queues, to be multi-thread unsafe, a plurality of multi-producer, multi-consumer software queues for buffering packets delivered between the plurality of the unsafe I/O-device queues and the plurality of user applications is set up. In particular, the plurality of multi-producer, multi-consumer software queues is configured such that the unsafe I/O-device queues are collectively synchronized to maintain data consistency in packet delivery in the presence of multiple threads.
-
公开(公告)号：US09743309B2
公开(公告)日：2017-08-22
申请号：US14945306
申请日：2015-11-18
Applicant: Macau University of Science and Technology
Inventor： Li Feng
IPC: H04W28/02 , H04W74/08 , H04L12/54 , H04L1/18 , H04L12/911
CPC classification number: H04W28/021 , H04L1/1854 , H04L47/70 , H04W74/08 , H04W74/0816
Abstract: In widely deployed wireless “hot-spot” networks, nodes frequently join or leave, inelastic/elastic and saturated/non-satuarted flows coexist. In such dynamic and diverse environments, it is challenging to maximize the channel utilization while providing satisfactory user experiences. In this invention, one proposes a novel contention-on-demand (CoD) MAC scheme to address this problem. The CoD scheme consists of a fixed-CW algorithm, a dynamic-CW algorithm, and an admission control unit. The fixed-CW algorithm allows elastic flows to access limited system bandwidth; the dynamic-CW algorithm enables inelastic flows to contend for channel on demand and quickly adapt to network change; and the admission control unit rejects overloaded traffic for providing good user experiences. One then performs an asymptotic analysis to develop a simple but efficient admission control rule. Finally, extensive simulations verify that the scheme is very effective and the theoretical result is very accurate.
-
公开(公告)号：US20170163538A1
公开(公告)日：2017-06-08
申请号：US14972062
申请日：2015-12-16
Applicant: Macau University of Science and Technology
Inventor： Li Feng , Liang Zhou , Zhijun Xu , Yujun Zhang
IPC: H04L12/803 , H04L12/851 , H04L12/707 , H04L29/06
CPC classification number: H04L47/125 , H04L45/24 , H04L47/2483 , H04L69/22
Abstract: Compute-intensive packet processing (CIPP) in a computer system comprising a programmable computing platform is accelerated by using a packet I/O engine, implemented on the platform, to perform packet I/O functions, where the packet I/O engine is configured to achieve direct access to a network interface card (NIC) from a user application. For a Linux-based computer system, standard I/O mechanisms of Linux are bypassed and only the packet I/O engine is used in performing the I/O functions. Furthermore, the computer system is configured to: process a batch of packets, instead of packet by packet, in every function call; and when moving a packet between a buffer of an individual user application and a queue of the packet I/O engine, copy a packet descriptor of the packet instead the entire packet. In addition, workflows across different working threads are balanced and parallelism is exploited to fully utilize resources of the platform.
-
-
-
-
-
-
-
Search Results
8
records
(took 0.017 seconds)
