<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Continuous_dual_Hahn_polynomials</id>
	<title>Continuous dual Hahn polynomials - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Continuous_dual_Hahn_polynomials"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Continuous_dual_Hahn_polynomials&amp;action=history"/>
	<updated>2026-04-21T22:45:18Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.0-wmf.28</generator>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Continuous_dual_Hahn_polynomials&amp;diff=26923&amp;oldid=prev</id>
		<title>en&gt;Headbomb: Various citation cleanup (identifiers mostly) using AWB</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Continuous_dual_Hahn_polynomials&amp;diff=26923&amp;oldid=prev"/>
		<updated>2011-09-05T07:01:19Z</updated>

		<summary type="html">&lt;p&gt;Various citation cleanup (identifiers mostly) using &lt;a href=&quot;/index.php?title=Testwiki:AWB&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Testwiki:AWB (page does not exist)&quot;&gt;AWB&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;[[File:phoenix arch.png|thumb|350px|Weighted-based NC calculation in Phoenix]]&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Phoenix&amp;#039;&amp;#039;&amp;#039; is a decentralized [[network coordinate]] (NC) system based on the [[matrix factorization]] model.&amp;lt;ref name=&amp;quot;Phoenix_Chen11&amp;quot;&amp;gt;{{Cite journal&lt;br /&gt;
 | author = Y. Chen, X. Wang, C. Shi, and et al.&lt;br /&gt;
 | url = http://www.cs.duke.edu/~ychen/papers/Phoenix_TNSM.pdf&lt;br /&gt;
 | format=PDF&lt;br /&gt;
 | title = Phoenix: A Weight-based Network Coordinate System Using Matrix Factorization&lt;br /&gt;
| month = December&lt;br /&gt;
 | volume = 8&lt;br /&gt;
 | issue = 4&lt;br /&gt;
| pages = 334–347&lt;br /&gt;
 | journal = [[IEEE Transactions on Network and Service Management]]&lt;br /&gt;
 | year = 2011&lt;br /&gt;
}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Background ==&lt;br /&gt;
* Network coordinates (NC) system&amp;lt;ref&amp;gt;{{Cite journal&lt;br /&gt;
 | author = B. Donnet,  B.  Gueye, M.A.  Kaafar&lt;br /&gt;
 | title = A Survey on Network Coordinates Systems, Design, and Security &lt;br /&gt;
 | journal = IEEE Communications Surveys &amp;amp; Tutorials&lt;br /&gt;
 | volume = 12&lt;br /&gt;
 | issue = 4&lt;br /&gt;
 | pages = 488–503&lt;br /&gt;
 | year = 2010&lt;br /&gt;
 | url = http://planete.inrialpes.fr/people/kaafar/survey-normal.pdf&lt;br /&gt;
 | doi = 10.1109/SURV.2010.032810.00007&lt;br /&gt;
}}&amp;lt;/ref&amp;gt; is an efficient mechanism for Internet distance ([[round-trip latency]]) prediction with scalable measurements. For a network with N hosts, by performing O(N) measurements, all N*N distances can be predicted.&lt;br /&gt;
* Use cases: [[Vuze]] BitTorrent, application layer multicast, PeerWise overlay, multi-player online gaming.&lt;br /&gt;
* [[Triangle inequality]] violation (TIV) is widely exist on the Internet due to the current sub-optimal [[Internet routing]].&lt;br /&gt;
&lt;br /&gt;
== Model ==&lt;br /&gt;
* Most of the prior NC systems utilize the Euclidean distance model, i.e., embeds N hosts into a d-dimensional [[Euclidean space]] &amp;#039;&amp;#039;&amp;#039;R&amp;#039;&amp;#039;&amp;#039;&amp;lt;sup&amp;gt;&amp;#039;&amp;#039;d&amp;#039;&amp;#039;&amp;lt;/sup&amp;gt;. Due to the wide existence of TIV on the Internet, the prediction accuracy of such systems is limited. Phoenix chooses [[Matrix factorization]] (MF) model, which does not have the constraint of TIV.&lt;br /&gt;
* The [[linear dependence]] among the rows motivates the factorization of Internet distance matrix, i.e., for a system with &amp;lt;math&amp;gt;N&amp;lt;/math&amp;gt; Internet nodes, the &amp;lt;math&amp;gt;N \times N&amp;lt;/math&amp;gt; Internet distance matrix D can be factorized into two smaller matrices. &amp;lt;math&amp;gt;D \approx XY^T&amp;lt;/math&amp;gt; where &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;Y&amp;lt;/math&amp;gt; are &amp;lt;math&amp;gt;N \times d&amp;lt;/math&amp;gt; matrices (d &amp;lt;&amp;lt; N). This matrix factorization is essentially a problem of linear dimensionality reduction, while Phoenix try to solve it via a distributed way.&lt;br /&gt;
&lt;br /&gt;
== Design choices in Phoenix ==&lt;br /&gt;
* Different from the existing MF based NC systems such as IDES&amp;lt;ref name=&amp;quot;IDES_Mao06&amp;quot;&amp;gt;{{Cite journal&lt;br /&gt;
 | author = Yun Mao, Lawrence Saul and Jonathan M. Smith&lt;br /&gt;
 | title = IDES: An Internet Distance Estimation Service for Large Networks&lt;br /&gt;
 | journal = [[IEEE Journal on Selected Areas in Communications]]&lt;br /&gt;
 | url = http://www2.research.att.com/~maoy/pub/ides_jsac06.pdf&lt;br /&gt;
 | format=PDF&lt;br /&gt;
 | month = December&lt;br /&gt;
 | volume = 24&lt;br /&gt;
 | issue = 12&lt;br /&gt;
 | pages = 2273&amp;amp;ndash;2284&lt;br /&gt;
 | year = 2006&lt;br /&gt;
 | doi=10.1109/JSAC.2006.884026&lt;br /&gt;
}}&amp;lt;/ref&amp;gt; and DMF,&amp;lt;ref&amp;gt;{{Cite conference&lt;br /&gt;
 | author = Y. Liao, P. Geurts and G. Leduc&lt;br /&gt;
 | year = 2010&lt;br /&gt;
 | url = http://www.run.montefiore.ulg.ac.be/~liao/papers/networking2010_liao.pdf&lt;br /&gt;
 | format=PDF&lt;br /&gt;
 | title = Network Distance Prediction Based on Decentralized Matrix Factorization&lt;br /&gt;
 | booktitle = Proc. of IFIP Networking&lt;br /&gt;
}}&amp;lt;/ref&amp;gt; Phoenix introduces a &amp;#039;&amp;#039;&amp;#039;weight&amp;#039;&amp;#039;&amp;#039; to each reference NC and trusts the NCs with higher weight values more than the others. The weight based mechanism can substantially reduce the impact of the error propagation.&lt;br /&gt;
* For node discovery, Phoenix utilizes a distributed scheme, so-called [[Peer exchange]] (PEX), which is used in [[BitTorrent (protocol)]]. The usage of PEX reduces the load of the tracker, while still ensuring the prediction accuracy under node churn.&lt;br /&gt;
* Similar to DMF, for avoiding the potential drift of the NCs, [[Regularization (mathematics)]] is introduced in NC calculation.&lt;br /&gt;
* NCShield&amp;lt;ref&amp;gt;{{Cite conference&lt;br /&gt;
 | author = Shining Wu,Yang Chen, Xiaoming Fu, Jun Li&lt;br /&gt;
 | year = 2012&lt;br /&gt;
 | url = http://www.cs.duke.edu/~ychen/papers/NCShield_IWQoS12.pdf&lt;br /&gt;
 | title = NCShield: Securing Decentralized, Matrix Factorization-Based Network Coordinate Systems&lt;br /&gt;
 | booktitle = Proc. of the 20th IEEE/ACM International Workshop on Quality of Service (IWQoS&amp;#039;12)&lt;br /&gt;
}}&amp;lt;/ref&amp;gt; is a decentralized, goosip-based trust and reputation system to secure Phoenix and other matrix factorization-based NC systems.&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Vivaldi coordinates]]&lt;br /&gt;
* [[Pharos Network Coordinates]]&lt;br /&gt;
* [[Global network positioning]]&lt;br /&gt;
* [http://www.cs.duke.edu/~ychen/Project_Phoenix.html An open source simulator of Phoenix]&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
{{Reflist}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Computer networking]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{compu-network-stub}}&lt;/div&gt;</summary>
		<author><name>en&gt;Headbomb</name></author>
	</entry>
</feed>