<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>رئیس دانشکده مهندسی برق و کامپیوتر</PublisherName>
				<JournalTitle>مجله مهندسی برق دانشگاه تبریز</JournalTitle>
				<Issn>2008-7799</Issn>
				<Volume>52</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2022</Year>
					<Month>12</Month>
					<Day>22</Day>
				</PubDate>
			</Journal>
<ArticleTitle>ESV-DBRA: An enhanced method for proportional distribution of the multitenant SDN traffic load</ArticleTitle>
<VernacularTitle>ESV-DBRA: An enhanced method for proportional distribution of the multitenant SDN traffic load</VernacularTitle>
			<FirstPage>269</FirstPage>
			<LastPage>280</LastPage>
			<ELocationID EIdType="pii">15801</ELocationID>
			
<ELocationID EIdType="doi">10.22034/tjee.2023.15801</ELocationID>
			
			<Language>FA</Language>
<AuthorList>
<Author>
					<FirstName>آرش</FirstName>
					<LastName>قربان نیا دلاور</LastName>
<Affiliation>Department of Computer Engineering and Information Technology, Payame Noor University (PNU), P.O. Box 19395-4697, Tehran, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>کیوان</FirstName>
					<LastName>بیگی</LastName>
<Affiliation>Department of Computer Engineering and Information Technology, Payame Noor University (PNU), P.O. Box 19395-4697, Tehran, Iran.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2022</Year>
					<Month>06</Month>
					<Day>20</Day>
				</PubDate>
			</History>
		<Abstract>One of the obvious reasons for most disorders in network service provisioning is network path congestion. Congestion avoidance in today&#039;s networks is too costly and sometimes impossible. With the introduction of SDN, centralizing the equipment&#039;s control plane has become possible. This paper presents an enhanced method named ESV-DBRA to avoid congestion in multi-tenant SDN networks. At first, ESV-DBRA monitors the traffic load and delay of all network paths for each tenant individually. Then, by merging the parameters obtained from the monitoring, the Service Level Agreements (SLA), and a novel proposed cost function, it calculates the cost of the network paths per tenant. As a result, traffic for each tenant is routed through the path/paths at the lowest possible cost from the tenant&#039;s perspective. Next, the bandwidth quotas will be calculated and assigned to the tenants over their optimal routes. Afterward, whenever congestion is likely to occur in a path, ESV-DBRA automatically changes the route or bandwidth of the tenants&#039; traffic related to this path to avoid congestion. Related algorithms are also proposed.&lt;br /&gt;Eventually, simulations show that the proposed method effectively increases bandwidth utilization by 10.76%.</Abstract>
			<OtherAbstract Language="FA">One of the obvious reasons for most disorders in network service provisioning is network path congestion. Congestion avoidance in today&#039;s networks is too costly and sometimes impossible. With the introduction of SDN, centralizing the equipment&#039;s control plane has become possible. This paper presents an enhanced method named ESV-DBRA to avoid congestion in multi-tenant SDN networks. At first, ESV-DBRA monitors the traffic load and delay of all network paths for each tenant individually. Then, by merging the parameters obtained from the monitoring, the Service Level Agreements (SLA), and a novel proposed cost function, it calculates the cost of the network paths per tenant. As a result, traffic for each tenant is routed through the path/paths at the lowest possible cost from the tenant&#039;s perspective. Next, the bandwidth quotas will be calculated and assigned to the tenants over their optimal routes. Afterward, whenever congestion is likely to occur in a path, ESV-DBRA automatically changes the route or bandwidth of the tenants&#039; traffic related to this path to avoid congestion. Related algorithms are also proposed.&lt;br /&gt;Eventually, simulations show that the proposed method effectively increases bandwidth utilization by 10.76%.</OtherAbstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Virtual tenant networks (VTN)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Software-Defined Networks (SDN)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">OpenFlow</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Dynamic bandwidth resource allocation (DBRA)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Congestion avoidance</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Path Cost Estimation</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://tjee.tabrizu.ac.ir/article_15801_281c5f8057fa93a21b2932a81cee77c3.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
