Since congestion is very likely to happen in the Internet, locating congested areas (path segments) along a congested path is vital to appropriate actions by Internet Service Providers to mitigate or prevent network performance degradation. We propose a practical method to locate congested segments by actively measuring one-way end-to-end packet losses on appropriate paths from multiple origins...

Abstract In this paper, we consider minimizers of integral functionals the type $$\begin{aligned} {\mathcal {F}}(u) := \int _\Omega \big [\tfrac{1}{p} (|Du|-1)^p_+ + f\cdot u\big ]\mathrm {d}x\nonumber \end{aligned}$$ F ( u ) <...

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 ...

Understanding loss patterns in a network is important for achieving the desired quality of service during transfers of multimedia traac. In this paper, we study the time dependence of loss patterns for video transfers over UDP in a congested packet network. Of particular interest are consecutive packet losses because they contribute to the prolonged loss episodes. We use simulation tools and sc...

This paper considers a congested bottleneck. A fast lane reserves a more than proportional share of capacity to a designated group of travellers. Travellers are otherwise identical and other travellers can use the reserved capacity when it would otherwise be idle. The paper shows that such a fast lane is always Pareto improving under Nash equilibrium in arrival times at the bottleneck and inela...

A system was developed to efficiently schedule aircraft into congested resources over long ranges and present that schedule as a decision support system. The scheduling system consists of a distributed network of independent schedulers, loosely coupled by sharing capacity information. This loose coupling insulates the schedules from uncertainty in long-distance estimations of arrival times, whi...

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...

In this paper, we investigate UPT avoidance problem with multiple congested links. We propose three different UPTA enforcement schemes — basic UPTA (B-UPTA), Partial UPTA (P-UPTA) and Centralised UPTA (C-UPTA). The challenge of UPT avoidance with multiple congested links is to determine global fairshare and enforce UPTA based on the global fairshare. We proposed the Bottleneck Fairshare Discove...