5G delivers ultra-reliable low-latency communications and mobile edge computing (MEC) for industrial applications, enabling distributed computing resource collaboration and promoting traditional automation systems toward networked control paradigms. However, industrial networked automation systems face significant challenges in optimally allocating limited computing and communication resources to meet strict QoS requirements for massive control tasks while maintaining system stability and efficiency. Thus, we propose a computing-communication-control collaboration mechanism to enhance coordination between MEC and local controllers, enabling complex control tasks to be processed despite limited local computing resources. To jointly optimize hybrid control tasks migration with communication constraints and computing resources allocation with incomplete information, we design a dual double deep Q-network embedded with the Stackelberg game model. Simulation results demonstrate that the proposed mechanism achieves better performance compared with other benchmarks, and extremely decreases the convergence time compared with the classical Stackelberg game solution.

While various models have been proposed for generating social/friendship network graphs, the dynamics of user interactions through online social network (OSN) based applications remain largely unexplored. We previously developed a growth model to capture static weekly snapshots of user activity graphs (UAGs) using data from popular Facebook gifting applications. This paper presents a new continuous graph evolution model aimed to capture microscopic user-level behaviors that govern the growth of the UAG and collectively define the overall graph structure. We demonstrate the utility of our model by applying it to forecast the number of active users over time as the application transitions from initial growth to peak/mature and decline/fatique phase. Using empirical evaluations, we show that our model can accurately reproduce the evolution trend of active user population for gifting applications, or other OSN applications that employ similar growth mechanisms. We also demonstrate that the predictions from our model can guide the generation of synthetic graphs that accurately represent empirical UAG snapshots sampled at different evolution stages.

Packet classification plays an important role in next-generation Internet routers in providing various services such as packet filtering, policy routing, traffic policing, and load balancing. In this paper, we propose an original field-level trie classification (FLTC) scheme that accommodates classifier (rule database) with multiple fields specified in different forms (prefix and range). The FLTC achieves a high classification speed with reasonable storage. It is also highly scalable regarding the size and the number of fields of classifiers.

A unidirectional ring network is considered. A node may transmit at most one packet per slot to its downstream neighbor. Potentially all nodes may transmit at the same slot. The achievable performance is studied and policies are proposed for both the evacuation mode and continual operation. In the evacuation mode each node has initially an amount of packets destined for every other node of the ring, and no more packets are generated later. It is shown that the furthest destination first (FDF) policy, that gives priority to the packet with the longest way to go at each node, minimizes the time until every packet reaches its destination. Furthermore it is shown that the closest destination first (CDF) policy, that gives priority to the packet with the shortest way to go at each node, minimizes the average packet delivery time. A formula for the optimal evacuation time is obtained. The continual operation of the ring is considered then where packets are generated according to some arrival process. For any arrival sample path, the PDF maximizes the fraction of the time at which the ring is empty. The performance analysis of individual origin-destination traffic streams under FDF is facilitated based on the following. For each traffic stream, a single server priority queue is identified such that the average sojourn time of the traffic stream in the ring is equal to the aggregate transmission time plus the queueing delay of the low priority stream in the queue. Formulas for the sojourn time are obtained for iid arrivals. The performance of CDF and FIFO in continual operation is studied by simulation. It turns out that the CDF, minimum delay policy for the evacuation, has the worst performance in continual operation.>