Welcome![Sign In][Sign Up]
Location:
Search - complex network routing

Search list

[matlabrouting

Description: 在复杂网络中,求经典的无标度网络最短路径算法的matlab源程序非常的实用。-In complex networks, and the classical scale-free network shortest path algorithm matlab source code is very practical.
Platform: | Size: 1024 | Author: 王丹 | Hits:

[matlabrouting_R

Description: 复杂网络中,在BA网络中最经典的路由算法matlab源程序并,是学习复杂网络最基本的路由算法。-Complex network, in the BA network, the most classical routing algorithm matlab source code and is the most basic learning complex network routing algorithm.
Platform: | Size: 1024 | Author: 王丹 | Hits:

[Data structsfzwlktlj

Description: 复杂网络中最短K条路径问题的求解算法研究.pdf 求解路径问题的另一新颖的算法-Complex network of K shortest path algorithm to solve the problem. Pdf Routing Problem Solving another novel algorithm
Platform: | Size: 745472 | Author: jzw | Hits:

[Internet-NetworkRoute_Analytics_in_the_NOC

Description: 加快网络运营问题诊断的路由分析 由网络操作中心面临的一项挑战的人员,负责大型,复杂的IP网络定位网络问题影响应用性能或可用性。-Network operators to accelerate problem diagnosis routing analysis by the network operations center to face the challenges of a staff, is responsible for large, complex IP networks targeting network problems affecting application performance or availability.
Platform: | Size: 1033216 | Author: 黄星 | Hits:

[matlabCN

Description: we make simulation about the complex network routing based on different situations
Platform: | Size: 343040 | Author: nana | Hits:

[matlabRoutingCN_PferentialProb

Description: complex network routing based on the preferential probability as the scale-free features
Platform: | Size: 259072 | Author: nana | Hits:

[matlabRoutingCN_QueueLenght

Description: complex network routing based on the lenght of queue of each node
Platform: | Size: 258048 | Author: nana | Hits:

[matlabRoutingCN_WaitingTime

Description: complex network routing based on the average waiting time of each node
Platform: | Size: 540672 | Author: nana | Hits:

[Mathimatics-Numerical algorithmsant_colony_algol_0609

Description: Among other complex problems, Ant Colony optimizers can be used to simulate routing problems when network topologies change over time. Andrew is Fixed Income Research Director for the StatPro Group plc in the United Kingdom and adjunct professor in the School of Business, Queensland University of Technology, Brisbane. He can be contacted at andrew.colin@statpro.com
Platform: | Size: 64512 | Author: helloword | Hits:

[Program docWireless-Mesh-Network-Planning-and-Optimization-t

Description: Wireless Mesh Networks (WMNs) are a promising technology for providing broadband wireless access to the end user. They offer a higher degree of flexibility compared to traditional networks but on the expense of a more complex structure. Thus, planning and optimization of WMNs is a challenge. In this paper, we address this challenge using genetic algorithms. Genetic algorithms are able to evaluate and optimize large-scale WMNs in relatively small computation time. The results prove the effectiveness of the genetic operators to optimize the routing and channel assignment in WMNs.
Platform: | Size: 212992 | Author: SALAH | Hits:

[OtherOSPF-Routing-Protocol

Description: In this article w ill learn about the OSPF Routing Protocol Open-Shortest-Path-First (OSPF) is the most widely used interior gateway protocol routing protocol on the world because it is a public (non-proprietary) routing protocol while its biggest rival, EIGRP, is a Cisco proprietary protocol so other vendors can’t use it. OSPF is a complex link-state routing protocol. Link-state routing protocols generate routing updates only when a change occurs in the network topology. When a link changes state, the device that detected the change creates a link-state advertisement (LSA) concerning that link and sends to all neighboring devices using a special multicast address. Each routing device takes a copy of the LSA, updates its link-state database (LSDB), and forwards the LSA to all neighboring devices -In this article we will learn about the OSPF Routing Protocol Open-Shortest-Path-First (OSPF) is the most widely used interior gateway protocol routing protocol on the world because it is a public (non-proprietary) routing protocol while its biggest rival, EIGRP, is a Cisco proprietary protocol so other vendors can’t use it. OSPF is a complex link-state routing protocol. Link-state routing protocols generate routing updates only when a change occurs in the network topology. When a link changes state, the device that detected the change creates a link-state advertisement (LSA) concerning that link and sends to all neighboring devices using a special multicast address. Each routing device takes a copy of the LSA, updates its link-state database (LSDB), and forwards the LSA to all neighboring devices
Platform: | Size: 269312 | Author: osama | Hits:

[Documents05273886.pdf

Description: Producing the quality of service in wireless network is a complex subject because of constraints related to the ad hoc mode as limited bandwidth, sharing medium...etc. The traditional routing based on hop count metric doesn’t take in its consideration the quality of the wireless link which causes the rate reduction in the network. In an effort to improve the performance of Mobile Ad hoc Network (MANET), cross-layer technique is implemented. It aimed to resolve QOS problems in manet and permit to share information about network status between different layers.
Platform: | Size: 230400 | Author: NIRDESH | Hits:

CodeBus www.codebus.net