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.
Many-to-many multicast can be widely used in computer and communication networks supporting various continuous multi-media applications. This paper assumes each user is both a source and a receiver as well as a terminal in many-to-many multicasting. Under this assumption a many-to-many multicast tree appears as a terminal Steiner tree (TeST). This paper uses a heuristic idea of under a fixed TeST...
The tree decomposition of graphs is a fundamental algorithmic tool. It has been shown that difficult problems, such as some NP-complete ones, can be solved efficiently over classes of graphs of bounded tree-width. We consider in this paper the distributed construction of the tree decompositions of network topology graphs. We propose algorithms to distributively construct the tree-decomposition of...
In this paper, we develop an optimal scheme for conferencing (i.e. all-to-all communication), in communication networks. Our scheme uses the minimum sum rate. First we state a lower bound on sum rate and show how to achieve it on networks with tree topology. This result can be used on general networks considering the spanning tree which connects the conferencing nodes.
In this paper, we propose an algorithm to search the optimal cycle cover in graphs of small treewidth. Let G=(V, E) be a graph modeled by network with vertex set V and edge set E. Given a specified vertex set SVsubeV(G), a cycle cover is a cycle C of G such that every vertex in SV lies in cycle C. A cycle cover is called optimal if its cost is minimum. Cycle cover problem plays an important role in...
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging...
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.