Abstract: A communication system performs a third-party authentication between a home service end and a foreign service end, wherein the home service end and the foreign service end each have a type of a cloud, an edge or a fog. The communication system includes a control module and a plurality of operation modules that are configured in a universal proxy, wherein the universal proxy performs communication with a cloud through a cloud relay, performs communication with an edge through an edge relay, and performs communication with a fog through a fog relay. The control module selects two of the operation modules to perform the third-party authentication according to the types of the home service end and the foreign service end.

Abstract: A communication system performs a third-party authentication between a home service end and a foreign service end, wherein the home service end and the foreign service end each have a type of a cloud, an edge or a fog. The communication system includes a control module and a plurality of operation modules that are configured in a universal proxy, wherein the universal proxy performs communication with a cloud through a cloud relay, performs communication with an edge through an edge relay, and performs communication with a fog through a fog relay. The control module selects two of the operation modules to perform the third-party authentication according to the types of the home service end and the foreign service end.

Abstract: In a post-quantum asymmetric key generation method and system, a processing unit generates, based on a prime and an arithmetic function or a classical string, a prime vector which has an infinite number of components; generates a prime array based on the prime vector; generates an associated matrix based on the prime array; obtains, based on the associated matrix and a first reference prime, a first reference inverse prime array that serves as a private key; and obtains a public key that is paired with the private key based on a second reference inverse prime array. The second reference inverse prime array is obtained based on the associated matrix, the first reference prime, a second reference prime, and a randomization array.

Abstract: An automatic protocol test method by reverse engineering from packet traces to extended finite state machine is disclosed. The method includes following steps: parsing the plurality of packets to extract a plurality of sessions; conducting a keyword analysis and a clustering algorithm to obtain protocol messages; initializing the protocol messages and merging equivalent states to obtain a finite state machine; extracting fields and values of the protocol messages to obtain a plurality of sub-datasets and adding a data guard and set of memories on the finite state machine to obtain the extended finite state machine.

Abstract: An automatic protocol test method by reverse engineering from packet traces to extended finite state machine is disclosed. The method includes following steps: parsing the plurality of packets to extract a plurality of sessions; conducting a keyword analysis and a clustering algorithm to obtain protocol messages; initializing the protocol messages and merging equivalent states to obtain a finite state machine; extracting fields and values of the protocol messages to obtain a plurality of sub-datasets and adding a data guard and set of memories on the finite state machine to obtain the extended finite state machine.

Abstract: In a post-quantum asymmetric key generation method and system, a processing unit generates, based on a prime and an arithmetic function or a classical string, a prime vector which has an infinite number of components; generates a prime array based on the prime vector; generates an associated matrix based on the prime array; obtains, based on the associated matrix and a first reference prime, a first reference inverse prime array that serves as a private key; and obtains a public key that is paired with the private key based on a second reference inverse prime array. The second reference inverse prime array is obtained based on the associated matrix, the first reference prime, a second reference prime, and a randomization array.

Abstract: A network communication system, a software-defined network controller and a routing method thereof are provided. The routing method is adapted to the software-defined network controller. The routing method includes the following steps: determining a first root switch corresponding to at least one first service cluster according to service chaining information, wherein each of the at least one first service cluster includes at least one service node for providing a first service; determining first routing path information for routing a packet flow from a first target switch to the first root switch; and configuring first group entry information for the first root switch according to cluster information of the at least one first service cluster, wherein the first group entry information is for performing a first routing path selection of the packet flow corresponding to the first service by the first root switch.

Abstract: A method for network sharing of multiple network operators includes steps of: providing a network sharing management proxy device adapted to be disposed between a sharing access point (AP) and a plurality of core networks of the network operators, wherein the sharing AP allows one or more end user equipment (UE) of the network operators to access; receiving a control message by the network sharing management proxy device, wherein the control message is corresponding to an UE, and the UE is an end UE of a first network operator of the network operators; checking the control message to determine that the UE is corresponding to which one of the network operators, and generating tunneling information accordingly; and transmitting the control message to a first core network of the first network operator according to the tunneling information.

Abstract: A network communication system, a software-defined network controller and a routing method thereof are provided. The routing method is adapted to the software-defined network controller. The routing method includes the following steps: determining a first root switch corresponding to at least one first service cluster according to service chaining information, wherein each of the at least one first service cluster includes at least one service node for providing a first service; determining first routing path information for routing a packet flow from a first target switch to the first root switch; and configuring first group entry information for the first root switch according to cluster information of the at least one first service cluster, wherein the first group entry information is for performing a first routing path selection of the packet flow corresponding to the first service by the first root switch.

Abstract: A method for network sharing of multiple network operators includes steps of: providing a network sharing management proxy device adapted to be disposed between a sharing access point (AP) and a plurality of core networks of the network operators, wherein the sharing AP allows one or more end user equipment (UE) of the network operators to access; receiving a control message by the network sharing management proxy device, wherein the control message is corresponding to an UE, and the UE is an end UE of a first network operator of the network operators; checking the control message to determine that the UE is corresponding to which one of the network operators, and generating tunneling information accordingly; and transmitting the control message to a first core network of the first network operator according to the tunneling information.

Abstract: A power-saving data scheduling system includes a period decision module for selecting a cycle having a shortest delay time as a discontinuous reception (DRX) cycle for each user from quality of service (QoS) requirements related to network services and channel conditions, and a start offset decision module for calculating the number of users in each of periods of the DRX cycle. In addition, a DRX-aware scheduling module is provided for extending the on period by increasing priority of the user and resetting an inactivity timer if a period required by the user's load is shorter than an off period. Optimal DRX parameters and DRX-aware scheduling are used to resolve the existing issues that the channel conditions, system load and QoS are not taken into consideration when the DRX parameters are determined. Moreover, a power-saving data scheduling method is also provided.

Abstract: A power-saving data scheduling system for LTE and a method thereof are provided. The power-saving data scheduling system includes a period decision module for selecting a cycle having a shortest delay time as a discontinuous reception (DRX) cycle for each of user from quality of service (QoS) requirements related to network services and channel conditions, and a start offset decision module for calculating the number of users in each of periods of the DRX cycle. In addition, a DRX-aware scheduling module is provided for extending the on period by increasing priority of the user and resetting an inactivity timer if a period required by the user's load is shorter than an off period. Optimal DRX parameters and DRX-aware scheduling are used to resolve the existing issues that the channel conditions, system load and QoS are not taken into consideration when the DRX parameters are determined.

Abstract: A decision method considering time and power consumption for offloading computations is provided. The method includes: obtaining a computing mission; obtaining a plurality of static effect factors from an effect factor table; collecting a plurality of dynamic effect factors. The method also includes: generating power consumptions and computing time that each of the computing unit and each of the server consumes according to the dynamic effect factors and the static effect factors; calculating cost values of executing the computing mission according to the power consumptions and the computing time; determining a target unit to execute the computing mission according to the cost values, in which the target unit is a computing unit or a server; executing the computing mission by the target unit. Therefore, the power consumptions and the computing time are simultaneously considered, and computations are adequately allocated to one of the computing unit and the servers.

Abstract: A real traffic replay over wireless networks with environment emulation and an event-driven automata-synchronized replay method are disclosed. The system includes a first traffic capture module configured to capture packet traces and environment effects in a real environment, a first event transform module configured to transform the packet traces into a sequence of events, and a reproduce module configured to receive the environment effects from the first traffic capture module and the sequence of events from the first event transform module such as to control a replay of the environment effects in the real environment and the sequence of events coordinately by means of automata.

Abstract: A frame-merging method is adapted for a network that includes mesh and terminal units, in which any two units capable of communication form a communication pair, and one of the units operates as a key unit to transmit pending frames according to the frame-merging method. The frame-merging method includes: determining whether the key unit is a mesh or a terminal unit; for the communication pair recorded in each pending frame, selecting a suitable scheme from a plurality of frame-merging schemes, and extracting at least one of the pending frames from among the pending frames for use as part or all of a priority frame set; and comparing a total size of all frames included in the priority frame set with a suitable frame size, so as to determine whether the key unit is to send an aggregated frame. A frame-merging apparatus is also disclosed.

Abstract: A real traffic replay over wireless networks with environment emulation and an event-driven automata-synchronized replay method are disclosed. The system includes a first traffic capture module configured to capture packet traces and environment effects in a real environment, a first event transform module configured to transform the packet traces into a sequence of events, and a reproduce module configured to receive the environment effects from the first traffic capture module and the sequence of events from the first event transform module such as to control a replay of the environment effects in the real environment and the sequence of events coordinately by means of automata.

Abstract: A decision method considering time and power consumption for offloading computations is provided. The method includes: obtaining a computing mission; obtaining a plurality of static effect factors from an effect factor table; collecting a plurality of dynamic effect factors. The method also includes: generating power consumptions and computing time that each of the computing unit and each of the server consumes according to the dynamic effect factors and the static effect factors; calculating cost values of executing the computing mission according to the power consumptions and the computing time; determining a target unit to execute the computing mission according to the cost values, in which the target unit is a computing unit or a server; executing the computing mission by the target unit. Therefore, the power consumptions and the computing time are simultaneously considered, and computations are adequately allocated to one of the computing unit and the servers.

Abstract: A recording, recovering, and replaying method for real traffic is used for processing a plurality of network packets of a plurality of network connections. A recording procedure of the method includes the following steps. A recording parameter (N, M, P) is received. A header and a payload of each network packet of the network connections are completely recorded, and a payload accumulation value of each network connection is accumulated. When one of the payload accumulation values exceeds N, the header of each network packet and first M bytes of the payload are recorded for P consecutive network packets corresponding to the payload accumulation value. When one of the payload accumulation values exceeds N and after the P consecutive network packets of the network connection corresponding to the payload accumulation value are recorded, the header of each network packet is recorded for the network connection corresponding to the payload accumulation value.

Abstract: A machine-implemented method for determining whether a to-be-analyzed software is a known malware or a variant of the known malware includes the steps of: (A) configuring a processor to execute the to-be-analyzed software, and obtain a to-be-analyzed system call sequence that corresponds to the to-be-analyzed software with reference to a plurality of system calls made in sequence as a result of executing the to-be-analyzed software; (B) configuring the processor to determine a degree of similarity between the to-be-analyzed system call sequence and a reference system call sequence that corresponds to the known malware; and (C) configuring the processor to determine that the to-be-analyzed software is neither the known malware nor a variant of the known malware when the degree of similarity determined in step (B) is not greater than a predefined similarity threshold value.

Abstract: A channel utilizing method for a wireless network is adapted for channel utilization by a switch node having a number (N) of transceivers in an environment with a number (M) of channels, wherein (N)<(M). The channel utilizing method includes the steps of: calculating a channel weight set, and selecting one of the (M) channels according to the channel weight set; determining a notify mechanism according to a relation between the switch node and a neighbor node; using the notify mechanism to notify the neighbor node of a current state of the switch node; and calculating a channel stay-in period, and causing the switch node to stay in the selected one of the channels for a duration of the channel stay-in period. A channel utilizing system is also disclosed.