Record ID | ia:simulationforsma00lema |
Source | Internet Archive |
Download MARC XML | https://archive.org/download/simulationforsma00lema/simulationforsma00lema_marc.xml |
Download MARC binary | https://www.archive.org/download/simulationforsma00lema/simulationforsma00lema_meta.mrc |
LEADER: 02525cam 2200325Ma 4500
001 ocn640492864
003 OCoLC
005 20120509140840.0
008 980209s1997 cau bm f000 0 eng d
040 $aAD#$beng$cAD#$dOCLCQ
035 $a(OCoLC)640492864
037 $aADA333481
050 14 $aL485
100 1 $aLemanski, Michael J.
245 10 $aSimulation for Smartnet scheduling of asynchronous transfer mode virtual channels /$cMichael J. Lemanski and Jesse C. Benton.
260 $aMonterey, Calif. :$bNaval Postgraduate School ;$aSpringfield, Va. :$bAvailable from National Technical Information Service,$c1997.
300 $axviii, 276 p. ;$c28 cm.
500 $aThesis advisor, Debra A. Hensgen.
502 $aThesis (M.S. in Computer Science)--Naval Postgraduate School, June 1997.
504 $aIncludes bibliographical references (p. 267-268).
520 $aCritical to the success of all future battlefield commanders is the rapid retrieval of relevant, time sensitive information. Some of this information will be available locally while the remainder is stored in the United States. DARPA's Battlefield Awareness and Data Dissemination (BADD) program attempts to deliver heterogeneous data to the battlefield using Asynchronous Transfer Mode (ATM) protocol. ATM was originally designed to implement dynamic virtual channels over duplex, high-speed, high capacity fiber optic cabling. The problem addressed was to determine which algorithm best schedules calls on BADD's ATM network that uses static virtual channels over simplex, error prone, long delay, satellite links. Because the BADD project uses ATM in such an unusual way, and because of the need to determine a schedule for transmissions over the heterogeneous static channels, we modeled BADD using the state-of-the-art network simulation tool, Optimized Network Engineering Tools (OPNET). We determined several modifications that must be made to existing network simulators to allow them to model next-generation networks. Our simulation shows that a greedy algorithm yields a 53% decrease in the overall completion time and a 46% increase in average bit throughput over FIFO scheduling.
530 $aAlso available online.
538 $aSystem requirements: Adobe Acrobat reader.
650 4 $aCOMPUTER COMMUNICATIONS.
650 4 $aDATA LINKS.
650 4 $aASYNCHRONOUS TRANSFER MODE.
700 1 $aBenton, Jesse C.
856 41 $uhttp://handle.dtic.mil/100.2/ADA333481
994 $aZ0$bPMR
948 $hNO HOLDINGS IN PMR - 1 OTHER HOLDINGS