In this article, two static routing algorithms have been proposed and compared to some of the existing algorithms on the basis of blocking probability. The two proposed static routing and wavelength assignment algorithms reduce the blocking probability to maximize the utilization of the network. All ...
The disadvantage of static routes is that they require subsequent maintenance as they cannot automatically adapt to network topology changes. Dynamic routing protocols have routing algorithms. Therefore, dynamic routes can automatically adapt to network topology changes and apply to networks on which Layer...
servers use algorithms to determine the next location (the next hop) where a message should be forwarded. With static routing, message paths are predetermined by system administrators. When a message is received by a server, the server checks the message address and then forwards the message to...
A static route in Windows is a manually configured network path that explicitly defines how data packets should travel from a source to a destination through the network. It’s an administrator-defined entry in the Windows routing table that specifies the exact path a packet must take, bypassing...
Routing algorithms on static interconnection networks: A classification scheme One of the important factors that governs the performance of a parallel computer system is the algorithm that determines the routing of messages in the interconnection network. There have been a number of routing algorithms pr...
2019). A well-known performance measure to detect such community structure is network modularity (Fortunato 2010). One of the most used algorithms to evaluate modularity, which is an NP-complete problem (Brandes et al. 2006; Leeuwen et al. 2019), is the Louvain algorithm which allows the ...
efficient multimedia services when routing, coding, and scheduling algorithms are able to adapt to both the media information and the dynamic network status... P Frossard,JC De Martin,M Reha Civanlar - 《Proceedings of the IEEE》 被引量: 142发表: 2007年 动态蚁群算法在带时间窗车辆路径问题中的...
For both single-source and multiple-source queries, the routing stage is preceded by preprocessing stages requiring O(nD) and O(n2D) transmissions, respectively, where D is the diameter of the network. Our algorithm improves the complexity of the currently best known algorithms in terms of the...
improvement on leach-c protocol for wireless sensor network * Energy efficiency and lifetime are two vital issues in the research of WSN. The Low-Energy Adaptive Clustering Hierarchy(LEACH) and Low-Energy Adaptive Clustering Hierarchy-centralized(LEACH-C) are classical algorithms where sensor nodes....
There exist only a few studies that use the non-cooperative approach for load balancing in distributed systems. Kameda et al. [22] derived load balancing algorithms for single and multi-class jobs using non-cooperative games based on Wardrop equilibrium. In this case each of the infinitely many...