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.
Bit Indexed Explicit Replication (BIER) is a novel multicast forwarding scheme for IP networks that avoids states in replicating routers by encoding the multicast information into a bit string in the packet header. In addition, the BIER-TE variant encodes the multicast tree in the header and allows for network programmability. We propose the use of maximally redundant trees (MRTs) for 1+1 protection...
Content-Centric Networking (CCN) seeks to meet the content-centric needs of users. In this paper, we propose hybrid-COPSS, a hybrid content-centric architecture. We build on the previously proposed Content-Oriented Publish/Subscribe System (COPSS) to address incremental deployment of CCN and elegantly combine the functionality of content-centric networks with the efficiency of IP-based forwarding...
Many proposals for the next generation of the Internet suggest moving from an end-point oriented to an information-centric oriented architecture. Many of these proposals are based on the publish/subscribe paradigm, which lends itself naturally to native multicast support, a key factor for efficient content distribution. However, the design of efficient reliable transport protocols for multicast is...
Patching is a effective multicast video scheduling scheme for VOD service. However, the video server bandwidth requirement will increase greatly when client request rate is high. On the other hand, IP multicast can only be implemented in a relatively small area nowadays. Aiming at these problems, we present a novel video stream scheduling scheme: Range Patching based on overlay multicast technology...
We present a design of an OpenFlow controller handling IP multicast and a method to switch a multicast tree to the other with little packet loss. Reducing packet loss during reconstruction of multicast tree triggered by a failure has been an important problem to make multicast communications more reliable. One approach for this problem is to use redundant trees for multicast trees, but algorithms...
Multicast has been being developed as a very promising technique to data delivery to a group of destinations simultaneously. Except of first implementation for multicasting in the Internet aka IP Multicast, for past few years some systems defined for end-hosts overlay network have been successfully designed and implemented. Additionally, overlay multicast defined for end-host based networks has been...
Large-scale enterprise IP networks often involve complex topology consisting of routers, bridges and hosts. Due to multiple redundancies and minimized Single Point of Failure (SPOF), sometimes it is difficult to determine the actual path of a packet even with the most up-to-date physical connectivity diagram. This presents a great challenge for troubleshooting end-to-end traffic flows. This paper...
Application Layer Multicast (ALM) has resolved the issue of deployment, but effectiveness inferiors to IP multicast. To build a high efficient multicast tree, this research focuses on the distributed spanning tree algorithm by using nearest physical topology node selection strategy, which is based on a new group communication model named MixCast. The average delay and average join time of the tree...
To reduce influence of node failure and achieve high reliability in communications, research on node protection algorithm is needed. In this paper, we first provide an overview of current research of redundant tree algorithm (RT). Then we propose a new algorithm called single node protection algorithm (SNP) based on previous redundant tree algorithm, which is used to achieve recovery form single node...
The growing reliance of networked applications on timely and reliable data transfer requires the networking to provide adequate services even in the presence of ??persistent?? failures which be caused by spiteful attack, natural disasters etc. It is much more difficult to meet this requirement for multicast sessions than for unicast communications because any on-tree component failure may often cause...
Many proposed solutions employ distributed depth-first-searching (DFS) approach to implement positioning in application layer multicast. In DFS-based delivery tree building approaches, the newcomer need not know the information of other members except the root, and positioning can be easily implemented. However, the DFS approach cannot effectively position a host in some cases because it usually selects...
Currently there is a fast increasing need for scalable and efficient group communication technology. The IP-multicast is theoretically optimal for such purposes. However, since the deployment of IP-Multicast is time-consuming and costly, the Application-Layer Multicast (ALM) is offered as a solution. In this article we present the design of ALM system to solve the typical scenario where there are...
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.