A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Filters
Routing in sparse splitting optical networks with multicast traffic
2003
Computer Networks
Preserved Fulltext
Given a network topology with the multicast capable nodes distributed uniformly throughout the network, and a multicast session, the MR-SSN problem is to find a route from the source node of the multicast ...
network with 30% of multicast capable cross-connects has an acceptable low cost and relatively good performance. (4) The improvement achieved by TS heuristic increases considerably when the session size ...
(c) A rerouting with a smaller average delay than in (b).
Fig. 9 ( 9 b), the branch with less children is rerouted first, causing a lower average delay of 4.3 ðð1 þ 6 þ 6Þ=3 ¼ 4:3Þ. ...
doi:10.1016/s1389-1286(02)00345-6
fatcat:igfwnm7vtbbodbqgno66rkvzqu
A Two-Layered Shared Tree Multicast Routing Algorithm for Software Defined Hybrid Satellite-Terrestrial Communication Networks
2021
Frontiers in Communications and Networks
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.
The simulation shows TSTM decreases rerouting cost, user time delay, and node congestion ratio compared with the locality-aware multicast approach (LAMA). ...
This algorithm balances the rerouting frequencies of satellite and terrestrial networks to decrease the rerouting overheads and also reduces the network congestion ratio. ...
The simulation shows TSTM decreases rerouting cost, user time delay, and node congestion ratio compared with the locality-aware multicast approach (LAMA). ...
doi:10.3389/frcmn.2021.731992
fatcat:gjtjq22jrbbttdjlzygch3nv44
Avoidance of multicast incapable branching nodes for multicast routing in WDM networks
2008
2008 33rd IEEE Conference on Local Computer Networks (LCN)
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.
the shortest path based multicast tree and maintains good parts of the shortest path tree to reduce the end-to-end delay. ...
Although many multicast routing algorithms have been proposed in order to reduce the total cost in WDM optical networks, the link stress and delay are two parameters which are not always taken into consideration ...
It is obvious that the average delay of the Reroute-to-Source is minimal. ...
doi:10.1109/lcn.2008.4664188
dblp:conf/lcn/ZhouMC08
fatcat:crs5kgqnpbbz3hwnhrhxwmv7by
Avoidance of multicast incapable branching nodes for multicast routing in WDM networks
2009
Photonic network 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 2013; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Good parts of the shortest-path-tree are retained by the algorithm to reduce the end-to-end delay. ...
Extensive simulations demonstrate the algorithm's efficiency in terms of link stress and end-to-end delay. ...
It is obvious that the end-to-end delay of Reroute-to-Source is minimal. ...
doi:10.1007/s11107-009-0200-3
fatcat:t6cuabmchvecxij4u4dsxlftt4
Joint multicast routing and network design optimisation for networks-on-chip
2009
IET Computers & Digital Techniques
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.
We formulate the joint multicast routing and network design problem using a rip-up and reroute procedure, where each multicast routing step is formulated as a minimum directed spanning tree problem, and ...
Our new formulation adopts a rip-up and reroute concept that provides us with a heuristic iterative mechanism to identify increasingly improving solutions. ...
Thus our multicast benchmarks cover a large range of applications with mixed unicast/multicast flows and varying hop count and data rate distributions. ...
doi:10.1049/iet-cdt.2008.0095
fatcat:vawn6hzvfbfvpgp3qg5ldb4cci
Optimization of wavelength assignment for QoS multicast in WDM networks
2001
IEEE Transactions on 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 2009; you can also visit the original URL.
The file type is application/pdf.
This paper discusses quality-of-service (QoS) multicast in wavelength-division multiplexing (WDM) networks. ...
Given a set of QoS multicast requests, we are to find a set of cost suboptimal QoS routing trees and assign wavelengths to them. The objective is to minimize the number of wavelengths in the system. ...
ACKNOWLEDGMENT The authors would like to thank the anonymous referees for their valuable and constructive comments, which helped greatly in improving the quality and presentation of this paper. ...
doi:10.1109/26.905896
fatcat:mtd74nbw3rgebaef4npizo6zz4
An overview of quality of service routing for next-generation high-speed networks: problems and solutions
1998
IEEE Network
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.
The delay constraint of a multicast connection requires that the longest end-to-end delay from the sender to any receiver in the tree must not exceed an upper bound. ...
Many unicast/multicast QoS routing algorithms have been published recently, and they work with a variety of QoS requirements and resource constraints. ...
Algorithms were derived from the framework to route connections with a variety of QoS constraints on bandwidth, delay, delay jitter, cost, and their combinations. ...
doi:10.1109/65.752646
fatcat:pfbc3vc6ozhcni4tnkkve2fk2e
A fast rerouting scheme using reservation in wireless ATM
2003
IEEE Transactions on Vehicular 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 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents an analysis of the proposed scheme and simulation results of several handoff schemes compared with the proposed scheme. ...
Efficient usage of network resources is also required. In this paper, we propose a fast rerouting scheme for wireless ATM referred to as a path reservation scheme. ...
Multicast Base Rerouting Multicast base rerouting [7] exploits ATM multicasting. ...
doi:10.1109/tvt.2002.807134
fatcat:umf2yy32xjaannos4ijutns7f4
Cognitive multicast routing with QOS constraints for multimedia applications in integrated Satellite- HAP system structures
2010
2010 3rd International Conference on Computer Science and Information 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 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents the issue of capacity variable routing in Satellite-HAP system networks with multicasting capabilities, for different traffic types, with the objective of minimizing the short term ...
Some of the major QOS constraints (Delay and link Utilization) have been taken into account to meet the criteria of the advance multimedia applications. ...
In order to develop a multi-objective QoS multicast routing model, we determine multicast routes satisfying the major constraints of "End-to-end" delay and Bandwidth utilization. ...
doi:10.1109/iccsit.2010.5563831
fatcat:3rf4imywcvd5pdtknbixqadgsq
Dynamic multicast routing under delay constraints in WDM networks with heterogeneous light splitting capabilities
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 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a new dynamic multicast routing problem under delay constraints (DMR-DC) for finding an optimal light-forest with the minimum multicast cost from these links with available wavelengths ...
for routing a multicast request that arrives in random with a given delay bound in a WDM network with heterogeneous light splitting capabilities, where a light-forest is a set of lighttrees used to set ...
Acknowledgements The authors are grateful to the Editor and the anonymous referees for their constructive comments that have improved the presentation of an earlier version of this paper. ...
doi:10.1016/j.comcom.2005.09.004
fatcat:5kfobdscavbu3orc4smxrw4fxu
A QoS-based routing algorithm for PNNI ATM networks
2002
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.
Network throughput is also improved by evenly distributing the traffic among several eligible paths. Multicast routing extensions to BHRA are also presented. ...
It consists of three components: (1) a path selection algorithm, (2) a rerouting mechanism, and (3) multi-class routing. ...
Connection Setup Time It is well known that computing general routes with multiple constraints is an NP-hard problem [16] . ...
doi:10.1016/s0140-3664(01)00392-9
fatcat:2k5kos2qqrdq7ivsfhejayhc7y
Analysis Study of Path Rerouting And Handover Schemes for WATM/LEO Satellite Networks
2006
The International Conference on Electrical 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 2020; you can also visit the original URL.
The file type is application/pdf.
The analysis of this case study creates a new vision for design implementation aspects, which improve the delay and QOS performance of the rerouting and handoff methods used in integrated WATM /LEO satellite ...
The objective of this paper is to analyze the different algorithms of connection rerouting and handoff schemes used in wireless ATM networks and LEO satellite networks. ...
(b) For services with delay guarantee, when a broad class of WFQ-like scheduling algorithms are used, the bandwidth, delay, jitter and/or buffer space constraints is solvable in polynomial time only if ...
doi:10.21608/iceeng.2006.33533
fatcat:ob6erfrehjafdej3ri2cixz6ey
Distance priority based multicast routing in WDM networks considering sparse light splitting
[article]
2009
arXiv
pre-print
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.
Other Versions
2008
2008 11th IEEE Singapore International Conference on Communication Systems
unpublished
doi:10.1109/iccs.2008.4737278 fatcat:rlkpsfunjzblfamzroxax4sffu
doi:10.1109/iccs.2008.4737278 fatcat:rlkpsfunjzblfamzroxax4sffu
As we know, the member-only algorithm in provides the best links stress and wavelength usage for the construction of multicast light-trees in WDM networks with sparse splitting. ...
Simulations show the proposed algorithm is able to greatly reduce the diameter and average delay of the multicast tree (up to 51% and 50% respectively), while keep the same or get a slightly better link ...
The members of a multicast session and the MC nodes in the networks are assumed to be uniformly distributed. ...
arXiv:0908.1471v1
fatcat:c4vfn7zzljbc3m5bwr6d5ns3yq
Scaling IP multicast on datacenter topologies
2013
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies - CoNEXT '13
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 2015; you can also visit the original URL.
The file type is application/pdf.
Unfortunately, traditional protocols for managing IP multicast, designed for arbitrary network topologies, do not scale with aggregate hardware resources in the number of supported multicast groups. ...
For example, experiments show that a datacenter with 27,648 servers and commodity switches with 1000-entry multicast tables can support up to 100,000 multicast groups, allowing each server to subscribe ...
However, with fast failover to local rerouting, we can allow some reasonable delay until multicast tree reconstruction, and thus lessen the computational burden on network controllers. ...
doi:10.1145/2535372.2535380
dblp:conf/conext/LiF13
fatcat:zknalnzfdbbhvcbkkfyfkgkaiq
MCoRe: an adaptive scheme for rerouting multicast connections in mobile ATM networks
2002
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.
With MCoRe, source migration is transparent to the multicast group members and does not entail reconstruction of existing multicast tree. ...
In this paper we propose multicast connection rerouting (MCoRe), a novel scheme for ef®cient multicasting in mobile asynchronous transfer mode (ATM) networks. ...
There are two main disadvantages with path extension: increased end-to-end delay and likely formation of loops. The problem of end-to-end delay will be addressed in the next section. ...
doi:10.1016/s0140-3664(01)00336-x
fatcat:aaksqgiwlbfphesex3jyeutjri
« Previous
Showing results 1 — 15 out of 935 results