The dissertation proposes an adaptive route optimization method to resolve the problem . if length of the session 該方法根據(jù)用戶之間的會話長度來確定優(yōu)化策略。
The order - picking route optimization for carousel and fixed shelves can largely improve the efficiency of the automated warehouse 對其揀選路徑進行優(yōu)化能大大提高自動化倉庫的作業(yè)效率。
Communication model , in which the basic communication procedure is described , is the base of routes optimization for collective communication 通訊模型描述了通訊的基本過程,它是全局通訊優(yōu)化的基礎(chǔ)。
The routing optimization function made the ant movement path to pull straight , shorten , which made the availability of route choosing enhanced 運用路徑優(yōu)化功能,使螞蟻運動路徑拉直、變短,使路徑可用性增強。
We study the costs of the mobile ip and mobile ip with route optimization handoff that occurs when a mobile host moves between all - ip cells 結(jié)合下一代全ip蜂窩網(wǎng)絡(luò)結(jié)構(gòu),研究了移動路由協(xié)議及其路由優(yōu)化協(xié)議的切換性能。
After consideration of owlan system structure , owmip includes smooth handover , route optimization , buffer storage management , and secure authentication Owmip協(xié)議根據(jù)owlan的體系結(jié)構(gòu),引入平滑切換、緩存管理、路由優(yōu)化和安全認證的思想。
Considering this situation , a novel mobile architecture is introduced , and accordingly the registration delay performance is improved , mobility management and route optimization have been analyzed in this paper 本文利用改進后的移動ip網(wǎng)絡(luò)結(jié)構(gòu),對其中的注冊性能、移動管理、路由優(yōu)化進行了深入的分析。
Firstly , this paper analyzes two of existing techniques of routing optimization in mobile ip , which are romipv4 and mipv6 . subsequently , their performance is analyzed and compared with each other through simulation 論文首先分析了兩種移動ip路由優(yōu)化技術(shù)? ? romipv4和mipv6 ,并通過仿真對其性能進行分析和比較。
In chapter 3 , using opnet , the network nodes models such as fa , ha , gfa , mn and cn are constructed . in order to realize route optimization , the corresponding module is developed 第三章根據(jù)以上的理論及策略,運用opnet仿真軟件,構(gòu)建出ha , fa , gfa , mn ,以及cn等網(wǎng)絡(luò)節(jié)點模型和提供路由優(yōu)化的節(jié)點級模塊模型。
The objective of multicast routing optimization is to minimize the network cost with delay constrained . finding a multicast routing tree with minimized network cost is known to be an np - complete problem in the most general case 組播路由優(yōu)化的目標是在滿足時延約束的條件下網(wǎng)絡(luò)代價最小化,在一般的情況下,這是一個np完全問題。