⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 node72.html

📁 相关搜索: ns2仿真结果分析 all-awk ns2 ns2 无限网络中awk文件 ... [2.tcl.rar] - 在ns2平台上实现对AODV协议的模拟
💻 HTML
字号:
<html><!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN"><!--Converted with jLaTeX2HTML 2002 (1.62) JA patch-1.4patched version by:  Kenshi Muto, Debian Project.LaTeX2HTML 2002 (1.62),original version by:  Nikos Drakos, CBLU, University of Leeds* revised and updated by:  Marcus Hennecke, Ross Moore, Herb Swan* with significant contributions from:  Jens Lippmann, Marek Rouchal, Martin Wilck and others --><HTML><HEAD><TITLE>7.5.1 The JoBS algorithm</TITLE><META NAME="description" CONTENT="7.5.1 The JoBS algorithm"><META NAME="keywords" CONTENT="everything"><META NAME="resource-type" CONTENT="document"><META NAME="distribution" CONTENT="global"><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1"><META NAME="Generator" CONTENT="jLaTeX2HTML v2002 JA patch-1.4"><META HTTP-EQUIV="Content-Style-Type" CONTENT="text/css"><LINK REL="STYLESHEET" HREF="everything.css" tppabs="http://www.isi.edu/nsnam/ns/doc/everything.css"><LINK REL="next" HREF="node75.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node75.html"><LINK REL="previous" HREF="node71.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node71.html"><LINK REL="up" HREF="node71.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node71.html"><LINK REL="next" HREF="node73.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node73.html"></HEAD><BODY ><!--Navigation Panel--><A NAME="tex2html2432"  HREF="node73.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node73.html"><IMG WIDTH="37" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="next" SRC="file:/usr/share/latex2html/icons/next.png"></A> <A NAME="tex2html2426"  HREF="node71.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node71.html"><IMG WIDTH="26" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="up" SRC="file:/usr/share/latex2html/icons/up.png"></A> <A NAME="tex2html2420"  HREF="node71.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node71.html"><IMG WIDTH="63" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="previous" SRC="file:/usr/share/latex2html/icons/prev.png"></A> <A NAME="tex2html2428"  HREF="node1.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node1.html"><IMG WIDTH="65" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="contents" SRC="file:/usr/share/latex2html/icons/contents.png"></A> <A NAME="tex2html2430"  HREF="node590.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node590.html"><IMG WIDTH="43" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="index" SRC="file:/usr/share/latex2html/icons/index.png"></A> <BR><B> Next:</B> <A NAME="tex2html2433"  HREF="node73.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node73.html">7.5.1.1 Objective</A><B> Up:</B> <A NAME="tex2html2427"  HREF="node71.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node71.html">7.5 Queue/JoBS</A><B> Previous:</B> <A NAME="tex2html2421"  HREF="node71.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node71.html">7.5 Queue/JoBS</A> &nbsp <B>  <A NAME="tex2html2429"  HREF="node1.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node1.html">Contents</A></B>  &nbsp <B>  <A NAME="tex2html2431"  HREF="node590.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node590.html">Index</A></B> <BR><BR><!--End of Navigation Panel--><H2><A NAME="SECTION03451000000000000000">7.5.1 The JoBS algorithm</A></H2>This section gives an overview of the objectives the JoBS algorithmaims at achieving, and of the mechanisms employed to reach theseobjectives. The original JoBS algorithm, as described in[<A HREF="node589.html#LiCh01" tppabs="http://www.isi.edu/nsnam/ns/doc/node589.html#LiCh01">21</A>], was using the solution to a non-linear optimizationproblem. This <EM>ns-2</EM> implementation uses the feedback-controlbased heuristic described in [<A HREF="node589.html#ChLiAb02a" tppabs="http://www.isi.edu/nsnam/ns/doc/node589.html#ChLiAb02a">10</A>].<P><EM>Important Note:</EM> This <EM>ns-2</EM> implementation results from the merge between old code for <EM>ns-2.1b5</EM>, and code derived from the BSD kernel-level implementation of the JoBS algorithm. <B>It is still considered experimental.</B>Due to the absence of binding facilities for arrays between Tcl and C++ in <EM>tclcl</EM> at the moment, <EM>the number of traffic classes is statically set to 4 and cannot be changed without modifying the C++ code.</EM><P><BR><HR><!--Table of Child-Links--><A NAME="CHILD_LINKS"><STRONG>Subsections</STRONG></A><UL><LI><A NAME="tex2html2434"  HREF="node73.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node73.html">7.5.1.1 Objective</A><LI><A NAME="tex2html2435"  HREF="node74.html" tppabs="http://www.isi.edu/nsnam/ns/doc/node74.html">7.5.1.2 Mechanisms</A></UL><!--End of Table of Child-Links--><BR><HR><ADDRESS>2003-09-23</ADDRESS></BODY></HTML>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -