12 papers · ranked by Valyu relevance
Arsineh Boodaghian Asl, Jayanth Raghothama, Adam S. Darwich, Sebastiaan Meijer
'Sebastiaan Meijer'] Hospitals are complex systems, and the flow of patients is dynamic and nonlinear in such systems. Network representation allows flow algorithms to observe bottlenecks as candidates for optimisation. To model the dynamic behaviour of the patient flow, we need to consider the variability in arrival…
Jiaxin Jiang, Yunxiang Zhao, Lyu Xu, Byron Choi + 3 more
—Transaction flow networks are crucial in detecting illicit activities such as wash trading, credit card fraud, cashback arbitrage fraud, and money laundering. Our collaborator, Grab, a leader in digital payments in Southeast Asia, faces increasingly sophisticated fraud patterns in its transaction flow networks. In…
Zengkai Wang, Weizhi Liao, Xiaoyun Xia, Zijia Wang + 3 more
'Heming Jia' 'Xuewen Xia'] Routing and scheduling in Time-Sensitive Networking (TSN) is an NP-hard problem. In this paper, we propose a novel routing and scheduling approach for TSN based on evolutionary algorithm. Specifically, we introduce a flow grouping method that leverages the greatest common divisor to optimize…
James B. Orlin, X Gong
In 2013, Orlin proved that the max flow problem could be solved in O(nm) time. His algorithm ran in O(nm + m1.94) time, which was the fastest for graphs with fewer than n 1.06 arcs. If the graph was not sufficiently sparse, the fastest running time was an algorithm due to King, Rao, and Tarjan. We describe a new…
Juntong Luo, Scott Sallinen, Matei Ripeanu
—Recent advances in dynamic graph processing have enabled the analysis of highly dynamic graphs with change at rates as high as millions of edge changes per second. Solutions in this domain, however, have been demonstrated only for relatively simple algorithms like PageRank, breadth-first search, and connected…
Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak
Expander graphs are known to be robust to edge deletions in the following sense: for any online sequence of edge deletions e1, e2, . . . , ek to an m-edge graph G that is initially a ϕexpander, the algorithm can grow a set P ⊆ V such that at any time t, G[V \ P] is an expander of the same quality as the initial graph G…
Zongyi Zhao, Xingang Shi, Yin Xia, Zhiliang Wang
—Collecting flow records is a common practice of network operators and researchers for monitoring, diagnosing and understanding a network. Traditional tools like NetFlow face great challenges when both the speed and the complexity of the network traffic increase. To keep pace up, we propose HashFlow, a tool for more…
Simon Scherrer, Che-Yu Wu, Yu-Hsi Chiang, Benjamin Rothenberger + 6 more
'Daniele E. Asoni' 'Arish Sateesan' 'Jo Vliegen' 'Nele Mentens' 'Hsu‐Chun Hsiao' 'Adrian Perrig'] Abstract—Current probabilistic flow-size monitoring can only detect heavy hitters (e.g., flows utilizing 10 times their permitted bandwidth), but cannot detect smaller overuse (e.g., flows utilizing 50 – 100% more than…
Krishneel Deo, Kaylash Chaudhary, Mansour Assaf, Ahyoung Lee
Quality of Service (QoS) is a mechanism used in computer networks to prioritize, classify, and treat packets differently based on certain criteria. This helps the switching devices to schedule and reorder packets if there is congestion in the network. Edge routers experience high traffic congestion as a result of…
Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams + 1 more
'Alexandru I. Tomescu'] Decomposing a network flow into weighted paths is a problem with numerous applications, ranging from networking, transportation planning, to bioinformatics. In some applications we look for a decomposition that is optimal with respect to some property, such as the number of paths used…
Tianhao Wang, Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting + 3 more
'Yung H. Tsin' 'Sheung-Hung Poon' 'Chun-Hsi Huang'] The problem of finding k-edge-connected components is a fundamental problem in computer science. Given a graph G = (V, E), the problem is to partition the vertex set V into {V1, V2,…, V*h}, where each V**i is maximized, such that for any two vertices x and y in V**i…
Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham, Stefan Schmid + 1 more
'Sebastian Wiederrecht'] This paper studies the fundamental problem of how to reroute k unsplittable flows of a certain demand in a capacitated network from their current paths to their respective new paths, in a congestion-free manner and fast. This scheduling problem has applications in traffic engineering in…