<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
	<front>
		<journal-meta>
			<journal-id journal-id-type="publisher-id">INFORMATICA</journal-id>
			<journal-title-group>
				<journal-title>Informatica</journal-title>
			</journal-title-group>
			<issn pub-type="epub">0868-4952</issn>
			<issn pub-type="ppub">0868-4952</issn>
			<publisher>
				<publisher-name>VU</publisher-name>
			</publisher>
		</journal-meta>
		<article-meta>
			<article-id pub-id-type="publisher-id">inf17307</article-id>
			<article-id pub-id-type="doi">10.15388/Informatica.2006.146</article-id>
			<article-categories>
				<subj-group subj-group-type="heading">
					<subject>Research article</subject>
				</subj-group>
			</article-categories>
			<title-group>
				<article-title>An Agent-Based Best Effort Routing Technique for Load Balancing<xref ref-type="fn" rid="fn1">
						<sup>✩</sup>
					</xref>
				</article-title>
			</title-group>
			<contrib-group>
				<contrib contrib-type="Author">
					<name>
						<surname>Manvi</surname>
						<given-names>Sunilkumar S.</given-names>
					</name>
					<email xlink:href="mailto:sunil@protocol.ece.iisc.ernet.in">sunil@protocol.ece.iisc.ernet.in</email>
					<xref ref-type="aff" rid="j_INFORMATICA_aff_000"/>
				</contrib>
				<contrib contrib-type="Author">
					<name>
						<surname>Venkataram</surname>
						<given-names>Pallapa</given-names>
					</name>
					<email xlink:href="mailto:pallapa@ece.iisc.ernet.in">pallapa@ece.iisc.ernet.in</email>
					<xref ref-type="aff" rid="j_INFORMATICA_aff_000"/>
				</contrib>
				<aff id="j_INFORMATICA_aff_000">Protocol Engineering and Technology (PET) UNIT, Electrical Communication Engineering Department, Indian Institute of Science, Bangalore-560012, India</aff>
			</contrib-group>
			<author-notes>
				<fn id="fn1">
					<label>
						<sup>✩</sup>
					</label><p>Presently working at Basaveshwar Engineering College, Bagalkot, India.</p>
				</fn>
			</author-notes>
			<pub-date pub-type="epub">
				<day>01</day>
				<month>01</month>
				<year>2006</year>
			</pub-date>
			<volume>17</volume>
			<issue>3</issue>
			<fpage>407</fpage>
			<lpage>426</lpage>
			<history>
				<date date-type="received">
					<day>01</day>
					<month>05</month>
					<year>2005</year>
				</date>
			</history>
			<abstract>
				<p>Several best effort schemes (next-hop routing) are used to transport the data in the Internet. Some of them do not perform flexible route computations to cope up with the network dynamics. With the recent trends in programmable networks, mobile agent technology seems to support more flexible, adaptable and distributed mechanism for routing. In this paper, we propose a Mobile Agent based Routing (MAR) scheme with the objectives similar to Routing Information Protocol (RIP). A comparative study of both the schemes (MAR and RIP) in terms of communication overheads, convergence time, network bandwidth utilization and average session delays is presented. The results demonstrate that the MAR scheme performs better than RIP. MAR has comparatively less communication overheads and convergence time and also offers more flexibility and adaptability as compared to RIP. In addition, this paper also presents a MAR based network load balancing.</p>
			</abstract>
			<kwd-group>
				<label>Keywords</label>
				<kwd>routing</kwd>
				<kwd>mobile agents</kwd>
				<kwd>RIP</kwd>
				<kwd>load balancing</kwd>
				<kwd>network convergence</kwd>
			</kwd-group>
		</article-meta>
	</front>
</article>