The Experts below are selected from a list of 615 Experts worldwide ranked by ideXlab platform
Hussein T. Mouftah - One of the best experts on this subject based on the ideXlab platform.
-
Forwarding state scalability for multicast provisioning in IP networks
IEEE Communications Magazine, 2003Co-Authors: Baoxian Zhang, Hussein T. MouftahAbstract:Forwarding state scalability is one of the critical issues that delay the multicast deployment in IP networks. With traditional multicast routing protocols, a Forwarding tree is built for each multicast session, and each router is required to maintain a Forwarding Entry for each multicast session whose distribution tree passes through the router. This poses the multicast Forwarding state scalability issue when the number of concurrent multicast sessions is very large. We first present a survey of existing work addressing this scalability issue for providing scalable IP multicast. Then we extend an existing multicast routing protocol, Multicast Extension to OSPF (MOSPF), to scale well with respect to the number of concurrent multicast sessions by introducing tunnel support. This extension aims to reduce the protocol overhead associated with MOSPF. Simulation results show that the extension can significantly reduce multicast Forwarding state and computational overhead at routers without affecting the per-destination shortest path characteristic of a resulting tree or introducing extra control overhead.
-
Extension to OSPF for scalable multicasting through recursive unicast
Workshop on High Performance Switching and Routing 2003 HPSR., 1Co-Authors: Baoxian Zhang, Hussein T. MouftahAbstract:IP multicast suffers from the Forwarding state scalability issue when the number of simultaneously on-going multicast sessions is very large, since traditional multicast routing protocols require each router to maintain a Forwarding Entry for each multicast session whose distribution tree passes through the router. We introduce the idea of recursive unicast into the existing MOSPF (multicast extension to open shortest path first) routing protocol to improve its scalability. Simulation results show that the designed protocol can significantly reduce multicast Forwarding state and computational overhead at routers without hurting the per-destination shortest path characteristic of a resulting tree.
-
GLOBECOM - Forwarding state reduction for delay-constrained multicasting in IP networks
GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489), 1Co-Authors: Baoxian Zhang, Hussein T. MouftahAbstract:The multicast Forwarding state scalability issue is one of the critical issues that delay the deployment of IP multicast in the global Internet. With traditional protocols, each router is required to maintain a Forwarding Entry locally for each group whose distribution tree passes through the router itself. Consequently, the number of Forwarding entries at routers increases linearly with the number of concurrent ongoing multicast sessions. This can pose the Forwarding state scalability issue when the number of multicast sessions is very large. The paper addresses this scalability issue in providing efficient delay-constrained multicasting in IP networks. We propose a scalable multicast routing heuristic. Its computational complexity is deduced to be O(m|V|/sup 2/), where m is the size of the multicast group and |V| is the size of the network. In particular, if the heuristic is executed online, its computational complexity can be further reduced to O(m/sup 2/). This property makes the heuristic scale well with the number of concurrent sessions since multicasting subject to a delay constraint is typically executed on a per-session basis. Simulation results show that the proposed heuristic can achieve high performance in reducing the Forwarding state at routers and in utilizing network resources efficiently.
Baoxian Zhang - One of the best experts on this subject based on the ideXlab platform.
-
Forwarding state scalability for multicast provisioning in IP networks
IEEE Communications Magazine, 2003Co-Authors: Baoxian Zhang, Hussein T. MouftahAbstract:Forwarding state scalability is one of the critical issues that delay the multicast deployment in IP networks. With traditional multicast routing protocols, a Forwarding tree is built for each multicast session, and each router is required to maintain a Forwarding Entry for each multicast session whose distribution tree passes through the router. This poses the multicast Forwarding state scalability issue when the number of concurrent multicast sessions is very large. We first present a survey of existing work addressing this scalability issue for providing scalable IP multicast. Then we extend an existing multicast routing protocol, Multicast Extension to OSPF (MOSPF), to scale well with respect to the number of concurrent multicast sessions by introducing tunnel support. This extension aims to reduce the protocol overhead associated with MOSPF. Simulation results show that the extension can significantly reduce multicast Forwarding state and computational overhead at routers without affecting the per-destination shortest path characteristic of a resulting tree or introducing extra control overhead.
-
Extension to OSPF for scalable multicasting through recursive unicast
Workshop on High Performance Switching and Routing 2003 HPSR., 1Co-Authors: Baoxian Zhang, Hussein T. MouftahAbstract:IP multicast suffers from the Forwarding state scalability issue when the number of simultaneously on-going multicast sessions is very large, since traditional multicast routing protocols require each router to maintain a Forwarding Entry for each multicast session whose distribution tree passes through the router. We introduce the idea of recursive unicast into the existing MOSPF (multicast extension to open shortest path first) routing protocol to improve its scalability. Simulation results show that the designed protocol can significantly reduce multicast Forwarding state and computational overhead at routers without hurting the per-destination shortest path characteristic of a resulting tree.
-
GLOBECOM - Forwarding state reduction for delay-constrained multicasting in IP networks
GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489), 1Co-Authors: Baoxian Zhang, Hussein T. MouftahAbstract:The multicast Forwarding state scalability issue is one of the critical issues that delay the deployment of IP multicast in the global Internet. With traditional protocols, each router is required to maintain a Forwarding Entry locally for each group whose distribution tree passes through the router itself. Consequently, the number of Forwarding entries at routers increases linearly with the number of concurrent ongoing multicast sessions. This can pose the Forwarding state scalability issue when the number of multicast sessions is very large. The paper addresses this scalability issue in providing efficient delay-constrained multicasting in IP networks. We propose a scalable multicast routing heuristic. Its computational complexity is deduced to be O(m|V|/sup 2/), where m is the size of the multicast group and |V| is the size of the network. In particular, if the heuristic is executed online, its computational complexity can be further reduced to O(m/sup 2/). This property makes the heuristic scale well with the number of concurrent sessions since multicasting subject to a delay constraint is typically executed on a per-session basis. Simulation results show that the proposed heuristic can achieve high performance in reducing the Forwarding state at routers and in utilizing network resources efficiently.
Pedro Miguel - One of the best experts on this subject based on the ideXlab platform.
-
GMPLS-OBS interoperability and routing acalability in internet
2011Co-Authors: Mendoça Pedroso, Pedro MiguelAbstract:The popularization of Internet has turned the telecom world upside down over the last two decades. Network operators, vendors and service providers are being challenged to adapt themselves to Internet requirements in a way to properly serve the huge number of demanding users (residential and business). The Internet (data-oriented network) is supported by an IP packet-switched architecture on top of a circuit-switched, optical-based architecture (voice-oriented network), which results in a complex and rather costly infrastructure to the transport of IP traffic (the dominant traffic nowadays). In such a way, a simple and IP-adapted network architecture is desired. From the transport network perspective, both Generalized Multi-Protocol Label Switching (GMPLS) and Optical Burst Switching (OBS) technologies are part of the set of solutions to progress towards an IP-over-WDM architecture, providing intelligence in the control and management of resources (i.e. GMPLS) as well as a good network resource access and usage (i.e. OBS). The GMPLS framework is the key enabler to orchestrate a unified optical network control and thus reduce network operational expenses (OPEX), while increasing operator's revenues. Simultaneously, the OBS technology is one of the well positioned switching technologies to realize the envisioned IP-over-WDM network architecture, leveraging on the statistical multiplexing of data plane resources to enable sub-wavelength in optical networks. Despite of the GMPLS principle of unified control, little effort has been put on extending it to incorporate the OBS technology and many open questions still remain. From the IP network perspective, the Internet is facing scalability issues as enormous quantities of service instances and devices must be managed. Nowadays, it is believed that the current Internet features and mechanisms cannot cope with the size and dynamics of the Future Internet. Compact Routing is one of the main breakthrough paradigms on the design of a routing system scalable with the Future Internet requirements. It intends to address the fundamental limits of current stretch-1 shortest-path routing in terms of RT scalability (aiming at sub-linear growth). Although "static" compact routing works fine, scaling logarithmically on the number of nodes even in scale-free graphs such as Internet, it does not handle dynamic graphs. Moreover, as multimedia content/services proliferate, the multicast is again under the spotlight as bandwidth efficiency and low RT sizes are desired. However, it makes the problem even worse as more routing entries should be maintained. In a nutshell, the main objective of this thesis in to contribute with fully detailed solutions dealing both with i) GMPLS-OBS control interoperability (Part I), fostering unified control over multiple switching domains and reduce redundancy in IP transport. The proposed solution overcomes every interoperability technology-specific issue as well as it offers (absolute) QoS guarantees overcoming OBS performance issues by making use of the GMPLS traffic-engineering (TE) features. Keys extensions to the GMPLS protocol standards are equally approached; and ii) new compact routing scheme for multicast scenarios, in order to overcome the Future Internet inter-domain routing system scalability problem (Part II). In such a way, the first known name-independent (i.e. topology unaware) compact multicast routing algorithm is proposed. On the other hand, the AnyTraffic Labeled concept is also introduced saving on Forwarding entries by sharing a single Forwarding Entry to unicast and multicast traffic type. Exhaustive simulation campaigns are run in both cases in order to assess the reliability and feasible of the proposals.
Mendoça Pedroso, Pedro Miguel - One of the best experts on this subject based on the ideXlab platform.
-
GMPLS-OBS interoperability and routing acalability in internet
Universitat Politècnica de Catalunya, 2011Co-Authors: Mendoça Pedroso, Pedro MiguelAbstract:The popularization of Internet has turned the telecom world upside down over the last two decades. Network operators, vendors and service providers are being challenged to adapt themselves to Internet requirements in a way to properly serve the huge number of demanding users (residential and business). The Internet (data-oriented network) is supported by an IP packet-switched architecture on top of a circuit-switched, optical-based architecture (voice-oriented network), which results in a complex and rather costly infrastructure to the transport of IP traffic (the dominant traffic nowadays). In such a way, a simple and IP-adapted network architecture is desired. From the transport network perspective, both Generalized Multi-Protocol Label Switching (GMPLS) and Optical Burst Switching (OBS) technologies are part of the set of solutions to progress towards an IP-over-WDM architecture, providing intelligence in the control and management of resources (i.e. GMPLS) as well as a good network resource access and usage (i.e. OBS). The GMPLS framework is the key enabler to orchestrate a unified optical network control and thus reduce network operational expenses (OPEX), while increasing operator's revenues. Simultaneously, the OBS technology is one of the well positioned switching technologies to realize the envisioned IP-over-WDM network architecture, leveraging on the statistical multiplexing of data plane resources to enable sub-wavelength in optical networks. Despite of the GMPLS principle of unified control, little effort has been put on extending it to incorporate the OBS technology and many open questions still remain. From the IP network perspective, the Internet is facing scalability issues as enormous quantities of service instances and devices must be managed. Nowadays, it is believed that the current Internet features and mechanisms cannot cope with the size and dynamics of the Future Internet. Compact Routing is one of the main breakthrough paradigms on the design of a routing system scalable with the Future Internet requirements. It intends to address the fundamental limits of current stretch-1 shortest-path routing in terms of RT scalability (aiming at sub-linear growth). Although "static" compact routing works fine, scaling logarithmically on the number of nodes even in scale-free graphs such as Internet, it does not handle dynamic graphs. Moreover, as multimedia content/services proliferate, the multicast is again under the spotlight as bandwidth efficiency and low RT sizes are desired. However, it makes the problem even worse as more routing entries should be maintained. In a nutshell, the main objective of this thesis in to contribute with fully detailed solutions dealing both with i) GMPLS-OBS control interoperability (Part I), fostering unified control over multiple switching domains and reduce redundancy in IP transport. The proposed solution overcomes every interoperability technology-specific issue as well as it offers (absolute) QoS guarantees overcoming OBS performance issues by making use of the GMPLS traffic-engineering (TE) features. Keys extensions to the GMPLS protocol standards are equally approached; and ii) new compact routing scheme for multicast scenarios, in order to overcome the Future Internet inter-domain routing system scalability problem (Part II). In such a way, the first known name-independent (i.e. topology unaware) compact multicast routing algorithm is proposed. On the other hand, the AnyTraffic Labeled concept is also introduced saving on Forwarding entries by sharing a single Forwarding Entry to unicast and multicast traffic type. Exhaustive simulation campaigns are run in both cases in order to assess the reliability and feasible of the proposals.Postprint (published version
Shuai Wang - One of the best experts on this subject based on the ideXlab platform.
-
delay bounded transmission power control for low duty cycle sensor networks
IEEE Transactions on Wireless Communications, 2015Co-Authors: Zuzhi Fan, Shi Bai, Shuai WangAbstract:Low-duty-cycle operation has been adopted to alleviate the consumption rate of energy, which is significant for the power scarcity sensor networks. The sleep latency brought by low-duty-cycle mode, however, leads to a dramatic increase of delay, which may not be tolerable for delay-sensitive applications. In this work, we introduce the transmission power control mechanism into low-duty-cycle sensor networks. Particularly, we propose Delay-bounded Transmission Power Control (DTPC), a cross-layer approach, to minimize the energy consumption of sensor nodes while meeting the user-specified delay constraint. In DTPC, each node builds its own transmission table using dynamical programming and then adaptively selects the approximate Forwarding Entry according to the delay bound. In addition, our design is embedded to support both single-parent and multi-parent data Forwarding scheme. The extensive simulations and test-bed experiment results show that DTPC can guarantee the delay bound with much lower energy cost compared with other well-known schemes.