Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "traffic engineering" wg kryterium: Temat


Wyświetlanie 1-5 z 5
Tytuł:
Traffic Engineering in Software Defined Networks: A Survey
Autorzy:
Abbasi, M. R.
Guleria, A.
Devi, M. S.
Powiązania:
https://bibliotekanauki.pl/articles/309347.pdf
Data publikacji:
2016
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
application awareness
software defined networking
traffic engineering
Opis:
An important technique to optimize a network and improve network robustness is traffic engineering. As traffic demand increases, traffic engineering can reduce service degradation and failure in the network. To allow a network to adapt to changes in the traffic pattern, the research community proposed several traffic engineering techniques for the traditional networking architecture. However, the traditional network architecture is difficult to manage. Software Defined Networking (SDN) is a new networking model, which decouples the control plane and data plane of the networking devices. It promises to simplify network management, introduces network programmability, and provides a global view of network state. To exploit the potential of SDN, new traffic engineering methods are required. This paper surveys the state of the art in traffic engineering techniques with an emphasis on traffic engineering for SDN. It focuses on some of the traffic engineering methods for the traditional network architecture and the lessons that can be learned from them for better traffic engineering methods for SDN-based networks. This paper also explores the research challenges and future directions for SDN traffic engineering solutions.
Źródło:
Journal of Telecommunications and Information Technology; 2016, 4; 3-14
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Properties of the Multiservice Erlangs Ideal Gradings
Autorzy:
Hanczewski, S.
Kmiecik, D.
Powiązania:
https://bibliotekanauki.pl/articles/308103.pdf
Data publikacji:
2016
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
Erlang's Ideal Grading
multi-service system
traffic engineering
Opis:
The design and optimization process of modern telecommunications networks is supported by a range of appropriate analytical models. A number of these models are based on the Erlang’s Ideal Grading (EIG) model, which is a particular case of non-full-availability groups. A possibility of the application of the EIG model results from the fact that telecommunications systems show properties and features distinctive to non-full-availability systems. No detailed studies that would decisively help determine appropriate conditions for the application of the EIG model for modeling of other non-full-availability groups, that would be models corresponding to real telecommunications systems, have been performed. Therefore, this article attempts to find an answer to the following question: what are the prerequisite conditions for the application of the EIG model and when the model can be reliably used?
Źródło:
Journal of Telecommunications and Information Technology; 2016, 1; 37-43
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Practical Approach to Trac Engineering using an Unsplittable Multicommodity Flow Problem with QoS Constraints
Autorzy:
Białoń, P.
Powiązania:
https://bibliotekanauki.pl/articles/308037.pdf
Data publikacji:
2016
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
multicriteria analysis
QoS-aware unsplittable multicommodity flow
traffic engineering
Opis:
The paper presents a practical approach to calculating intra-domain paths within a domain of a content-aware network (CAN) that uses source routing. This approach was used in the prototype CAN constructed as a part of the Future Internet Engineering project outcome. The calculated paths must satisfy demands for capacity (capacity for a single connection and for aggregate connections using the given path are considered distinctly) and for a number of path-additive measures like delay, loss ratio. We state a suitable variant of QoS-aware unsplittable multicommodity ow problem and present the solving algorithm. The algorithm answers to the needs of its immediate application in the constructed system: a quick return within a short and fairly predictable time, simplicity and modiability, good behavior in the absence of a feasible solution (returning approximately-feasible solutions, showing how to modify demands to retain feasibility). On the other hand, a certain level of overdimensioning of the network is explored, unlike in a typical optimization algorithm. The algorithm is a mixture of: (i) shortest path techniques, (ii) simplified reference-level multicriteria techniques and parametric analysis applied to aggregate the QoS criteria (iii) penalty and mutation techniques to handle the common constraints. Numerical experiments assessing various aspects of the algorithm behavior are given.
Źródło:
Journal of Telecommunications and Information Technology; 2016, 3; 25-37
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
DiffServ Aware MPLS Traffic Engineering for ISP Networks: State of the Art and New Trends
Autorzy:
Toguyéni, A.
Korbaa, O.
Powiązania:
https://bibliotekanauki.pl/articles/308811.pdf
Data publikacji:
2009
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
differentiated service
multipath routing
QoS routing
quality of service
traffic engineering
Opis:
In the recent ten years, with the development of new applications through Internet such as multimedia or networked control applications, users need more and more quality of service (QoS). However, the requested QoS is not the same depending on the application. Most of the new models to manage internet traffic are based on specific QoS criteria which should be optimized. This paper presents main multiprotocol label switching (MPLS) approaches such as MPLS adaptive traffic engineering (MATE), load distribution in MPLS (LDM) and load balancing over widest disjoints paths (LBWDP) that are new models for traffic engineering. It also introduces periodic multi-step (PEMS) algorithm that adapts the offered quality depending on the class of the routed traffic.
Źródło:
Journal of Telecommunications and Information Technology; 2009, 1; 5-13
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
New Developments in a Two-criteria Approach to Dynamic Power Management in Energy-aware Computer Networks
Autorzy:
Karbowski, A.
Jaskóła, P.
Powiązania:
https://bibliotekanauki.pl/articles/309427.pdf
Data publikacji:
2016
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
data-intensive computing
energy-aware network
energy-aware routing
dynamic power management
MIQP problems
traffic engineering
Opis:
In the paper authors continue the development of a model of dynamic power management in energy-aware computer networks, where two criteria: energy consumption and the quality of service are considered. This approach is appropriate when the routing problem with fixed demands is inadmissible. The formulation introducing edge indices is modified and tests on problems of different sizes are performed.
Źródło:
Journal of Telecommunications and Information Technology; 2016, 2; 21-25
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-5 z 5

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies