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ę "Design Optimization" wg kryterium: Temat


Wyświetlanie 1-6 z 6
Tytuł:
Two Approaches to Network Design Problem for Overlay Multicast with Limited Tree Delay : Model and Optimal Results
Autorzy:
Szostak, M.
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/226284.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
overlay network
multicasting
optimization
network design
Opis:
Live multimedia streaming and on-demand streaming applications (such as Internet radio or Internet TV) have been gaining more popularity in recent years. They require significant amount of bandwidth from media streaming servers and can easily saturate network infrastructure when the number of participant or bit rate of streaming content increases. Overlay multicast is an effective approach to the problem of streaming distribution. It combines flexibility of application layer multicast with efficiency of network layer multicast. Since overlay networks are built on the top of existing infrastructure, the cost of maintenance and deployment of this solution is relatively low compared to traditional Content Distribution Networks (CDN). Based on our previous works, we focus on solving the overlay network design problem to economically distribute content among the participants using overlay multicast. The optimization goal is to minimize the overlay network cost expressed by the cost of access links. Additionally, we assume that the maximum total delay of a streaming tree is upper bounded to provide QoS (Quality of Service) guarantees. We present two approaches to this problem and construct model using Levels and Flow Conservation Constraints. We show how various constraints following from real overlay systems influence the behavior of the distributing system. In numerical experiments we use real ISPs' price lists. To illustrate our approach we present optimal results obtained from the CPLEX solver.
Źródło:
International Journal of Electronics and Telecommunications; 2011, 57, 3; 335-340
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimizing cost of network upgrade for overlay multicast – heuristic approach
Autorzy:
Szostak, M.
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/309120.pdf
Data publikacji:
2013
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
multicasting
network design
optimization
overlay network
streaming
Opis:
A rapid increase of the Internet users and traffic at the rate of 31% in years 2011–2016 contributes to emerging of new approaches to the content distribution. Among other approaches, the overlay multicasting seems to be one of the most interesting concepts according to relatively low deployment costs and large scalability. In this paper, the authors formulate a new incremental multicast overlay design problem. In particular, authors assumed that the overlay network is to be upgraded due to an increase of the number of participating users and the need to improve the streaming quality. However, the existing multicast tree structure is assumed to remain fixed. The goal was to minimize the cost of the upgrade, represented in euro/month. To achieve it, for each peer participating in the transmission, a link type offered by one of the ISPs was selected and overlay trees were constructed, rooted at the source of the content. The authors also present a new heuristic algorithm to efficiently solve this problem. According to experiments, the biggest factor influencing the upgrade cost and determining possible streaming quality values that the system can be upgraded to is the initial tree structure.
Źródło:
Journal of Telecommunications and Information Technology; 2013, 3; 66-73
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Telecommunications network design and max-min optimization problem
Autorzy:
Ogryczak, W.
Pióro, M.
Tomaszewski, A.
Powiązania:
https://bibliotekanauki.pl/articles/309010.pdf
Data publikacji:
2005
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
network design
resource allocation
fairness
lexicographic optimization
lexicographic max-min
Opis:
Telecommunications networks are facing increasing demand for Internet services. Therefore, the problem of telecommunications network design with the objective to maximize service data flows and provide fair treatment of all services is very up-to-date. In this application, the so-called max-min fair (MMF) solution concept is widely used to formulate the resource allocation scheme. It assumes that the worst service performance is maximized and the solution is additionally regularized with the lexicographic maximization of the second worst performance, the third one, etc. In this paper we discuss solution algorithms for MMF problems related to telecommunications network design. Due to lexicographic maximization of ordered quantities, the MMF solution concept cannot be tackled by the standard optimization model (mathematical programme). However, one can formulate a sequential lexicographic optimization procedure. The basic procedure is applicable only for convex models, thus it allows to deal with basic design problems but fails if practical discrete restrictions commonly arriving in telecommunications network design are to be taken into account. Then, however, alternative sequential approaches allowing to solve non-convex MMF problems can be used.
Źródło:
Journal of Telecommunications and Information Technology; 2005, 3; 43-56
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fair and efficient network dimensioning with the reference point methodology
Autorzy:
Goryczak, W.
Wierzbicki, A.
Milewski, M.
Powiązania:
https://bibliotekanauki.pl/articles/308918.pdf
Data publikacji:
2006
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
multiple criteria optimization
efficiency
fairness
equity
reference point method
teleconsultations
network design
elastic traffic
Opis:
The dimensioning of telecommunication networks that carry elastic traffic requires the fulfillment of two conflicting goals: maximizing the total network throughput and providing fairness to all flows. Fairness in telecommunication network design is usually provided using the so-called max-min fairness (MMF) approach. However, this approach maximizes the performance of the worst (most expensive) flows which may cause a large worsening of the overall throughput of the network. In this paper we show how the concepts of multiple criteria equitable optimization can be effectively used to generate various fair and efficient allocation schemes. We introduce a multiple criteria model equivalent to equitable optimization and we develop a corresponding reference point procedure for fair and efficient network dimensioning for elastic flows. The procedure is tested on a sample network dimensioning problem for elastic traffic and its abilities to model various preferences are demonstrated.
Źródło:
Journal of Telecommunications and Information Technology; 2006, 4; 21-30
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On multi-criteria approaches to bandwidth allocation
Autorzy:
Ogryczak, W.
Wierzbicki, A.
Powiązania:
https://bibliotekanauki.pl/articles/970491.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
optymalizacja wielokryterialna
efektywność
alokacja zasobów
multiple criteria optimization
efficiency
fairness
equity
reference point method
resource allocation
network design
elastic traffic
Opis:
Modern telecommunication networks face an increasing demand for services. Among these, an increasing number are services that can adapt to available bandwidth, and are therefore referred to as elastic traffic. Nominal network design for elastic traffic becomes increasingly significant. Typical resource allocation methods are concerned with the allocation of limited resources among competing activities so as to achieve the best overall performance of the system. In the network dimensioning problem for elastic traffic, one needs to allocate bandwidth to maximize service flows and simultaneously to reach a fair treatment of all the elastic services. Thus, both the overall efficiency (throughput) and the fairness (equity) among various services are important. In such applications, the so-called Max-Min Fairness (MMF) solution concept is widely used to formulate the resource allocation scheme. This approach guarantees fairness but may lead to significant losses in the overall throughput of the network. In this paper we show how the concepts of multiple criteria equitable optimization can be effectively used to generate various fair resource allocation schemes. We introduce a multiple criteria model ecluivalent to equitable optimization and we develop a corresponding reference point procedure to generate fair efficient bandwidth allocations. The procedure is tested on a sample network dimensioning problem and its abilities to model various preferences are demonstrated.
Źródło:
Control and Cybernetics; 2004, 33, 3; 427-448
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nowoczesna platforma projektowa i integracyjna systemów IT w komunikacji miejskiej
Modern design and integration platform of IT systems in urban public transport
Autorzy:
Kisielewski, P.
Powiązania:
https://bibliotekanauki.pl/articles/193363.pdf
Data publikacji:
2016
Wydawca:
Stowarzyszenie Inżynierów i Techników Komunikacji Rzeczpospolitej Polskiej
Tematy:
transport zbiorowy
projektowanie sieci
rozkład jazdy
planowanie
optymalizacja
system informatyczny
platforma integracyjna
public transport
network design
timetable
planning
optimization
IT system
integration platform
Opis:
Rozkład jazdy stanowi podstawę logistyki i fundamentalny systemem informacyjny w publicznym transporcie zbiorowym. Obecnie oprogramowanie do projektowania rozkładów jazdy stanowią zaawansowane technologicznie systemy informatyczne oferujące możliwości szczegółowego projektowania sieci komunikacyjnych, automatycznego generowania kursów, zadań dla pojazdów i kierowców, symulacji ruchu pojazdów w sieci i analityki kosztów operacyjnych systemu transportowego. Systemy rozkładowe zasilają w niezbędne dane inne systemy miejskie m.in. systemy informacji pasażerskiej, dystrybucji biletów, systemy sterowania i kontroli ruchu, systemy ITS i wiele innych. W pracy przedstawiono istotne cechy nowoczesnego systemu projektowania rozkładów, stanowiącego jednocześnie platformę integracyjną systemów informatycznych komunikacji miejskiej.
Time table is the basis for the logistics and the fundamental IT system in an urban public transport. Nowadays the software for time table design are the advanced technology IT systems which offer possibilities of detail transit network design, automatic generation of vehicle trips, vehicle and driver tasks, simulation of vehicle traffic in the network and analysis of operational cost of transport system. Actually time table systems provide necessary data to other urban systems as passenger information systems, ticketing, traffic monitoring and control, ITS and others. In the article an important functionalities of modern timetabling system, forming simultaneously integration platform of IT systems in city public transit have been presented.
Źródło:
Transport Miejski i Regionalny; 2016, 5; 17-22
1732-5153
Pojawia się w:
Transport Miejski i Regionalny
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-6 z 6

    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