<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Djarallah_et_al_2011a</id>
		<title>Djarallah et al 2011a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Djarallah_et_al_2011a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Djarallah_et_al_2011a&amp;action=history"/>
		<updated>2026-04-16T21:45:36Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Djarallah_et_al_2011a&amp;diff=209155&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 909291834 to Djarallah et al 2011a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Djarallah_et_al_2011a&amp;diff=209155&amp;oldid=prev"/>
				<updated>2021-02-03T20:50:46Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_909291834&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 909291834&quot;&gt;Draft Content 909291834&lt;/a&gt; to &lt;a href=&quot;/public/Djarallah_et_al_2011a&quot; title=&quot;Djarallah et al 2011a&quot;&gt;Djarallah et al 2011a&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 20:50, 3 February 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Djarallah_et_al_2011a&amp;diff=209154&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  International audience; Internet usages have changed with the emergence of value added services relying on a higher interactivity and needs for a better quali...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Djarallah_et_al_2011a&amp;diff=209154&amp;oldid=prev"/>
				<updated>2021-02-03T20:50:43Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  International audience; Internet usages have changed with the emergence of value added services relying on a higher interactivity and needs for a better quali...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
International audience; Internet usages have changed with the emergence of value added services relying on a higher interactivity and needs for a better quality of experience (QoE). Telecommunication operators have to face a continuing growth of new types of Internet traffic (video, games, telepresence, etc.) imposing not only a more efficient utilization of their network infrastructure resources, but also the generation of new revenues to pursue investments and sustain the increasing demand. Such services generally cross multiple domains, but inter-domain routing protocols still have some limitations in terms of service assurance. For example, BGP's single route announce for a destination limits potential traffic engineering features (e.g. no quality of service price/efficiency optimization, inter-domain shared route protection , inter-domain load balancing, etc.). In order to provision end-to-end inter-domain connections that obey to constraints such as bandwidth, delay, jitter, and packet loss for these services, an interesting approach is to compute end-to-end (e2e) paths over multiple inter-domain routes. This will allow establishing more efficiently the inter-domain connections with respect to requested QoS constraints and sharing these constraints (and associated revenues) among multiple operators to globally accept more demands in the system, while keep satisfying the customer QoE. To address these challenges, we propose an efficient distributed inter-domain algorithm that computes such constrained paths among a set of domains, exploring multiple inter-domain routes. We demonstrate that our algorithm not only increases success rate in delivering feasible paths, but also admits more connections and keeps a reasonable runtime.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Original document ==&lt;br /&gt;
&lt;br /&gt;
The different versions of the original document can be found in:&lt;br /&gt;
&lt;br /&gt;
* [http://dx.doi.org/10.1109/3PGCIC.2011.34 http://dx.doi.org/10.1109/3PGCIC.2011.34]&lt;br /&gt;
&lt;br /&gt;
* [http://www.irisa.fr/prive/bcousin/Articles/Articles%202011/Distributed%20E2E%20QoS-Based%20Path%20Computation%20Algorithm%20Over%20Multiple%20Inter-Domain%20Routes.pdf http://www.irisa.fr/prive/bcousin/Articles/Articles%202011/Distributed%20E2E%20QoS-Based%20Path%20Computation%20Algorithm%20Over%20Multiple%20Inter-Domain%20Routes.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx5/6099686/6103130/06103155.pdf?arnumber=6103155 http://xplorestaging.ieee.org/ielx5/6099686/6103130/06103155.pdf?arnumber=6103155],&lt;br /&gt;
: [http://dx.doi.org/10.1109/3pgcic.2011.34 http://dx.doi.org/10.1109/3pgcic.2011.34]&lt;br /&gt;
&lt;br /&gt;
* [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000006103155 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000006103155],&lt;br /&gt;
: [http://www.irisa.fr/prive/Bernard.Cousin/Articles/Articles%202011/Distributed%20E2E%20QoS-Based%20Path%20Computation%20Algorithm%20Over%20Multiple%20Inter-Domain%20Routes.pdf http://www.irisa.fr/prive/Bernard.Cousin/Articles/Articles%202011/Distributed%20E2E%20QoS-Based%20Path%20Computation%20Algorithm%20Over%20Multiple%20Inter-Domain%20Routes.pdf],&lt;br /&gt;
: [https://dblp.uni-trier.de/db/conf/3pgcic/3pgcic2011.html#DjarallahSPLC11 https://dblp.uni-trier.de/db/conf/3pgcic/3pgcic2011.html#DjarallahSPLC11],&lt;br /&gt;
: [https://hal.archives-ouvertes.fr/hal-01183777 https://hal.archives-ouvertes.fr/hal-01183777],&lt;br /&gt;
: [https://hal.archives-ouvertes.fr/hal-01183777/document https://hal.archives-ouvertes.fr/hal-01183777/document],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/1991329660 https://academic.microsoft.com/#/detail/1991329660]&lt;br /&gt;
&lt;br /&gt;
* [https://hal.archives-ouvertes.fr/hal-01183777 https://hal.archives-ouvertes.fr/hal-01183777],&lt;br /&gt;
: [https://hal.archives-ouvertes.fr/hal-01183777/document https://hal.archives-ouvertes.fr/hal-01183777/document],&lt;br /&gt;
: [https://hal.archives-ouvertes.fr/hal-01183777/file/Distributed%20E2E%20QoS-Based%20Path%20Computation%20Algorithm%20Over%20Multiple%20Inter-Domain%20Routes.pdf https://hal.archives-ouvertes.fr/hal-01183777/file/Distributed%20E2E%20QoS-Based%20Path%20Computation%20Algorithm%20Over%20Multiple%20Inter-Domain%20Routes.pdf]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>