The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
With the Internet of Things (IoT) becoming a major component of our daily life, understanding how to improve quality of service (QoS) in IoT networks is becoming a challenging problem. Currently most interaction between the IoT devices and the supporting back-end servers is done through large scale cloud data centers. However, with the exponential growth of IoT devices and the amount of data they...
This paper discusses an election problem of multiple leaders in a network divided into clusters which specifically takes a form of ring structures or cycles. The objective function is defined by considering a positional relation between adjacent leaders aiming at the reduction of communication latency in a distributed network control. We propose several heuristic approaches which can be adopted to...
This paper discusses a composition problem of a resilient tree on a graph modeling a communication network whose links are intermittent. The resiliency of a tree is defined exploiting the binary relation on two kinds of edge weights: availability and commonality. Availability represents a probabilistic stability of a communication link corresponding to an edge, and commonality indicates the influence...
This paper proposes an algorithm to determine a controller location on a given network considering burdens of all communication nodes. The burden is defined by extending stress centrality, which indicates a load of each node based on the number of edge disjoint paths. In order to analyze characteristics of the proposed placement algorithm, our simulations compare it with other placement algorithms...
This paper proposes a distributed algorithm that aims for congestion control in Software Defined Networking with distributed controllers by exploiting loop structures in a network and coloring. Our algorithm dissects a network into loop units called tie-sets and updates flows on edges by enclosed calculation in each controller, which is in charge of one of loop units. Additionally, the deployment...
For communications networks, reliability is a crucial problem to provide stable services. Hence, this paper defines Maximum Availability Tree (MAT) problem that aims at composing the most reliable tree network in terms of terminal reliability. Our work indicates that MAT problem is converted to Minimum Diameter Spanning Tree (MDST) problem by modeling a network with a probabilistic graph whose edges...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.