نتایج جستجو برای: network flows

تعداد نتایج: 741721  

2013
MOHAMED OSAMA AHMED SHAWISH

Increasing the throughput is an important objective for wireless ad-hoc networks. Many methods have been innovated for this purpose and on top of them is the network coding. The existing network coding schemes, such as COPE and its updated versions, have succeed to provide a remarkable throughput gain in case of unicast flows, while they failed to provide the same performance in case of the mul...

2015
Ilker Nadi Bozkurt Yilun Zhou Theophilus Benson

To enhance the experience of a home network user, prioritization of network traffic is important. Previous solutions to this problem assigned priorities in a static manner. Even though there has been some efforts to assign priorities dynamically, these solutions only used interactivity of applications to prioritize traffic. We present Contextual Router, which achieves better prioritization by d...

2007
Frédéric Ridouard Jean-Luc Scharbarg Christian Fraboul

The VL (Virtual Link) concept used by AFDX network of modern aircraft such as A380 represents a big assumption for input flows characteristics. But mapping of many VL on a multi switch Ethernet architecture lead to potential congestion on a port of a (given) switch. Thus, there is strong need to prove that no frame will be lost by the network (no switch queue will overflow) and to evaluate the ...

Journal: :Transportation Research Part B: Methodological 2014

Journal: :Communications physics 2021

Network science enables the effective analysis of real interconnected systems, characterized by a complex interplay between topology and interconnections strength. It is well-known that network affects its resilience to failures or attacks, as well functions. Exchanging information crucial for many systems: internet, transportation networks brain are key examples. Despite introduction measures ...

Journal: :Journal of Fluid Mechanics 2021

We present a network-based modal analysis technique that identifies key dynamical paths along which perturbations amplify over time-varying base flow. This is built upon the Katz centrality, reveals flow structures can effectively spread time-evolving network of vortical interactions on Motivated by resolvent form function, we take singular value decomposition resulting communicability matrix, ...

2005
Maciej Kurant Patrick Thiran

Timetables of mass transportation systems contain an information not only about the traffic flows in the network, but also about the topology of the physical infrastructure of the network. However, this data is not given explicitly; it requires an nontrivial preprocessing to be revealed. We propose an algorithm that extracts the physical structure and the network of traffic flows from timetable...

Journal: :Journal of Combinatorial Theory, Series B 1975

Journal: :IEEE Transactions on Automatic Control 2018

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید