<?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=Kist_et_al_2007a</id>
		<title>Kist et al 2007a - 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=Kist_et_al_2007a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Kist_et_al_2007a&amp;action=history"/>
		<updated>2026-05-06T23:50:12Z</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=Kist_et_al_2007a&amp;diff=209021&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 866524382 to Kist et al 2007a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Kist_et_al_2007a&amp;diff=209021&amp;oldid=prev"/>
				<updated>2021-02-03T20:41:09Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_866524382&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 866524382&quot;&gt;Draft Content 866524382&lt;/a&gt; to &lt;a href=&quot;/public/Kist_et_al_2007a&quot; title=&quot;Kist et al 2007a&quot;&gt;Kist et al 2007a&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:41, 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=Kist_et_al_2007a&amp;diff=209020&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  Intra-domain traffic engineering for routing protocols such as OSPF (open shortest path first) or intermediate system-intermediate system (IS-IS) can be perfo...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Kist_et_al_2007a&amp;diff=209020&amp;oldid=prev"/>
				<updated>2021-02-03T20:41:07Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  Intra-domain traffic engineering for routing protocols such as OSPF (open shortest path first) or intermediate system-intermediate system (IS-IS) can be perfo...&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;
Intra-domain traffic engineering for routing protocols such as OSPF (open shortest path first) or intermediate system-intermediate system (IS-IS) can be performed by finding a judicious set of weights to allocate to the links of the network. Unfortunately, methods proposed in the literature for finding those weights may require a significant computational effort. By way of contrast, weight setting approaches based on linear programming can be shown in this paper to find suitable weights in the order of seconds. Prior to this time, it was necessary to determine appropriate weight settings in an off-line mode. From the results presented in this paper it can be demonstrated that solutions can be located for this problem in a matter of seconds. This makes it possible to perform traffic engineering for short term link overloads in real-time mode. The performance of this methodology has been verified by using simulation based on the well-known performance tool, ns-2. The technique described in this paper is being integrated into an optimisation module of a network capacity management tool called OptiFlow.&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://eprints.usq.edu.au/7259/1/Suryasaputra_Kist_Harris_TENCON_2005_PV.pdf http://eprints.usq.edu.au/7259/1/Suryasaputra_Kist_Harris_TENCON_2005_PV.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://eprints.usq.edu.au/7259/1/Suryasaputra_Kist_Harris_TENCON_2005_PV.pdf http://eprints.usq.edu.au/7259/1/Suryasaputra_Kist_Harris_TENCON_2005_PV.pdf],&lt;br /&gt;
: [http://eprints.usq.edu.au/7259 http://eprints.usq.edu.au/7259],&lt;br /&gt;
: [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004085148 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004085148],&lt;br /&gt;
: [https://www.researchgate.net/profile/Richard_Harris9/publication/224280868_OptiFlow_-_A_Capacity_Management_Tool/links/00b4952ab8e7899fb1000000.pdf?origin=publication_detail https://www.researchgate.net/profile/Richard_Harris9/publication/224280868_OptiFlow_-_A_Capacity_Management_Tool/links/00b4952ab8e7899fb1000000.pdf?origin=publication_detail],&lt;br /&gt;
: [https://researchbank.rmit.edu.au/view/rmit:1426 https://researchbank.rmit.edu.au/view/rmit:1426],&lt;br /&gt;
: [https://ieeexplore.ieee.org/document/4085148 https://ieeexplore.ieee.org/document/4085148],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2050864166 https://academic.microsoft.com/#/detail/2050864166]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx5/4084859/4084860/04085148.pdf?arnumber=4085148 http://xplorestaging.ieee.org/ielx5/4084859/4084860/04085148.pdf?arnumber=4085148],&lt;br /&gt;
: [http://dx.doi.org/10.1109/tencon.2005.300828 http://dx.doi.org/10.1109/tencon.2005.300828]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>