اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدComputing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think
57
0
0.0
(
0
)
نشر من قبل
Jean-Romain Luttringer
تاريخ النشر
2020
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
تأليف
Jean-Romain Luttringer
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
With the growth of demands for quasi-instantaneous communication services such as real-time video streaming, cloud gaming, and industry 4.0 applications, multi-constraint Traffic Engineering (TE) becomes increasingly important. While legacy TE management planes have proven laborious to deploy, Segment Routing (SR) drastically eases the deployment of TE paths and thus became the most appropriate technology for many operators. The flexibility of SR sparked demands in ways to compute more elaborate paths. In particular, there exists a clear need in computing and deploying Delay-Constrained Least-Cost paths (DCLC) for real-time applications requiring both low delay and high bandwidth routes. However, most current DCLC solutions are heuristics not specifically tailored for SR. In this work, we leverage both inherent limitations in the accuracy of delay measurements and an operational constraint added by SR. We include these characteristics in the design of BEST2COP, an exact but efficient ECMP-aware algorithm that natively solves DCLC in SR domains. Through an extensive performance evaluation, we first show that BEST2COP scales well even in large random networks. In real networks having up to thousands of destinations, our algorithm returns all DCLC solutions encoded as SR paths in way less than a second.
قيم البحث
اقرأ أيضاً
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different location. With the development of Internet, Multicast is widely applied in all
kinds of multimedia real-time application: distributed multimedia systems, collaborative computing, video-conferencing, distance education, etc. In order to construct a delay-constrained multicast routing tree, average distance heuristic (ADH) algorithm is analyzed firstly. Then a delay-constrained algorithm called DCADH (delay-constrained average distance heuristic) is presented. By using ADH a least cost multicast routing tree can be constructed; if the path delay cant meet the delay upper bound, a shortest delay path which is computed by Dijkstra algorithm will be merged into the existing multicast routing tree to meet the delay upper bound. Simulation experiments show that DCADH has a good performance in achieving a low-cost multicast routing tree.
Routing plays a fundamental role in network applications, but it is especially challenging in Delay Tolerant Networks (DTNs). These are a kind of mobile ad hoc networks made of e.g. (possibly, unmanned) vehicles and humans where, despite a lack of co
ntinuous connectivity, data must be transmitted while the network conditions change due to the nodes mobility. In these contexts, routing is NP-hard and is usually solved by heuristic store and forward replication-based approaches, where multiple copies of the same message are moved and stored across nodes in the hope that at least one will reach its destination. Still, the existing routing protocols produce relatively low delivery probabilities. Here, we genetically improve two routing protocols widely adopted in DTNs, namely Epidemic and PRoPHET, in the attempt to optimize their delivery probability. First, we dissect them into their fundamental components, i.e., functionalities such as checking if a node can transfer data, or sending messages to all connections. Then, we apply Genetic Improvement (GI) to manipulate these components as terminal nodes of evolving trees. We apply this methodology, in silico, to six test cases of urban networks made of hundreds of nodes, and find that GI produces consistent gains in delivery probability in four cases. We then verify if this improvement entails a worsening of other relevant network metrics, such as latency and buffer time. Finally, we compare the logics of the best evolved protocols with those of the baseline protocols, and we discuss the generalizability of the results across test cases.
Context. Extinction and emission of dust models need for observational constraints to be validated. The coreshine phenomenon has already shown the importance of scattering in the 3 to 5 micron range and its ability to validate dust properties for den
se cores. Aims. We want to investigate whether scattering can also play a role at longer wavelengths and to place even tighter constraints on the dust properties. Methods. We analyze the inversion of the Spitzer 8 micron map of the dense molecular cloud L183, to examine the importance of scattering as a potential contributor to the line-of-sight extinction. Results. The column density deduced from the inversion of the 8 micron map, when we neglect scattering, disagrees with all the other column density measurements of the same region. Modeling confirms that scattering at 8 microns is not negligible with an intensity of several hundred kJy per sr. This demonstrates the need of efficiently scattering dust grains at MIR wavelengths up to 8 microns. Coagulated aggregates are good candidates and might also explain the discrepancy at high extinction between E(J-K) et tau(9.7) toward dense molecular clouds. Further investigation requires considering efficiently scattering dust grains including ices as realistic dust models.
Due to the presence of buffers in the inner network nodes, each congestion event leads to buffer queueing and thus to an increasing end-to-end delay. In the case of delay sensitive applications, a large delay might not be acceptable and a solution to
properly manage congestion events while maintaining a low end-to-end delay is required. Delay-based congestion algorithms are a viable solution as they target to limit the experienced end-to-end delay. Unfortunately, they do not perform well when sharing the bandwidth with congestion control algorithms not regulated by delay constraints (e.g., loss-based algorithms). Our target is to fill this gap, proposing a novel congestion control algorithm for delay-constrained communication over best effort packet switched networks. The proposed algorithm is able to maintain a bounded queueing delay when competing with other delay-based flows, and avoid starvation when competing with loss-based flows. We adopt the well-known price-based distributed mechanism as congestion control, but: 1) we introduce a novel non-linear mapping between the experienced delay and the price function and 2) we combine both delay and loss information into a single price term based on packet interarrival measurements. We then provide a stability analysis for our novel algorithm and we show its performance in the simulation results carried out in the NS3 framework. Simulation results demonstrate that the proposed algorithm is able to: achieve good intra-protocol fairness properties, control efficiently the end-to-end delay, and finally, protect the flow from starvation when other flows cause the queuing delay to grow excessively.
We present an intrinsic AGN SED extending from the optical to the submm, derived with a sample of unobscured, optically luminous (vLv(5100)>10^43.5 erg/s) QSOs at z<0.18 from the Palomar Green survey. The intrinsic AGN SED was computed by removing th
e contribution from stars using the 11.3um polycyclic aromatic hydrocarbon (PAH) feature in the QSOs mid-IR spectra; the 1sigma uncertainty on the SED ranges between 12 and 45 per cent as a function of wavelength and is a combination of PAH flux measurement errors and the uncertainties related to the conversion between PAH luminosity and star-forming luminosity. Longwards of 20um the shape of the intrinsic AGN SED is independent of the AGN power indicating that our template should be applicable to all systems hosting luminous AGN (vLv(5100) or L_X(2-10keV) > 10^43.5 erg/s). We note that for our sample of luminous QSOs, the average AGN emission is at least as high as, and mostly higher than, the total stellar powered emission at all wavelengths from the optical to the submm. This implies that in many galaxies hosting powerful AGN, there is no `safe broadband photometric observation (at lambda<1000um) which can be used in calculating star-formation rates without subtracting the AGN contribution. Roughly, the AGN contribution may be ignored only if the intrinsic AGN luminosity at 5100 Ang is at least a factor of 4 smaller than the total infrared luminosity (L_IR; 8-1000um) of the galaxy. Finally, we examine the implication of our work in statistical studies of star-formation in AGN host galaxies.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
