A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
An Efficient Algorithm For Delay Delay-Variation Bounded Least Cost Multicast Routing
2009
Zenodo
Preserved Fulltext
In this paper, we propose an efficient heuristic algorithm, namely, Economic Delay and Delay-Variation Bounded Multicast (EDVBM) algorithm, based on a novel heuristic function, to construct an economic ...
This is related to multicast delayvariation problem. The problem to find a minimum cost multicast tree with delay and delay-variation constraints has been proven to be NP-Complete. ...
Another efficient heuristic algorithm called DDVCA (Delay and Delay Variation Constraint Algorithm) for delay and delay-variation bounded tree problem has been proposed in [15] . ...
doi:10.5281/zenodo.1080689
fatcat:6ls53bhpxvaf3bcpjjnwzvwt3u
QoS-constrained core selection for group communication
2007
Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Hassanein, Extended QoS-framework for Delay-constrained Group Communication, International Journal of Communication Systems, in press.], we showed that the constrained cost minimization solutions in core-based ...
The core-based approach in multipoint communication enhances the solution space in terms of QoS-efficiency of solutions in interand intra-domain routing. In an earlier work [A. Karaman, H.S. ...
[23] also use this greedy algorithm for their k-center heuristics by parameterizing it with a constant k to specify the exact number of cores to be selected for a solution to k-center problem. ...
doi:10.1016/j.comcom.2007.01.011
fatcat:nvsnelfjrffgvhwh5u4642frhu
CNOP - A Package for Constrained Network Optimization
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a generic package for resource constrained network optimization problems. ...
We illustrate the flexibility and the use of our package by solving four applications: route planning, curve approximation, minimum cost reliability constrained spanning trees and the table layout problem ...
Introduction There are a large number of graph and network algorithms that can be efficiently solved in polynomial time, like the shortest path problem, minimum spanning tree problem or flow problems ...
doi:10.1007/3-540-44808-x_2
fatcat:okl72bsk5vhk7i4lruwflsl5qe
Performance of Video Conferencing using Protocol Independent Multicast Routing with Core failure
2012
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Core failure is a serious issue in multicast networks with the QOS diminishing even if alternative routes are available. ...
Video conferencing is now widely used both in wired and wireless network. Quality of Service (QoS) depends upon the efficient utilization of the network bandwidth. ...
The end to end delay of the network due to core failure for the system located in sub network of core 3 is shown in figure 2 . ...
doi:10.5120/5578-7685
fatcat:unam35zcsbdhnjwwxt32c7af3i
An Efficient Algorithm for Delay and Delay- Variation Bounded Core Based Tree Generation
2010
International journal of computer and communication technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose an efficient core selection algorithm for satisfying the end-to-end delay and delay-variation within an upper bound. ...
To support real time communication, computer networks need to optimize the Delay and Delay-Variation Bounded Multicast Tree (DVBMT). ...
CONCLUSIONS In this paper, we propose a novel core selection algorithm to generate a core based multicast tree for the DVBMT problem. ...
doi:10.47893/ijcct.2010.1045
fatcat:mqd2ig4l4rgchjii4356msr4zq
Optimization of Tree-like Core Overlay in Hybrid-structured Application-layer Multicast
2012
KSII Transactions on Internet and Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In our work, some nodes are selected as backbone nodes to construct a tree-like core overlay. ...
The complexity of the proposed algorithm is acceptable for application. Therefore the proposed approach is efficient for the topology optimization of a real multicast overlay. ...
Then the problem for topology optimization of a core overlay tree is described as max ( ) ( ) a kS R T r k (8) subject to max ( ) ( ), T d k d k k V (9)
The Proposed Optimization Algorithm ...
doi:10.3837/tiis.2012.12.005
fatcat:tx3dt4pfaravtpue2gkf2zf7h4
A Novel QoS Provisioning Algorithm for Optimal Multicast Routing in WMNs
2016
Future Internet
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The theoretical validations for the proposed algorithm are presented to show its performance and efficiency. After that, the random static networks with different destination nodes are evaluated. ...
Simulations in these networks show that the proposed algorithm can achieve the approximate optimal solution with the approximation factor of 2(1 + ε)(1´1/q) and the time complexity of O(qmn 2 τ K´1 ). ...
Szymanski presented a Constrained Multicast-Max-Flow-Min-Cost algorithm to maximize the throughput of a multicast tree using network coding, subjected to routing cost constraints [19] . ...
doi:10.3390/fi8030038
fatcat:fveae67zdrh7lfvtukpjpwxd54
Traffic Engineering and Manageability for Multicast Traffic in Hybrid SDN
2018
KSII Transactions on Internet and Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
, thus to build up a core-based multicast tree substantially which is first introduced in CBT. ...
However, migration to SDN cannot be achieved in one step, hybrid SDN emerges as a transitional networking form for ISP network. ...
In the second tree part , a number of K trees are calculated for each group to implement load balance in the network. ...
doi:10.3837/tiis.2018.06.004
fatcat:yfeomqqqrzem3eq52wfkxgv4eq
Routing and wavelength assignment for core-based tree in WDM networks
2006
Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources need to send data to a ...
For the minimum max-cost and the constrained feasibility problems, we prove their NP-completeness and propose two efficient heuristic algorithms. ...
Core-based tree has been extensively studied in conventional IP networks, such as those works done in [2, 7, 11] . ...
doi:10.1016/j.comcom.2005.10.023
fatcat:bpoofbnnwrgidbumscjpbwy7sq
Determining the Minimum Cost Steiner Tree for Delay Constrained Problems
2021
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We address a variant of the Steiner tree problem for delay constrained problems. ...
We propose a compact formulation based on integer linear programming (ILP) to obtain optimal solutions, which was efficiently solved on two telecommunication core networks up to 75 nodes. ...
In [16] , a distributed algorithm is proposed to find a minimum cost Steiner tree that is both delay constrained (in the sense of the BRSMT problem) and bandwidth constrained. ...
doi:10.1109/access.2021.3122024
fatcat:wptebhsifbfodo33adeg7z3h4i
New Strategies and Approaches for Efficient Overlay Multicast Routing
2012
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we introduce a new Delay-Variation Estimation Scheme and core selection strategies for multicast routing in leased overlay networks. ...
We proposed an algorithm, which defines an optimal balance tree to optimize a trade-off between delay and bandwidth consumption with constraints on both delay and delay variation. ...
Delay is a significant factor in collaborative applications in a leased overlay network and is taken as a constrained metric of the presented algorithm. ...
doi:10.1016/j.procs.2012.06.024
fatcat:7mq27bcin5hd3e5htypxuggd7y
Research on Cache Placement in ICN
[chapter]
2018
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Ubiquitous in-network caching is one of key features of Information Centric Network, together with receiver-drive content retrieval paradigm, Information Centric Network is better support for content distribution ...
This paper proposes a G-FMPH algorithm which takes into ac-count both constrains on the link bandwidth and the cache capacity of nodes. ...
The Palo Alto research centre has put forward a landmark ICN network architecture CCN in 2007, which aims to provide an efficient and extensible content access application pattern for solving the insuperable ...
doi:10.1007/978-3-319-73447-7_65
fatcat:ecfotexluja67fi5uvv6vd3ecq
Research on Cache Placement in ICN
2017
EAI Endorsed Transactions on Ambient Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Ubiquitous in-network caching is one of key features of Information Centric Network, together with receiver-drive content retrieval paradigm, Information Centric Network is better support for content distribution ...
This paper proposes a G-FMPH algorithm which takes into ac-count both constrains on the link bandwidth and the cache capacity of nodes. ...
The Palo Alto research centre has put forward a landmark ICN network architecture CCN in 2007, which aims to provide an efficient and extensible content access application pattern for solving the insuperable ...
doi:10.4108/eai.28-8-2017.153308
fatcat:kda325o3tzbe5otyg73o2f4m2i
A case for tree migration and integrated tree maintenance in QoS multicasting
2003
Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In this paper, we highlight the importance of tree migration as a mechanism for handling membership and network dynamics in core-based multicasting, prove that it is NP-Complete, and propose four heuristic ...
algorithms for it. ...
This is a classical Delay Constrained Least Cost Multicast Routing Problem. ...
doi:10.1016/s0140-3664(02)00195-0
fatcat:zuymq2e6uvelfidab5st3t3wxm
Multicast Routing Algorithms
[chapter]
1998
Multicasting on the Internet and its Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
In the protocol stack of the network, multicast is best implemented in the network layer in the form of a multicast routing protocol to select the best path for the transmission. ...
When more than one receiver is interested in receiving a transmission from a single or a set of senders, multicast is the most efficient and viable mechanism. ...
Full MBGP peering among the core vBNS Juniper m40 and Cisco routers (a multi-platform network) ensures shortest-path distribution trees across the vBNS backbone. ...
doi:10.1007/978-1-4615-5713-5_3
fatcat:5rbmvn72cbajhevxvgd5qhfgfq
« Previous
Showing results 1 — 15 out of 34,208 results