Spelling suggestions: "subject:"open shortest path first"" "subject:"open shortest path hirst""
1 |
Enhancing OSPF to provide adaptive traffic distribution with networks for improved QoS performanceMohamed Tasir, Abdul Rahman January 2007 (has links)
In recent years the growth in demand for multimedia applications delivered over a network has been extensive illustrated by the phenomenal expansion of the World Wide Web in today's Internet. Increasing amounts of electronic information are presented in a multimedia format and delivered over networks, which generates increased traffic demands. In short, future networks will not only comprise multiple, interconnected data transport platforms but will also need to handle an increasing range of distributed multimedia services, delivered to a diverse user community that is increasingly becoming mobile.
|
2 |
Improving routing security using a decentralized public key distribution algorithm /Goold, Jeremy C., January 2005 (has links) (PDF)
Thesis (M.S.)--Brigham Young University. Dept. of Computer Science, 2005. / Includes bibliographical references (p. 59-62).
|
3 |
Conception et gestion de réseaux efficaces en énergie / Design and management of networks with low power consumptionPhan, Truong Khoa 25 September 2014 (has links)
Dans cette thèse, nous étudions plusieurs modèles de routage efficaces en énergie. Pour chaque modèle, nous présentons une formulation en programmation linéaire mixte permettant de trouver une solution exacte. En outre, comme il s’agit de problèmes NP-Difficiles, nous proposons des heuristiques efficaces pour des réseaux de grande taille. Dans la première partie de cette thèse, nous étudions une solution de routage efficace en énergie dans laquelle nous ajoutons la possibilité d’éliminer des redondances dans les paquets transmis sur le réseau. Nous montrons premièrement que l’ajout de l’élimination des redondances permet d’améliorer l’efficacité énergétique des réseaux en éteignant plus de liens. Ensuite, nous étendons le modèle afin qu’il prenne en compte un certain niveau d’incertitudes dans le volume de trafic et le taux de redondances. La deuxième partie de cette thèse est consacrée aux problèmes qui se posent lors du déploiement de tels protocoles dans les réseaux. Plus particulièrement, nous proposons de minimiser les changements entre deux configurations réseaux consécutives lorsque plusieurs matrices de trafic sont considérées. Le routage des demandes étant alors assuré avec le protocole de routage OSPF (Open Shortest Path First). Ensuite, nous abordons le problème de la limitation du nombre de règles de routage dans les routeurs en utilisant une technologie de type SDN (Software Defined Networks). Enfin, nous présentons en annexe des travaux complémentaires réalisés au cours de cette thèse concernant le routage multicast et le contrôle de congestion TCP. / In this thesis, we study several models of energy-Aware routing. For each model, we present a linear programming formulation to find the exact solution. Moreover, since energy-Aware routing is NP-Hard problem, we also propose efficient heuristic algorithms for large scale networks. In the first part of this thesis, we deal with GreenRE - a new energy-Aware routing model with the support of redundancy elimination. We first present a deterministic model in which we show how to combine energy-Aware routing and redundancy elimination to improve energy efficiency for backbone networks. Then, we extend the model in order to take into account uncertainties in traffic volumes and redundancy rates. The second part of this thesis is devoted to the deployment issues of energy- aware routing in practice. In detail, to avoid service deterioration for end-Users, we limit changes of network configurations in multi-Period traffic matrices in Open Shortest Path First (OSPF) protocol. Next, we address the problem of limited rule space in OpenFlow switches when installing energy-Aware routing configurations. Finally, we present in the appendix other works developed during this thesis: multicast network protocol and TCP congestion control algorithm.
|
4 |
Congestion Identification in a Radio Access Transport NetworkMontojo Villasanta, Javier, Maqueda Viñas, Manuel January 2014 (has links)
The convergence of mobile services and Internet has brought a radical change in mobile networks. An all IP network architecture, an evolution of the radio access transport network, is required to support new high-bandwidth services. Unfortunately, existing control mechanisms are insufficient to guarantee end users a high quality of experience. However, coordinating radio and transport network resources is expected to yield a more efficient solution. This thesis project investigates the interactions between the congestion avoidance protocols, explicit congestion notification, and the traffic engineering metrics for latency and bandwidth, when using Open Shortest Path First with traffic engineering (OSPF-TE) as a routing protocol. Using knowledge of these interactions, it is possible to identify the appearance of bottlenecks and to control the congestion in the transport links within a radio access transport network. Augmenting a topology map with the network’s current characteristics and reacting to evidence of potential congestion, further actions, such as handovers can be taken to ensure the users experience their expected quality of experience. The proposed method has been validated in a test bed. The results obtained from experiments and measurements in this test bed provide a clear picture of how the traffic flows in the network. Furthermore, the behavior of the network observed in these experiments, in terms of real-time performance and statistical analysis of metrics over a period of time, shows the efficiency of this proposed solution. / Tjänstekonvergensen av Internet- och mobila tjänster har medfört en radikal förändring i mobilnäten. En ”All IP” nätverksarkitektur, en utveckling av radios transportnät. Utvecklingen krävs för att stödja de nya bredbandiga tjänsterna. Tyvärr är befintliga kontrollmekanismer otillräckliga för att garantera användarens kvalitetsupplevelse. Med att samordna radio- och transportnätverkets resurser förväntar man sig en effektivare lösning. Detta examensarbete undersöker samspelet mellan protokoll för att undvika överlast, direkt indikation av överlast och trafikal statistik för fördröjning och bandbredd med trafikstyrning baserat på fördröjning och bandbredd , vid användning av Open Shortest Path First ( OSPF - TE ) som routingprotokoll. Med hjälp av information om dessa interaktioner, är det möjligt att identifiera uppkomsten av flaskhalsar och för att styra trafikstockningar i transportförbindelser inom ett radioaccess transportnät. En utökad topologikarta med nätverkets aktuella egenskaper kommer att reagera på en potentiell överbelastning. Ytterligare åtgärder, till exempel överlämningar, vidtas i mobilnätet för att säkerställa användarens upplevda kvalitet. Den föreslagna metoden har validerats i en testmiljö. Resultaten från experiment och mätningar i denna testmiljö ger en tydlig bild av hur trafikflödena framskrider i nätverket. Beteendet hos nätverket som observeras i dessa experiment, i termer av realtidsprestanda och statistisk analys av mätvärden över en tidsperiod, visar effektiviteten av denna föreslagna lösning.
|
Page generated in 0.0615 seconds