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.
Multicast is a communication model in which a message is sent from a source to an arbitrary number of distinct destinations. Two main parameters that are used to evaluate multicast routing are the time it takes to deliver the message to all destinations and the traffic, i.e., the total number of links involved in the multicast process. It has been proved that finding an optimal multicast solution...
In this paper the problem of broadcasting in networks with weighted nodes is considered. This model is defined on networks in which nodes are assigned some weights representing the internal process or delay that they should perform before sending data to their neighboring nodes. This model has real world applications in parallel computation and satellite terrestrial networks. The problem is shown...
Triple loop networks (graphs) are generalizations of the ring topology where every vertex v is linked to 6 vertices v a, v b, v c. In this paper, we study the broadcast problem in optimal triple loop graphs. In 1987 for a restricted case a = -(b + c) the (maximum) number of vertices in the sub- optimal Triple loop graph has been proved to be a quadratic function of diameter d. In 1998 the broadcast...
Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capacity reservation at certain survivability level. In this paper, we introduce two pre-planned path restoration algorithms for spare capacity design in mesh-like networks. First one is a spanning tree based algorithm, which needs less...
Performance of multicomputers largely depends on that of the underlying network communications such as multicast. Two major parameters used to evaluate multicast routing are the time it takes to deliver the message to all destinations and the traffic which refers to the total number of links involved. Mesh is a network topology widely used in multicomputers. It has been proved that, in mesh network,...
Double loop graphs are extensions of the ring topology which are obtained by regularly adding 2 extra edges per vertex. An optimal graph of diameter d has the maximum possible number of vertices. The optimal structure of double loop graphs, as well as the broadcast time and an optimal broadcast scheme are known. In this paper, we define the family of bipartite double loop graphs (BDLG) G = (V, E)...
In this paper, we introduce a new concept in fault-tolerance, namely the global fault-tolerance of interconnection networks. We pose the problem of characterizing the fault-tolerance of an interconnection network, modelled as an undirected unweighted graph, by a scalar, in a global manner. This can be achieved by defining an adequate metric. In this paper, we propose such a metric and we apply it...
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.