中文
相关论文

相关论文: Node-Constrained Traffic Engineering: Theory and A…

200 篇论文

The shortest path problem in graphs is a cornerstone of AI theory and applications. Existing algorithms generally ignore edge weight computation time. We present a generalized framework for weighted directed graphs, where edge weight can be…

数据结构与算法 · 计算机科学 2024-02-20 Eyal Weiss , Ariel Felner , Gal A. Kaminka

This study delves into the application of graph neural networks in the realm of traffic forecasting, a crucial facet of intelligent transportation systems. Accurate traffic predictions are vital for functions like trip planning, traffic…

机器学习 · 计算机科学 2023-10-30 Razib Hayat Khan , Jonayet Miah , S M Yasir Arafat , M M Mahbubul Syeed , Duc M Ca

Traffic problems have seriously affected people's life quality and urban development, and forecasting the short-term traffic congestion is of great importance to both individuals and governments. However, understanding and modeling the…

信号处理 · 电气工程与系统科学 2020-03-17 Meng Chen , Xiaohui Yu , Yang Liu

Since the advent of software-defined networking (SDN), Traffic Engineering (TE) has been highlighted as one of the key applications that can be achieved through software-controlled protocols (e.g. PCEP and MPLS). Being one of the most…

网络与互联网体系结构 · 计算机科学 2025-01-09 Anees Al-Najjar , Domingos Paraiso , Mariam Kiran , Cristina Dominicini , Everson Borges , Rafael Guimaraes , Magnos Martinello , Harvey Newman

Network flow problems, which involve distributing traffic such that the underlying infrastructure is used effectively, are ubiquitous in transportation and logistics. Among them, the general Multi-Commodity Network Flow (MCNF) problem…

机器学习 · 计算机科学 2024-03-19 Victor-Alexandru Darvariu , Stephen Hailes , Mirco Musolesi

Traffic flow forecasting is a crucial first step in intelligent and proactive traffic management. Traffic flow parameters are volatile and uncertain, making traffic flow forecasting a difficult task if the appropriate forecasting model is…

机器学习 · 计算机科学 2024-06-04 Jewel Rana Palit , Osama A Osman

Orienting the edges of an undirected graph such that the resulting digraph satisfies some given constraints is a classical problem in graph theory, with multiple algorithmic applications. In particular, an $st$-orientation orients each edge…

数据结构与算法 · 计算机科学 2023-07-11 Carla Binucci , Giuseppe Liotta , Fabrizio Montecchiani , Giacomo Ortali , Tommaso Piselli

Current trends in networking propose the use of Machine Learning (ML) for a wide variety of network optimization tasks. As such, many efforts have been made to produce ML-based solutions for Traffic Engineering (TE), which is a fundamental…

网络与互联网体系结构 · 计算机科学 2023-04-03 Guillermo Bernárdez , José Suárez-Varela , Albert López , Xiang Shi , Shihan Xiao , Xiangle Cheng , Pere Barlet-Ros , Albert Cabellos-Aparicio

This paper proposes the fine-grained traffic prediction task (e.g. interval between data points is 1 minute), which is essential to traffic-related downstream applications. Under this setting, traffic flow is highly influenced by traffic…

机器学习 · 计算机科学 2023-06-21 Zhanyu Liu , Chumeng Liang , Guanjie Zheng , Hua Wei

To optimize the flow of traffic in IP networks, operators do traffic engineering (TE), i.e., tune routing-protocol parameters in response to traffic demands. TE in IP networks typically involves configuring static link weights and splitting…

网络与互联网体系结构 · 计算机科学 2016-11-02 Marco Chiesa , Gábor Rétvári , Michael Schapira

Recent literature has proved that stable dynamic routing algorithms have solid theoretical foundation that makes them suitable to be implemented in a real protocol, and used in practice in many different operational network contexts. Such…

网络与互联网体系结构 · 计算机科学 2008-12-18 Luca Muscariello , Diego Perino

In modern transportation systems, an enormous amount of traffic data is generated every day. This has led to rapid progress in short-term traffic prediction (STTP), in which deep learning methods have recently been applied. In traffic…

机器学习 · 计算机科学 2020-09-03 Kyungeun Lee , Moonjung Eo , Euna Jung , Yoonjin Yoon , Wonjong Rhee

We explore the feasibility of combining Graph Neural Network-based policy architectures with Deep Reinforcement Learning as an approach to problems in systems. This fits particularly well with operations on networks, which naturally take…

机器学习 · 计算机科学 2021-12-02 Oliver Hope , Eiko Yoneki

The centralized architecture in software-defined network (SDN) provides a global view of the underlying network, paving the way for enormous research in the area of SDN traffic engineering (SDN TE). This research focuses on the load…

网络与互联网体系结构 · 计算机科学 2018-12-07 Sminesh C. N. , Grace Mary Kanaga E. , Ranjitha K

Traditional network interdiction refers to the problem of an interdictor trying to reduce the throughput of network users by removing network edges. In this paper, we propose a new paradigm for network interdiction that models scenarios,…

网络与互联网体系结构 · 计算机科学 2019-01-10 Xinzhe Fu , Eytan Modiano

Intelligent Transportation System (ITS) is crucial for improving traffic congestion, reducing accidents, optimizing urban planning, and more. However, the complexity of traffic networks has rendered traditional machine learning and…

机器学习 · 计算机科学 2024-09-20 Hourun Li , Yusheng Zhao , Zhengyang Mao , Yifang Qin , Zhiping Xiao , Jiaqi Feng , Yiyang Gu , Wei Ju , Xiao Luo , Ming Zhang

Recently, deep learning methods have made great progress in traffic prediction, but their performance depends on a large amount of historical data. In reality, we may face the data scarcity issue. In this case, deep learning models fail to…

机器学习 · 计算机科学 2022-07-05 Xueyan Yin , Feifan Li , Yanming Shen , Heng Qi , Baocai Yin

Traffic bottlenecks are a set of road segments that have an unacceptable level of traffic caused by a poor balance between road capacity and traffic volume. A huge volume of trajectory data which captures real-time traffic conditions in…

数据库 · 计算机科学 2021-07-28 Hui Luo , Zhifeng Bao , Gao Cong , J. Shane Culpepper , Nguyen Lu Dang Khoa

We study the NP-hard Minimum Shared Edges (MSE) problem on graphs: decide whether it is possible to route $p$ paths from a start vertex to a target vertex in a given graph while using at most $k$ edges more than once. We show that MSE can…

计算复杂性 · 计算机科学 2017-06-08 Till Fluschnik , Meike Hatzel , Steffen Härtlein , Hendrik Molter , Henning Seidler

We consider the approximability of the maximum edge-disjoint paths problem (MEDP) in undirected graphs, and in particular, the integrality gap of the natural multicommodity flow based relaxation for it. The integrality gap is known to be…

离散数学 · 计算机科学 2013-03-21 Chandra Chekuri , Guyslain Naves , F. Bruce Shepherd