Difference between revisions of "Datacenter and ISP Networks"
(Created page with " Recent large-scale Internet applications have introduced a renewed interest in scalable multicast services. Examples of such applications include live Internet broadcast (e.g...") |
|||
| Line 3: | Line 3: | ||
In this project, we design scalable multicast systems for general ISP networks and datacenter networks. | In this project, we design scalable multicast systems for general ISP networks and datacenter networks. | ||
| − | |||
== People == | == People == | ||
| Line 9: | Line 8: | ||
* Parham Yassini | * Parham Yassini | ||
* [http://www.cs.sfu.ca/~mhefeeda/ Mohamed Hefeeda] | * [http://www.cs.sfu.ca/~mhefeeda/ Mohamed Hefeeda] | ||
| − | |||
'''Stateless Multicast For ISP Networks''' | '''Stateless Multicast For ISP Networks''' | ||
| Line 19: | Line 17: | ||
Group communications appear in many recent datacenter applications. These applications, however, do not benefit from multicast due to the absence of efficient systems that support large-scale multicast sessions, minimize state at switches and reduce bandwidth overheads. We propose a new architecture that addresses the challenges of multicast in datacenter networks. The proposed approach carefully divides the state and tasks of the data plane among switches and servers in order to realize efficient multicast services in datacenters, by partially offloading the management of multicast sessions to servers. | Group communications appear in many recent datacenter applications. These applications, however, do not benefit from multicast due to the absence of efficient systems that support large-scale multicast sessions, minimize state at switches and reduce bandwidth overheads. We propose a new architecture that addresses the challenges of multicast in datacenter networks. The proposed approach carefully divides the state and tasks of the data plane among switches and servers in order to realize efficient multicast services in datacenters, by partially offloading the management of multicast sessions to servers. | ||
| − | |||
'''Oktopus: Service Chaining for Multicast Traffic''' | '''Oktopus: Service Chaining for Multicast Traffic''' | ||
Multicast service chaining refers to the orchestration of network services for multicast traffic. Paths of a multicast session that span the source, destinations and required services form a complex structure that we refer to as the multicast distribution graph. We propose a new path-based algorithm, called Oktopus, that runs at the control plane of the ISP network to calculate the multicast distribution graph for a given session. Oktopus aims at minimizing the routing cost for each multicast session while satisfying all service chaining requirements. Oktopus consists of two steps. The first one generates a set of segments from the given ISP network topology, and the second step uses these segments to efficiently calculate the multicast distribution graph. Oktopus has a fine-grained control over the selection of links in the distribution graphs that leads to significant improvements. | Multicast service chaining refers to the orchestration of network services for multicast traffic. Paths of a multicast session that span the source, destinations and required services form a complex structure that we refer to as the multicast distribution graph. We propose a new path-based algorithm, called Oktopus, that runs at the control plane of the ISP network to calculate the multicast distribution graph for a given session. Oktopus aims at minimizing the routing cost for each multicast session while satisfying all service chaining requirements. Oktopus consists of two steps. The first one generates a set of segments from the given ISP network topology, and the second step uses these segments to efficiently calculate the multicast distribution graph. Oktopus has a fine-grained control over the selection of links in the distribution graphs that leads to significant improvements. | ||
| − | + | The code of Oktopus is [https://oktopus-project.org/ open source]. | |
| − | The code of Oktopus is | ||
Revision as of 09:45, 7 August 2021
Recent large-scale Internet applications have introduced a renewed interest in scalable multicast services. Examples of such applications include live Internet broadcast (e.g., Facebook Live), stock market applications, cloud-based enterprise applications, IPTV, webinars and video conferencing, and massive multiplayer games. The scale of these applications is unprecedented. For instance, Facebook Live aims to stream millions of live sessions to millions of concurrent users. Traditional multicast approaches do not scale, because of their substantial state and communication overheads. In addition, most traditional multicast approaches do not enable controlling the network paths chosen for the multicast sessions (usually referred to as traffic engineering), nor do they offer efficient methods to direct multicast traffic through various network functions (e.g., firewalls, IDS, video transcoding), which is known as service chaining.
In this project, we design scalable multicast systems for general ISP networks and datacenter networks.
People
- Khaled Diab
- Parham Yassini
- Mohamed Hefeeda
Stateless Multicast For ISP Networks
Current multicast forwarding systems suffer from large state requirements at routers and high communication overhead. In addition, these systems do not support generalized multicast forwarding, where traffic passes through traffic-engineered paths or requires service chaining. We propose a new system that completely eliminates the state at routers and reduces communication overhead.
Scalable Multicast for Datacenter Networks
Group communications appear in many recent datacenter applications. These applications, however, do not benefit from multicast due to the absence of efficient systems that support large-scale multicast sessions, minimize state at switches and reduce bandwidth overheads. We propose a new architecture that addresses the challenges of multicast in datacenter networks. The proposed approach carefully divides the state and tasks of the data plane among switches and servers in order to realize efficient multicast services in datacenters, by partially offloading the management of multicast sessions to servers.
Oktopus: Service Chaining for Multicast Traffic
Multicast service chaining refers to the orchestration of network services for multicast traffic. Paths of a multicast session that span the source, destinations and required services form a complex structure that we refer to as the multicast distribution graph. We propose a new path-based algorithm, called Oktopus, that runs at the control plane of the ISP network to calculate the multicast distribution graph for a given session. Oktopus aims at minimizing the routing cost for each multicast session while satisfying all service chaining requirements. Oktopus consists of two steps. The first one generates a set of segments from the given ISP network topology, and the second step uses these segments to efficiently calculate the multicast distribution graph. Oktopus has a fine-grained control over the selection of links in the distribution graphs that leads to significant improvements. The code of Oktopus is open source.
Code and Datasets
Publications
- K. Diab and M. Hefeeda, Oktopus: Service Chaining for Multicast Traffic, IEEE International Conference on Network Protocols (ICNP'20), Madrid, Spain, October 2020.
