Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
The problem of traversing a set of points in the order that minimizes the total distance traveled (traveling salesman problem) is one of the most famous and well-studied problems in combinatorial optimiza- tion. In this paper, we introduce the metric of minimizing the number of turns in the tour, given that the input points are in the Euclidean plane. We give approximation algorithms for several variants...
Data Center TCP (DCTCP) is an Explicit Congestion Notification (ECN)-based congestion control and Active Queue Management (AQM) scheme. It has provoked widespread interest because it keeps queuing delay and delay variance very low. There is no theoretical reason why Data Center TCP (DCTCP) cannot scale to the size of the Internet, resulting in greater absolute reductions in delay than achieved in...
Managing bandwidth sharing at bottlenecks is a challenge as old as packet switched networks. When equal senders compete for bandwidth of a bottleneck, it is desirable not only to enforce an instantaneous sharing of the scarce resource but also to prevent permanently active customers from suppressing less active customers. Moreover, it is desirable to incentivize shifting load to non-congested networks...
Today, Network Virtualization (NV) plays an important role in the networking research and gains increasing interest in the business environment. In addition to technical enhancements, NV also allows more differentiated business models diversifying the traditional Internet Service Provider (ISP) role. A crucial prerequisite for such a new business world is a description methodology that allows the...
This paper presents the final architecture for Cognitive Future Internet Element Management and in-network Dynamic Protocol Composition, as well as the results and insights gained by an prototype implementation and experiments performed. The high complexity of today's network infrastructures and the demand for reliable and robust but inexpensive networks stimulated research on evolving networks to...
In this paper we consider the Rectilinear Minimum Link Path Problem among rectilinear obstacles in three dimensions. The problem is well studied in two dimensions, but is relatively unexplored in higher dimensions. We solve the problem in O(βnlogn) time, where n is the number of corners among all obstacles, and β is the size of a binary space partition (BSP) decomposition of the space containing the...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.