Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  bandwidth sharing
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
Creating the required IT infrastructure to enable the ability for comfortable remote working is not an easy task. Improper configuration can create the possibility of taking over the whole bandwidth of the link by one device. Increasing bandwidth introduces extra costs and does not completely eliminate the problem – it will be more difficult to take over the whole bandwidth, but it is still possible. The solution to the problem may be the use of clouds and VPS, but it is associated with high costs and the need to entrust company data to providers of these services. Due to security and too high costs, this may not be an optimal solution. An alternative solution may be to use QoS along with PCQ. This mechanism allows to ensure equal division of the bandwidth between the devices under its control. With an appropriate configuration, QoS can eliminate the problem of taking over the whole bandwidth and ensure equal access to resources.
EN
It is believed that 5G networks will provide 1000 times more capacity than current solutions. One of the keys to achieve that goal is not only the utilization of additional radio bands, but also and foremost, the dynamic and efficient spectrum sharing. To successfully implement it such feature statistical observation and analysis of currently operational legacy systems are required. Comprehensive data on the signal parameters will allow then to determine and tune the approach to simultaneous bandwidth usage by existing and new systems. Therefore, to define and introduce the problem this paper presents a conceptual analysis of IEEE 802.16e based WiMAX network operating in the 3.6--3.8 GHz band on the eve of spectrum sharing introduction.
3
Content available remote On line routing of guaranteed bandwidth with restoration
EN
In this paper the problem of finding a pair of link (node) disjoint active Label Switched Path (LSP) and backup LSP in Multi Protocol Label Switching (MPLS) networks is considered. It was assumed that capacity on the links of the backup Label Switched Paths can be shared. We focus on online algorithms for routing of guaranteed bandwidth of active LSPs and backup LSPs under partial information model in order to optimize the total amount of bandwidth consumed in the MPLS network. We consider only the case of protection against single link (node) failure. In this paper the comparison of two known routing algorithms was carried out. The first of them is based on Integer Linear Programming [3, 4] The second one is based on active-path-first heuristics [8]. In order to avoid the trap-problem the concept of Conflicting Link Set is used. Moreover, new algorithm based on active-path-first heuristics was proposed too. In this paper special attention has been paid to bandwidth consumed in the network, number of rejected connection set-up requests and running time of considered algorithms. The obtained results have proved that the proposed algorithm is comparable to the other algorithms but it has shorter running time then the existing ones.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.