<?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=Gelenbe_Sakellari_2008a</id>
		<title>Gelenbe Sakellari 2008a - 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=Gelenbe_Sakellari_2008a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Gelenbe_Sakellari_2008a&amp;action=history"/>
		<updated>2026-04-25T22:48:19Z</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=Gelenbe_Sakellari_2008a&amp;diff=195628&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 172777423 to Gelenbe Sakellari 2008a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Gelenbe_Sakellari_2008a&amp;diff=195628&amp;oldid=prev"/>
				<updated>2021-01-28T23:16:08Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_172777423&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 172777423&quot;&gt;Draft Content 172777423&lt;/a&gt; to &lt;a href=&quot;/public/Gelenbe_Sakellari_2008a&quot; title=&quot;Gelenbe Sakellari 2008a&quot;&gt;Gelenbe Sakellari 2008a&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 23:16, 28 January 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=Gelenbe_Sakellari_2008a&amp;diff=195627&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  High demand and network congestion, can prevent multimedia applications and users from obtaining the network service they require for a successful operation....&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Gelenbe_Sakellari_2008a&amp;diff=195627&amp;oldid=prev"/>
				<updated>2021-01-28T23:16:03Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  High demand and network congestion, can prevent multimedia applications and users from obtaining the network service they require for a successful operation....&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;
High demand and network congestion, can prevent multimedia applications and users from obtaining the network service they require for a successful operation. A way to control traffic congestion and satisfy all users' QoS requirements, without overprovisioning, is admission control (AC). This work presents a measurement-based AC mechanism, which improves the performance of a self-aware network (SAN) (E. Gelenbe et al., 2004) and provides QoS throughout the lifetime of all connections. Our algorithm is a multiple criteria AC algorithm, where each user can specify the QoS metrics that interest him/her. Our scheme which decides whether a new call should be allowed to enter the network based on measurements of the QoS metrics on each link of the network before and after the transmission of probe packets. The decision is based on a novel algebra of QoS metrics, inspired by Warshal's algorithm, that searches whether there is a feasible path to accommodate the new flow with out affecting the existing users. Our algorithm and the underlying mathematical principles was briefly described and we present experimental results, conducted in a large laboratory test-bed, under highly congested circumstances.&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://san.ee.ic.ac.uk/publications/chinacom-MBACforSAN.pdf http://san.ee.ic.ac.uk/publications/chinacom-MBACforSAN.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx5/4660003/4684945/04685208.pdf?arnumber=4685208 http://xplorestaging.ieee.org/ielx5/4660003/4684945/04685208.pdf?arnumber=4685208],&lt;br /&gt;
: [http://dx.doi.org/10.1109/chinacom.2008.4685208 http://dx.doi.org/10.1109/chinacom.2008.4685208]&lt;br /&gt;
&lt;br /&gt;
* [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004685208 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004685208],&lt;br /&gt;
: [https://san.ee.ic.ac.uk/publications/chinacom-MBACforSAN.pdf https://san.ee.ic.ac.uk/publications/chinacom-MBACforSAN.pdf],&lt;br /&gt;
: [http://eprints.mdx.ac.uk/15865 http://eprints.mdx.ac.uk/15865],&lt;br /&gt;
: [https://ieeexplore.ieee.org/document/4685208 https://ieeexplore.ieee.org/document/4685208],&lt;br /&gt;
: [http://san.ee.ic.ac.uk/publications/chinacom-MBACforSAN.pdf http://san.ee.ic.ac.uk/publications/chinacom-MBACforSAN.pdf],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/1985533850 https://academic.microsoft.com/#/detail/1985533850]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>