On the complexity of the bandwidth management problem for scalable coding video streaming on a public-shared network

This paper proposes a novel concept of using the sharable bandwidth of public-shared network, like FON network, to construct an efficient video delivery system. We show that the problem of constructing an architecture to serve the video streaming requests by using a minimum amount of sharable bandwidth is NP-Hard. A linear approximation algorithm is also proposed to manage the public-shared bandwidth so that all clients are served and the total amount of employed sharable bandwidth is no greater than twice of the optimal solution.     

Multicast traffic scheduling in single-hop WDM networks with arbitrary tuning latencies

To accommodate the demands of quality of service (QoS) and multicast applications, a multicast QoS traffic-scheduling algorithm with tuning latency consideration in wavelength-division multiplexing star-coupled networks is provided in this paper. To furnish different levels of QoS, two classes of traffic are considered: constant bit rate and available bit rate (ABR). An effective bandwidth-normalization scheme for ABR traffic is also derived. We define the slot scanning problem in the connection-setup process as the maximum assignable slots (MAS) problem. We prove that the optimal solution of the MAS problem can be obtained in polynomial time. Owing to its high-order time complexity, we also propose two heuristics for the MAS problem. The performance of these strategies are evaluated and compared by simulations under different system parameters, such as number of wavelengths, traffic load, and tuning latency.     

Intelligent Handoff for Mobile Wireless Internet

This paper presents an intelligent mobility management scheme for Mobile Wireless InterNet – MWIN. MWIN is a wireless service networks wherein its core network consisting of Internet routers and its access network can be built from any Internet-capable radio network. Two major standards are currently available for MWIN, i.e., the mobile IP and wireless LAN. Mobile IP solves address mobility problem with the Internet protocol while wireless LAN provides a wireless Internet access in the local area. However, both schemes solve problems independently at different layers, thereby some additional problems occur, e.g., delayed handoff, packet loss, and inefficient routing. This paper identifies these new problems and performs analyses and some real measurements on the handoff within MWIN. Then, a new handoff architecture that extends the features of both mobile IP and wireless LAN handoff mechanism was proposed. This new architecture consists of mobile IP extensions and a modified wireless LAN handoff algorithm. The effect of this enhancement provides a linkage between different layers for preventing packet loss and reducing handoff latency. Finally, some optimization issues regarding network planning and routing are addressed.     

CTMS: a novel constrained tree migration scheme for multicastservices in generic wireless systems

This study considers the multicasting problem over mobile wireless systems in the context of generic wireless systems. Specifically, a novel constrained tree migration scheme (CTMS) is created to support multicast services in mobile wireless networks. The salient features of the novel CTMS include: (1) automatically recognizing the inefficiency of the multicast trees, then migrating them to better ones, while maintaining the QoS guarantees specified by mobile users; (2) conserving network resources by maintaining a low-cost multicast tree, thus accommodating more users; (3) operating efficiently in a truly distributed manner through event driven and diffusing computations, thus increasing the degree of scalability; (4) synchronizing data transmission flow for transparency during the tree migration, and thus providing seamless handoff control. Finally, the novel CTMS also handles the concurrent migration problem effectively within the wireless system, thus eliminating the oscillation paradox. Extensive simulation results show that CTMS can significantly reduce the resources used per multicast tree, thus achieving both low handoff-dropping/join-blocking rate and high resource utilization     

An isochronous and asynchronous traffic scheduling algorithm fordual-star WDM networks

In this paper, based on the concept of wavelength reusing, a new architecture for interconnecting two wavelength division multiplexing (WDM) star networks is proposed. According to this architecture, the problem of scheduling isochronous as well as asynchronous traffic is investigated. The lower bounds for the problem of minimizing the switching duration and the number of switching modes are derived. A transmission scheduling algorithm for the proposed architecture to efficiently reuse the wavelength is also proposed. For only asynchronous traffic, the analytical result shows that the proposed scheduling algorithm produces solutions equal to the lower bounds. For both isochronous and asynchronous traffic, simulation results show that the average switching duration and the average number of switching modes obtained by the proposed algorithm are quite close to the lower bounds. Simulation results also show that given the same number of users and available wavelengths, the solutions (in terms of the average switching duration and the average number of switching modes) obtained by the proposed scheduling algorithm on the dual-star WDM networks are better than the solutions obtained by the two-phase algorithm on the similar dual-star WDM networks     

A distributed paths migration scheme for IEEE 802.6 based personalcommunication networks

Wireless personal communications will be provided via the usage of microcells in urban areas. The current centralized architecture may be unsuitable with the increased processing load and handoff rate associated with microcells. Some distributed architectures based upon interconnected IEEE 802.6 MAN'S for wireless personal communications have been proposed recently. The IEEE 802.6 MAN is attractive since it also provides isochronous services which are quite suitable for voice communications. In such a network, a communication path between two mobile terminals may be inefficient due to the lack of better paths when the path is established or become inefficient due to the mobility of terminals, e.g., the path elongates and consumes too much isochronous channels. In this paper, a distributed paths migration scheme is proposed for the IEEE 802.6 based personal communication networks. This distributed scheme automatically recognizes inefficient paths and migrates them to better ones, if any. During the migration, the property of isochronous services is also preserved. The performance of this scheme is evaluated by simulations. Simulation results show that the proposed paths migration scheme dramatically reduces the number of isochronous channels consumed per path. As a result, the call blocking rate is reduced and the number of successful established paths is increased significantly     

On Multicast Routing for Wavelength-Routed WDM Networks with Dynamic Membership

Future broadband networks must support integrated services and offer flexible bandwidth usage. In our previous work in [1], we explored the optical link control (OLC) layer on the top of optical layer that enables the possibility of bandwidth on-demand (BoD) service directly over wavelength division multiplexed (WDM) networks. Today, more and more applications and services such as video-conferencing software and Virtual LAN service require multicast support over the underlying networks. Currently, it is difficult to provide wavelength multicast over optical switches without optical/electronic conversions although the conversion takes extra cost. In this paper, based on the proposed wavelength router architecture (equipped with ATM switches to offer O/E and E/O conversions when necessary), a dynamic multicast routing algorithm is proposed to furnish multicast services over WDM networks. The goal is to join a new group member into the multicast tree so that the cost, including the link cost and the optical/electronic conversion cost, is kept as low as possible. The same algorithm can be applied to other wavelength routing architectures with redefinition of electronic copy cost. The effectiveness of the proposed wavelength router architecture as well as the dynamic multicast algorithm is evaluated by simulation.     

Wavelength division multiplexing-based video-on-demand systems

Serving video-on-demand (VOD) traffic via isochronous transmission service is highly desirable because of the characteristics of VOD traffic. This paper proposes a mechanism to transfer VOD traffic over wavelength division multiplexing (WDM) networks by employing isochronous transmission service. Based on the proposed mechanism, the problem of scheduling isochronous and asynchronous traffic for single-star WDM networks with multiple receivers and transmitters is investigated. The lower bounds on the total switching duration and the number of switching modes for the isochronous and asynchronous traffic scheduling problem are derived. An optimal scheduling algorithm is presented for the cases where only asynchronous traffic exists; and a heuristic algorithm is also proposed for the cases where both the isochronous and asynchronous traffic coexist in the WDM networks. Simulation results indicate that the average switching duration and the average number of switching modes obtained by the proposed algorithm are close to the lower bounds, which implies that the proposed scheduling algorithm is effective     

A hierarchical HFC network with QoS guaranteed traffic policy

The rapid growing of the Internet makes multimedia and broadband services closer to the users. For people at home, two typical networks are available to access the Internet: telephone network and CATV network. This paper presents a hierarchical tree-based structure for the hybrid fiber-cable (HFC) network where the traditional HFC network is partitioned into segments. Each segment is coordinated by a central traffic controller (CTC). A reservation-based traffic policy is also proposed for the CTC to schedule the data transmissions within the segment to provide guaranteed QoS, such as constant bit rate (CBR) service and variable bit rate (VBR) service. The CTC also furnishes the bridging function so that local traffic within the controlled segment is filtered to save the network bandwidth. Based on the segmentation concept and filtering function, the bandwidth can be reused efficiently and the system performance is improved significantly. Simulation results indicate that the proposed hierarchical HFC network performs much better than the traditional HFC network in terms of delay, delay jitter and channel utilization. Through the proposed traffic policy, the hierarchical HFC network also offers guaranteed QoS for the users     

An efficient transmission scheduling algorithm for awavelength-reusable local lightwave network

Although single-hop star networks based on wave-length division multiplexing (WDM) are attractive owing to their all-optical communication features, the throughput of such lightwave networks is limited due to the small number of available wavelengths. In this paper, a wavelength-reusable local lightwave network that consists of two interconnected WDM star networks is proposed. Based on this architecture, the lower bounds for the problems of minimizing the switching duration and the number of switching modes are derived. A transmission scheduling algorithm for this architecture to efficiently reuse the wavelengths is also proposed. The analytical result shows that the proposed scheduling algorithm always produces solutions close to the lower bounds. Simulation results show that given the same number of users and available wavelengths, the solutions (in terms of the average switching duration and the average number of switching matrices) obtained by the proposed scheduling algorithm on the interconnected WDM networks are better than the optimal solution on a single-star WDM network. In most cases, the performance improvement achieves 20 to 45%