Spelling suggestions: "subject:"bandwidth allocation"" "subject:"bandwidth collocation""
21 |
MPLS-Based Best-Effort Traffic EngineeringRojanarowan, Jerapong 26 September 2005 (has links)
MPLS-Based Best-Effort Traffic Engineering
Jerapong Rojanarowan
120 Pages
Directed by Dr. Henry L. Owen
The objective of this research is to develop a multipath traffic engineering framework for best-effort traffic in Multiprotocol Label Switching (MPLS) networks so as to deliver more equal shares of bandwidth to best-effort users as compared to the traditional shortest-path algorithm. The proposed framework is static and the input to the traffic engineering algorithm is restricted to network topology. Performance evaluation of this framework is conducted by simulation using ns-2 network simulator. In a multi-service capable network, some portion of the bandwidth is reserved for guaranteed services and the leftover portion is dedicated to best-effort service. This research examines the problem of traffic engineering for the remaining network bandwidth that is utilized by best-effort traffic where demands are not known a priori. This framework will result in making the limited available best-effort traffic bandwidth more equitably shared by the best-effort flows over a wide range of demands. Traditional traffic engineering research has not examined best-effort traffic.
|
22 |
Energy Efficiency and Differentiated QoS in Next Generation PONsChen, Shen 03 February 2012 (has links)
Energy conservation in next generation Passive Optical Network system (NG-PON) has gained more and more attention. NG-PON system can not only deliver best-effort data traffic, but also real-time data traffic, e.g. voice and video, that have strict bandwidth, delay, and jitter requirements. To meet the energy and service requirements, a NG-PON system must have energy efficiency and differentiated QoS mechanism built in.
Few research efforts have been reported on maximizing energy efficiency while maintaining QoS in the fairly new PON system design. We have extended the Upstream Centric Scheme (UCS-based) scheduling scheme idea into a novel QoS-differentiated energy-efficient PON system consisting of two main modules: firstly, the proposed differentiated QoS analytical model is described in detail to reduce the packet delay in the upstream traffic scheduling. The simulations further demonstrate the QoS metrics of the system: packet delay, bandwidth utilization, dropped packet rate, and queue length.
Secondly, a novel analysis is proposed for downstream traffic scheduling with limited service discipline at Optical Line Terminal (OLT) side under the UCS-based Green Bandwidth Allocation (GBA) framework. We, first, derive the mean packet delay expression of this model. Then, the sleep time for each Optical Network Unit (ONU) is derived by setting identical upstream/downstream transmission cycle time. Based on the analytical model, an approach is developed to save the maximum energy in a dynamic PON system while without violating the delay requirement.
Moreover, simulation is conducted to verify the developed analytical model and the proposed approach. In the end, considering the differentiated QoS and downstream traffic scheduling, an algorithm of the energy efficient scheduling scheme is proposed as well under the UCS-based GBA.
|
23 |
Passive Optical Top-of-Rack Interconnect for Data Center NetworksCheng, Yuxin January 2017 (has links)
Optical networks offering ultra-high capacity and low energy consumption per bit are considered as a good option to handle the rapidly growing traffic volume inside data center (DCs). However, most of the optical interconnect architectures proposed for DCs so far are mainly focused on the aggregation/core tiers of the data center networks (DCNs), while relying on the conventional top-of-rack (ToR) electronic packet switches (EPS) in the access tier. A large number of ToR switches in the current DCNs brings serious scalability limitations due to high cost and power consumption. Thus, it is important to investigate and evaluate new optical interconnects tailored for the access tier of the DCNs. We propose and evaluate a passive optical ToR interconnect (POTORI) architecture for the access tier. The data plane of the POTORI consists mainly of passive components to interconnect the servers within the rack as well as the interfaces toward the aggregation/core tiers. Using the passive components makes it possible to significantly reduce power consumption while achieving high reliability in a cost-efficient way. Meanwhile, our proposed POTORI’s control plane is based on a centralized rack controller, which is responsible for coordinating the communications among the servers in the rack. It can be reconfigured by software-defined networking (SDN) operation. A cycle-based medium access control (MAC) protocol and a dynamic bandwidth allocation (DBA) algorithm are designed for the POTORI to efficiently manage the exchange of control messages and the data transmission inside the rack. Simulation results show that under realistic DC traffic scenarios, the POTORI with the proposed DBA algorithm is able to achieve an average packet delay below 10 μs with the use of fast tunable optical transceivers. Moreover, we further quantify the impact of different network configuration parameters on the average packet delay. / <p>QC 20170503</p>
|
24 |
Ordonnancement et allocation de bande passante dans les systèmes de streaming pair-à-pair multicouches / Scheduling and bandwidth allocation in P2P layered streaming systemsBradai, Abbas 10 December 2012 (has links)
Le but de cette thèse est de proposer des mécanismes efficaces pour l'ordonnancement des chunks et l'allocation de la bande passante dans le contexte de la transmission vidéo sur les réseaux P2P,afin d'offrir une meilleure qualité de service pour l'utilisateur final. Dans un premier temps nousavons proposé un mécanisme d'ordonnancement des chunks pour la transmission de vidéomulticouche dans les réseaux P2P. Le mécanisme proposé est basé sur une nouvelle technique quipermet de sélectionner les chunks adéquats et les demander des pairs les plus appropriés. Ensuitenous avons proposé un mécanisme d'allocation de la bande passante, toujours dans le cadre detransmission de vidéo multicouche dans les réseaux P2P. Le pair émetteur organise une enchère pour«vendre » sa bande passante. L'allocation tient en considération la priorité des pairs et l'importancedes couches demandées. Finalement nous avons proposé un mécanisme d'adaptation lisse « smooth» d'une vidéo multicouche transportée sur un réseau P2P.Après une introduction, nous présentons dans le chapitre 2 les motivations du travail le but du travailet les problèmes recherche qui demeurent. Dans ce chapitre nous présentons les composants dessystèmes P2P et tout particulièrement la distribution et l'adaptation de contenus. Dans ce cadre,nous proposons une classification des applications de streaming vidéo P2P ainsi que des mécanismesd'allocation de bande passante et d'ordonnancement pour le streaming pair-à-pair. Nous nousintéressons également aux techniques d'adaptation de la qualité en se focalisant plusparticulièrement sur la norme SVC (Scalable Video Coding).Le chapitre 3 propose des mécanismes de priorisation pour la planification de streaming P2P multicouches.Nous proposons une heuristique pour résoudre un problème général d'affectationgénéralisé (Generalized Assignment Problem – GAP). La solution présentée est ensuite adaptée aucas du streaming non multicouches. Les résultats issus des simulations montrent que les solutionsproposées donnent de meilleurs résultats que les solutions traditionnelles.Le chapitre 4 décrit un mécanisme d'allocation dynamique de la bande passante pour les réseaux destreaming P2P multicouches qui se base sur l'allocation d'une bande passante aux pairs tout enassurant un minimum de qualité de service à l'ensemble des pairs. Les bonnes performances desmécanismes proposés, qui sont détaillées à travers l'étude du ratio concernant l'utilisation de labande passante ainsi que du niveau de satisfaction des pairs, montrent que ces derniers permettentd'obtenir une utilisation optimale de la bande passante.Le chapitre 5 porte sur le lissage du streaming multicouches dans les réseaux P2P en se basant sur lesmétriques liées à la variation de la fréquence et de l'amplitude. Les mécanismes proposés ont étéimplémentés dans un banc d'essai réel et l'évaluation des performances montrent l'efficacité desmécanismes pour le lissage du streaming.Dans le chapitre 6 (conclusion and perspectives), nous résumons les contributions proposées danscette thèse ainsi qu’une ouverture sur les travaux futures / Recently we witnessed an increasing demand for scalable deployment of real-time multimediastreaming applications over Internet. In this context, Peer-to-Peer (P2P) networks are playing asignificant role for supporting large-scale and robust distribution of multimedia content to end-users.However, due to peers’ dynamicity, heterogeneity of terminals and access networks, the deploymentof real-time video streaming applications over P2P networks arises lot of challenges. Indeed, animportant issue in P2P overlays is the capacity to self-organize in the face of the dynamic behavior ofpeers in order to ensure content availability and continuity. In addition, the heterogeneity in networks,terminals, and P2P characteristics make the situation more challenging. In this context, layered videostreaming in P2P networks has drawn great interest to overcome these challenges, since it can notonly accommodate large numbers of users, but also handle heterogeneity of peers. However, there isstill a lack of comprehensive studies on video data blocks (chunks) scheduling and bandwidthallocation for the smooth playout in layered streaming over P2P networks.The aim of this thesis is to analyze these concerns and to propose an efficient real-time chunksscheduling and bandwidth allocation mechanisms for QoS provisioning of layered streamingapplications over P2P networks. Our contributions in this thesis are threefold. First, we propose ascheduling mechanism for layered P2P streaming. The proposed mechanism relies on a novelscheduling algorithm that enables each peer to select appropriate stream layers, along withappropriate peers to provide them. The presented mechanism makes efficient use of networkresources and provides high system throughput. Second, we propose a bandwidth allocation modelfor P2 layered streaming systems based on auction mechanisms to optimize the allocation of senderpeers’ uploads bandwidth. The upstream peers organize auctions to “sell” theirs items (links’bandwidth) according to bids submitted by the downstream peers taking into consideration the peerspriorities and the requested layers importance. The ultimate goal is to satisfy the quality levelrequirement for each peer, while reducing the overall streaming cost. Finally, we present a smoothingmechanism for layered streaming in P2P networks. The mechanism aims to reduce the number oflayer changes under varying network conditions, and ensure a smooth playout for the end-user.
|
25 |
Alocação dinâmica de largura de banda em redes EPON / Dynamic bandwidth allocation for EPON networksCarrasco Arbieto, Carmen Orencia 10 August 2007 (has links)
As redes de telecomunicações se dividem em redes de longa distância, redes metropolitanas e redes de acesso. As redes de longa distância e metropolitana usufruem a alta capacidade de largura de banda da fibra óptica, enquanto nas redes de acesso há um gargalo de largura de banda por causa do uso de pares de fios e cabo coaxial. Para solucionar este problema e oferecer aos usuários acesso banda larga de baixo custo foram propostas as redes ópticas passivas (passive optical network - PON). A PON é formada por dois elementos básicos, a unidade de rede óptica (optical network unit - ONU), localizada perto dos assinantes, e o terminal de linha óptica (optical line terminal - OLT), localizado próximo ao provedor de serviços. Dentre os padrões disponíveis para redes PON, o Ethernet (EPON), padronizado pelo grupo IEEE 802.3ah, é opção atraente porque ele é bastante difundido nas redes locais. O protocolo de controle multiponto (multipoint control protocol - MPCP), já especificado, é responsável pelo controle de acesso ao meio, fornecendo infra-estrutura de sinalização para transmissão entre OLT e ONUs. Entretanto, o algoritmo de alocação de largura de banda, que realiza o controle de acesso ao meio com base no MPCP, foi considerado fora do escopo de trabalho do grupo de trabalho, permitindo que seja desenvolvido pelos fornecedores de equipamentos. Neste trabalho, arquiteturas de rede EPON e o protocolo MPCP são descritos e algoritmos de alocação de largura de banda são avaliados mediante simulação computacional. São abordados os algoritmos de alocação de largura de banda que integram multiplexação estatística e técnicas para o suporte a classes de serviços diferenciados, com base no esquema de multiplexação por divisão no tempo (time division multiplexing - TDM). Algoritmos que integram a multiplexação por divisão em comprimento de onda (wavelength division multiplexing - WDM) à arquitetura EPON TDM são também investigados. Os algoritmos WDM-TDM permitem a atualização progressiva da EPON que emprega o esquema TDM para WDM. / Telecommunication networks are divided into core, metropolitan and access networks. The core and metropolitan networks use high capacity bandwidth optical fibers, while the access networks have bandwidth bottlenecks because of the use of twisted-pair wires and coaxial cable. To solve this problem and to offers the users broadband access at low cost the use of passive optical networks (PON) is proposed. A PON is formed by two basic elements, the optical network unit (ONU), positioned close to the customers and the optical line terminal (OLT), located close to the service provider. Within the available standards for PON networks, the Ethernet (EPON), standardised by the IEEE group 802.3ah, is an attractive option because it is already widely used in local networks. The multipoint control protocol (MPCP), already specified, is responsible for the media access control, providing signaling infrastructure for transmission between OLT and ONUs. However, the bandwidth allocation algorithm, that controls access based on MPCP, was considered outside the scope of the work group, permitting that this be developed by equipment providers. In this work, EPON architectures and the MPCP protocol are described and bandwidth allocation algorithms are evaluated with computational simulation. Bandwidth allocation algorithms which integrate statistical multiplexing and techniques to support for differentiated classes of service, based on time division multiplexing (TDM) scheme are investigated. Algorithms that integrate wavelength division multiplexing (WDM) to the EPON TDM architecture are also investigated. The WDM-TDM algorithms permit the progressive upgrade of EPON based TDM to WDM schemes.
|
26 |
Dynamic Bandwidth allocation algorithms for an RF on-chip interconnect / Allocation dynamique de bande passante pour l’interconnexion RF d’un réseau sur puceUnlu, Eren 21 June 2016 (has links)
Avec l’augmentation du nombre de cœurs, les problèmes de congestion sont commencé avec les interconnexions conventionnelles. Afin de remédier à ces défis, WiNoCoD projet (Wired RF Network-on-Chip Reconfigurable-on-Demand) a été initié par le financement de l’Agence Nationale de Recherche (ANR). Ce travail de thèse contribue à WiNoCoD projet. Une structure de contrôleur de RF est proposé pour l’interconnexion OFDMA de WiNoCoD et plusieurs algorithmes d’allocation de bande passante efficaces (distribués et centralisés) sont développés, concernant les demandes et contraintes très spécifiques de l’environnement sur-puce. Un protocole innovante pour l’arbitrage des sous-porteuses pour des longueurs bimodales de paquets sur-puce, qui ne nécessite aucun signalisation supplémentaire est introduit. Utilisation des ordres de modulation élevés avec plus grande consommation d’énergie est évaluée. / With rapidly increasing number of cores on a single chip, scalability problems have arised due to congestion and latency with conventional interconnects. In order to address these issues, WiNoCoD project (Wired RF Network-on-Chip Reconfigurable-on-Demand) has been initiated by the support of French National Research Agency (ANR). This thesis work contributes to WiNoCoD project. A special RF controller structure has been proposed for the OFDMA based wired RF interconnect of WiNoCoD. Based on this architecture, effective bandwidth allocation algorithms have been presented, concerning very specific requirements and constraints of on-chip environment. An innovative subcarrier allocation protocol for bimodal packet lengths of cache coherency traffic has been presented, which is proven to decrease average latency significantly. In addition to these, effective modulation order selection policies for this interconnect have been introduced, which seeks the optimal delay-power trade-off.
|
27 |
Design, analysis and simultion for optical access and wide-area networks.Chen, Jiajia January 2009 (has links)
Due to the tremendous growth of traffic volume caused by both exponential increase of number of Internet users and continual emergence of new bandwidth demanding applications, high capacity networks are required in order to satisfactorily handle the extremely large amount of traffic. Hence, optical fiber communication is the key technology for the network infrastructure. This thesis addresses design, analysis and simulation of access and core networks targeting important research problems, which need to be tackled for the effective realization of next generation optical networks. Among different fiber access architectures, passive optical network (PON) is considered as the most promising alternative for the last mile connection due to its relatively low cost and resource efficiency. The inherent bursty nature of the user generated traffic results in dynamically changing bandwidth demand on per subscriber basis. In addition, access networks are required to support differentiated quality of service and accommodate multiple service providers. To address these problems we proposed three novel scheduling algorithms to efficiently realize dynamic bandwidth allocation in PON, along with guaranteeing both the priority and fairness of the differentiated services among multiple users and/or service providers. Meanwhile, because of the increasing significance of reliable access to network services, an efficient fault management mechanism needs to be provided in PON. In addition, access networks are very cost sensitive and the cost of protection should be kept as low as possible. Therefore, we proposed three novel cost-effective protection architectures keeping in mind that reliability requirement in access networks should be satisfied at the minimal cost. Regarding the optical core networks, replacing electronic routers with all-optical switching nodes can offer significant advantages in realizing high capacity networks. Because of the technological limitations for realizing all-optical nodes, the focus is put on the ingenious architecture design. Therefore, we contributed on novel switching node architectures for optical circuit and packet switching networks. Furthermore, we addressed different aspects of routing and wavelength assignment (RWA) problem, which is an important and hard task to be solved in wavelength routed networks. First, we proposed an approach based on the information summary protocol to reduce the large amount of control overhead needed for dissemination of the link state information in the case of adaptive routing. In addition, transparency in optical networks may cause vulnerability to physical layer attacks. To target this critical security related issue, we proposed an RWA solution to minimize the possible reachability of a jamming attack. Finally, in order to evaluate our ideas we developed two tailor-made simulators based on discrete event driven system for the detailed studies of PON and switched optical networks. Moreover, the proposed tabu search heuristic for our RWA solution was implemented in C++. / QC 20100707
|
28 |
權重效用在網路問題上之研究 / A Study on Weighted Utilizations of Network Dimensioning Problems程雅惠, Cheng,Ya Hui Unknown Date (has links)
我們以公平頻寬配置考慮網路上多重等級與多重服務品質的效用函數,
利用權重效用函數提出兩種數學最佳化模型。
這兩個模型的目標都是要尋找權重效用函數總和值的最大值。
本篇論文特別以權重為決策變數,
研究最佳權重的行為模式,
並求得最佳權重分佈公式。
我們發現模型I的總權重效用只看重某個效用值最大的等級, 完全忽略其他效用值較小的等級;
即最大效用函數的最佳權重為1,其他效用較小的最佳權重為0。
在最佳化過程中, 模型II的數值資料呈現出最佳權重架構為:最佳權重中的每個權重均相等,且總和為1。
我們隨後證明這些結果,並利用GAMS軟體來呈現數值資料。 / We propose two mathematical models with weighted utility functions
for the fair bandwidth allocation
and QoS routing in communication networks which offer multiple services for
several classes of users. The formulation and numerical experiments are carried out in a general
utility-maximizing framework.
In this work, instead of being fixed, the weight for each utility function is taken as a free variable.
The objective of this thesis is to find the structure of optimal weights that
maximize the weighted sum of utilities of the bandwidth allocation for each class.
We solve it by proposing two models in terms of fairness.
Model I and II are constructed to compare different choices for optimal weights.
For Model I, the structure of optimal weights form a vector which consists of one
for a class and zero otherwise.
For Model II, the form of optimal weights is that each weight of utility
function is equally assigned.
The results are proved and illustrated by software GAMS numerically.
|
29 |
A Study In Combinatorial AuctionsBilge, Betul 01 August 2004 (has links) (PDF)
By the emergence of electronic commerce and low transaction costs on the Internet, an interest in the design of new auction mechanisms has been arisen. Recently many researchers in computer science, economics, business, and game theory have presented many valuable studies on the subject of online auctions, and auctions theory.
When faced from a computational perspective, combinatorial auctions are perhaps the most challenging ones. Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-item multi-unit situations where the agents&rsquo / valuations of the items are not additive. However, determining the winners to maximize the revenue is NP-complete.
In this study, we first analyze the existing approaches for combinatorial auction problem. Based on this analysis, we then choose three different approaches, which are search approach, descending simultaneous auctions approach, and IP (Integer Programming) formulation approach to build our models. The performances of the models are compared using computer simulations, where we model bandwidth allocation system. Finally a combinatorial auction tool is built which can be used for online auctions and e-procurement systems.
|
30 |
A Bandwidth Market in an IP NetworkLusilao-Zodi, Guy-Alain 03 1900 (has links)
Thesis (MSc (Mathematical Sciences. Computer Science))--University of Stellenbosch, 2008. / Consider a path-oriented telecommunications network where calls arrive to each route in a
Poisson process. Each call brings on average a fixed number of packets that are offered to
route. The packet inter-arrival times and the packet lengths are exponentially distributed.
Each route can queue a finite number of packets while one packet is being transmitted. Each
accepted packet/call generates an amount of revenue for the route manager. At specified
time instants a route manager can acquire additional capacity (“interface capacity”) in
order to carry more calls and/or the manager can acquire additional buffer space in order
to carry more packets, in which cases the manager earns more revenue; alternatively a
route manager can earn additional revenue by selling surplus interface capacity and/or by
selling surplus buffer space to other route managers that (possibly temporarily) value it
more highly. We present a method for efficiently computing the buying and the selling
prices of buffer space.
Moreover, we propose a bandwidth reallocation scheme capable of improving the network
overall rate of earning revenue at both the call level and the packet level. Our
reallocation scheme combines the Erlang price [4] and our proposed buffer space price
(M/M/1/K prices) to reallocate interface capacity and buffer space among routes. The
proposed scheme uses local rules and decides whether or not to adjust the interface capacity
and/or the buffer space. Simulation results show that the reallocation scheme achieves
good performance when applied to a fictitious network of 30-nodes and 46-links based on
the geography of Europe.
|
Page generated in 0.1121 seconds