Abdul Waheed Mahesar

Two-mode complex network modeling of dengue epidemic in Selangor, Malaysia

There are many examples of complex systems in the world. These systems are very difficult to analyze due to huge number of interacting elements and complex interaction patterns between the elements. These systems can be properly analyzed by converting them into complex networks, where nodes can represent elements of the systems and links depicts the interaction patterns between these elements. Recently, many dengue fever cases are reported in Malaysia which shows the exponential increase of this fever in the country. In this paper we have formalized the dataset of dengue fever cases in Malaysia into two-mode complex network to analyze its impact on the localities. By applying network analysis metrics this research has revealed that few locations have high impact of dengue and they should be treated as critical to minimize the overall impact of spreading.

Calculus and its applications in scale-free networks

The purpose of this article is to highlight and emphasize the applications of calculus in scale-free networks, which have been found as property of many complex networks. There are many different types of real and manmade complex networks in various domain of life ranging from technological, social, biological, transportation and ecological networks among many others. All these networks have shown many similar structural properties in their formation and functions. This article focuses on the most prevalence type of networks known as Scale-Free Networks (SFN). These types of networks have two basic properties: growth and preferential node attachment. In this paper, we analyze and discuss the importance and usage of calculus in understanding the formation of these type of networks, as these networks continuously change their topology by inclusion of new nodes and links as they evolve. Further, as the calculus is the mathematical study of change therefore the applications of calculus in evolution process of complex networks with fitness model have been explained analytically based on fit-get-rich phenomenon in the complex networks as compared to simple BA1 model which is based, only on the consideration of number of nodes linkages in the networks.

Dynamic object replica placement using underlying routing protocols: Ensuring the reliability

Object replication is an unavoidable phenomenon in distributed systems to address the issues of size, administrative and resources scalability. It also guarantees the availability of system as more users can be accommodated and failures can be tolerated. If the location of object replica is not proper, the problem may arise when it is requested by many entities at once. The response time may also increase due to the network latency although network is considered to be steadfast in the distributed systems but the latency can never be avoided. Efficient replica placement, both client initiated and server initiated, can be ensured using the dynamic replica placement mechanism in conjunction with the underlying routing protocols that provides the reliability of contents distribution and minimizes the network latency. In this paper, it is discussed that reliability can be assured if we use replica placement algorithm along with the EIGRP (Enhanced Interior Gateway Routing Protocol). The issues of choosing the best path for placing the replica that provides the minimum latency and reliability of contents transmission can be overcome by combining the EIGRP features that includes internetwork delay, bandwidth consumption, reliability of packet transmission and traffic load, with dynamic replica placement algorithm.