Abstract: Deterministic IP (DIP) networking uses frequency synchronization to improve the network scalability. However, frequency synchronization introduces a more complex forwarding model, involving non-convex and non-differentiable operations, which increases the complexity of scheduling problems. Moreover, most scheduling schemes still rely on online heuristic algorithms and offline mechanisms, leading to either inefficient scheduling performance or high computational complexity. To address these issues, an online flow scheduling algorithm is proposed based on the combinatorial auction, where the resources are items, the flows are bidders, and the network is the auctioneer. Non-differential operations are carried out during the bundle enumeration phase before the flows arrive. When they arrive, TS flows only need to select a resource bundle from the feasible set. Additionally, we carefully design the resource’s pricing function which is a linear increasing function. The important time-critical applications could still access to the network even if they come latter. Finally, we conduct simulations that demonstrate the effectiveness of the proposed algorithm.

Key words: deterministic DIP (DIP) networking, online flow scheduling, auction theory