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.
Filters
Resource Allocation Using Multiple Edge-Sharing Multicast Trees
2008
IEEE Transactions on Vehicular Technology
Preserved Fulltext
This paper presents a distributed algorithm to construct multiple edge-sharing trees (MESTs) for small group multicast. ...
Index Terms-Fair resource allocation, minimum spanning tree (MST), mobile ad hoc networks (MANETs), multicast. ...
Edge-disjoint multicast trees use different edges in each tree. Therefore, they would do a better job in solving the resource allocation problem. ...
doi:10.1109/tvt.2007.913183
fatcat:e5i5xxwr6jh35ceedgv6t7j2vm
A unified approach for Multiple Multicast Tree Construction and Max-Min Fair rate allocation
2009
2009 International Conference on High Performance Switching and Routing
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, a unified approach for the Multiple Multicast Tree Construction and Rate Allocation (MMTCRA) problem is addressed. ...
Fair share of network resources, such as, bandwidth, is desirable in such cases. ...
We use the terms estimatedRate, actualRate, revisedRate to denote the allocated rate with the assumption of no edge sharing among the multicast trees, the actual allocated rate considering the shared edge ...
doi:10.1109/hpsr.2009.5307420
fatcat:d3nuf2otnrhglksng4pq3wf2em
Aggregated Multicast for Scalable QoS Multicast Provisioning
[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 2004; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose an approach to reduce multicast forwarding state and provision multicast with QoS guarantees. In our approach, multiple groups are forced to share a single delivery tree. ...
We then describe how to use our approach to provision scalable QoS multicast. ...
Our difference with previous approaches is that we force multiple multicast groups to share one distribution tree, which we call an aggregated tree. ...
doi:10.1007/3-540-45400-4_20
fatcat:roao5eimwndbtjdjfwph2mdp3i
Communication Channels for Data Multicasting in Multi-service Networks
[chapter]
1995
Computer Networks, Architecture and 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 2018; you can also visit the original URL.
The file type is application/pdf.
The paper generalizes the abstraction of tree structured communication channels used in wide-area data multicasting by introducing the notions of: i) acyclic graph structured channel to provide connectivity ...
The data rate may be mapped to resource demands on the network, viz., link bandwidth and node buffers, to transport data over the edges. ...
With use of a tree structured channel as the basic network level object to embody the data multicasting functions, the network needs to create multiple trees to support the application, where each tree ...
doi:10.1007/978-0-387-34887-2_8
fatcat:p2uhohhbxjd3pd376quve7mdza
Distributed Admission Control for Heterogeneous Multicast with Bandwidth Guarantees
[chapter]
2003
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 2004; you can also visit the original URL.
The file type is application/pdf.
We show that using our architecture, the requirements for both installing and maintaining the forwarding state in core routers, are similar to that in a best-effort multicast, thus, providing the QoS control ...
Since multicast serves as a natural framework for such applications, it is desirable to support quality of service (QoS) guarantees for multicast. ...
For ease of exposition, we assume a single source multicast session instead of one having multiple senders. ...
doi:10.1007/3-540-44884-5_7
fatcat:rqywcjk4vzeixi34tiz7n4wane
An exposed approach to reliable multicast in heterogeneous logistical networks
2003
CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.
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 offer an exposed approach to multicast that uses an underlying Logistical Networking infrastructure that makes possible the implementation of any of the current retransmission algorithms ...
These approaches include augmenting the primary multicast data channel with direct TCP connections or with secondary multicast channels for retransmissions, and on the possibility of retransmissions originating ...
To encourage the sharing of idle resources, IBP even supports "soft" storage allocation semantics, where allocated storage can be revoked at any time. ...
doi:10.1109/ccgrid.2003.1199410
dblp:conf/ccgrid/BeckDFK03
fatcat:r7ana3hceraedh4zj7vwa7fyza
Scalable Resource Provisioning for Multi-User Communications in Next Generation Networks
2008
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference
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 2011; you can also visit the original URL.
The file type is application/pdf.
Previous solutions for the control of multi-user sessions rely mostly on uncoordinated actions to allocate per-flow bandwidth and multicast trees. ...
This paper introduces a Multiuser Aggregated Resource Allocation mechanism (MARA) that coordinates the control of class-based bandwidth and multicast resources in a scalable manner. ...
The information about the edge-to-edge paths is used to setup the aggregated multicast trees. ...
doi:10.1109/glocom.2008.ecp.453
dblp:conf/globecom/NetoCCMM08
fatcat:pxgyb2juafb5pbffh25yesbk2e
Fast and Efficient Bulk Multicasting over Dedicated Inter-Datacenter Networks
[article]
2018
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.
Using multiple trees per transfer each connected to a subset of receivers alleviates this concern. The choice of multicast trees also determines the total bandwidth usage. ...
In this paper, we break this problem into the three sub-problems of partitioning, tree selection, and rate allocation. ...
Also, all schemes use the fair sharing rate allocation based on maxmin fairness except DCCast which uses the FCFS policy. The minimum edge Steiner tree leads to the minimum bandwidth consumption. ...
arXiv:1812.06553v1
fatcat:52omfass2zgsvbfdep52jwc4f4
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.
Resource Discovery, Data Collection, Auctions Address Range Uses 224.0.0.0 to 224.0.0.255 Administrative functions and system level routing chores (always sent with TTL of 1) 224.0.1.0 to 238.255.255.255 ...
The other layers of the protocol stack provide additional features for multicast. This paper deals with how multicasting is implemented in the Internet (IPv4). ...
The group information, namely the active sources, is shared among the various domains in the backbone using MSDP. MBGP is used for the sharing of the routing information across domains. ...
doi:10.1007/978-1-4615-5713-5_3
fatcat:5rbmvn72cbajhevxvgd5qhfgfq
Adaptive Multicast Tree Construction for Elastic Data Streams
2008
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference
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 2012; you can also visit the original URL.
The file type is application/pdf.
Our framework allows receivers to request multiple sessions from possibly different servers. Each receiver expresses a quality-of-service requirement using a utility function. ...
We present an iterative online multicast tree construction algorithm for multisession multicasting of elastic content. ...
Traffic Control In general, there are multiple multicast sessions sharing the network resource. ...
doi:10.1109/glocom.2008.ecp.103
dblp:conf/globecom/ZhuP08
fatcat:dpuytqa3frdmhoxtnd6i7qgonu
Scalable Multimedia Group Communications through the Over-Provisioning of Network Resources
[chapter]
2008
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 2018; you can also visit the original URL.
The file type is application/pdf.
Multicast aggregation is used to optimize multicast state storage. ...
Thus, MARA establishes multiple multi-user sessions without per-flow signalling by combining admission control and surplus network resources (bandwidth and SSM trees) procedures in advance. ...
The information about the edge-to-edge paths is used to setup the SSM aggregation trees. ...
doi:10.1007/978-3-540-87359-4_6
fatcat:thgjulnvhzfdti5cko254v7ucy
Multicast traffic aggregation in MPLS-based VPN networks
2007
IEEE Communications Magazine
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.
This sort of traffic engineering mechanism requires methods to estimate the resources needed to set up a multicast shared tree for a set of VPNs. ...
The methodology proposed in this article consists of studying the effect of aggregation obtained by random shared tree allocation on a reference model of a representative network scenario. ...
Today the allocation of a VPN to a shared tree is performed by hand by setting the same root for VPN multicast trees that hold many common leaves (PEs). ...
doi:10.1109/mcom.2007.4342827
fatcat:zsb4uiropfbx5jhs4q6olbnitm
A Resource Reservation Protocol Supporting QoS-aware Multicast Trees for Next Generation Networks
2007
Proceedings of the IEEE Symposium on Computers and 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 2011; you can also visit the original URL.
The file type is application/pdf.
This paper presents Multi-servIce Resource Allocation (MIRA), a multicast-aware resource reservation protocol for class-based networks that consider routing asymmetries. ...
However, QoS-aware multicast content deliver raises several problems, such as the control of QoS trees in environments with asymmetric routing. ...
In the Q3M context, MIRA controls the resources of multiple CoSs and IP multicast trees, being the resources of inter-network links controlled based on SLSs. ...
doi:10.1109/iscc.2007.4381528
dblp:conf/iscc/NetoCRMM07
fatcat:6yk6rmxvnre7fhhazjtcowfpfy
Deployment issues for the IP multicast service and architecture
2000
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.
IP multicast offers scalable point-to-multipoint delivery necessary for using group communication applications on the Internet. ...
However, the IP multicast service has seen slow commercial deployment by ISPs and carriers. ...
PIM-SM uses RPs so that applications with multiple low-rate sources can benefit from shared trees. ...
doi:10.1109/65.819174
fatcat:c656tjaggna7lnslkr6z3nscbe
On Efficient Data Transfers Across Geographically Dispersed Datacenters
[article]
2019
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.
Using coordinated data transmission from the services and routing over the inter-datacenter network, one can optimize the network performance according to a variety of utility functions that take into ...
Next, in the several chapters that follow, we study, in detail, the problems of admission control for transfers with deadlines and inter-datacenter multicast transfers. ...
Also, all schemes use the fair sharing rate allocation based on max-min fairness except DCCast which uses the FCFS policy.The minimum edge Steiner tree leads to the minimum bandwidth consumption. ...
arXiv:1908.11131v1
fatcat:ofzxh5shfnbcdni2jg3vj4te5u
« Previous
Showing results 1 — 15 out of 2,897 results