A scenario of a service provider network when heavily congested due to heavy traffic flow is brought into play to confirm the attribute of MPLS to significantly improve Latency especially in a highly congested network. The service provider network was congested by sending heavy packets through the ingress and egress port of the network. The network was simulated and ping tests were carried out ...

Falling across the problem of the unforeseen congested events in the logistic transportation, we build the online vehicle scheduling model with the recoverable congested vertices in this paper. Our optimization objective minimizes the total time of online scheduling. Considering the dynamic occurrence characteristics of the congested vertices one by one, we first introduce three online scheduli...

Resolving the problem of congestion roads is very challenging; however a way out of this problem will bring about many most wanted results like helping people not late to work; deliveries arrive on time and more. One approach to confront this task is letting the drivers be aware of congested roads online, so the drivers will be able to avoid going through the congested roads. This paper propose...

In this paper we provide low-congested Interval Routing Schemes (IRS) for some common interconnection networks such as butterries, wrapped butterries and cube connected cycles. In particular, by exploiting their hypercube-like structure, we show that 1-IRS and 2-IRS are already suucient to get schemes with a congestion which is at most c times the optimal one, for low constant values of c. More...

The main results of this paper are (I) a simulation algorithm which, under quite general constraints, transforms algorithms running on the Congested Clique into algorithms running in the MapReduce model, and (II) a distributed O(∆)-coloring algorithm running on the Congested Clique which has an expected running time of O(1) rounds, if ∆ ≥ Θ(log n); and O(log log log n) rounds otherwise. Applyin...

These notes are dedicated to the analysis of one-dimensional free-congested Navier–Stokes equations. After a brief synthesis results obtained in Dalibard and Perrin (Commun Math Sci 18(7):1775–1813, 2020) related existence asymptotic stability partially congested profiles associated soft congestion Navier-Stokes system, we present first local well-posedness result for

Recently, according to growth and concentration of population in urban area, congested situations at several railway stations in rush hour become a serious social issue. Therefore, designing the station more comfortably for the passengers has been desired. In other words, in order to mitigate the congested situations, a method measuring crowds flow characteristics should be developed. In this p...

We consider a congested aggregation model that describes the evolution of a density through the competing effects of nonlocal Newtonian attraction and a hard height constraint. This provides a counterpoint to existing literature on repulsive-attractive nonlocal interaction models, where the repulsive effects instead arise from an interaction kernel or the addition of diffusion. We formulate our...

Recently, some methods of automated generation of schematic map are proposed. However, no specific method is given for expansion of congested area on a map in the process of schematization. In fact, it is a key to produce a schematic map with great clarity. For instance, for a line network map, if there are many lines in a small area on a map, although the shape of these lines is simplified by ...