-
Proceedings of the 18th International Conference on Multimedea 2010, Firenze, Italy, October 25-29, 2010; 01/2010
-
IEEE Trans. Computers. 01/2008; 57:145-156.
-
[show abstract]
[hide abstract]
ABSTRACT: A substantial portion of the emerging wireless data service consists of non-real-time applications such as content download. The existing mechanisms based on per-packet performance guarantees used mainly for voice and streaming media do not suffice for the elastic nature of non-real-time traffic. For a non-real-time user data services, the key performance measure of interest is the total download time. In this paper, we propose a novel scheduling framework for wireless content service. Specifically, we present a two-layer scheduling architecture that combines content-aware scheduling with opportunistic scheduling. In terms of content-awareness, the proposed scheduling policy provides guarantees on the download time of content. In the second stage, the instantaneous channel conditions of different users are exploited in an opportunistic manner so as to maximize the throughput of the system. We define service differentiation in two modes - differential and guaranteed - and provide polynomial time algorithms for both that manipulate the stretch ratio but within allowable limits. Extensive simulations are conducted that verify the efficiency of the proposed schemes and provide insights into the behavior of the scheduling algorithms for non-real-time data.
IEEE Transactions on Computers 08/2006; 55(7):893- 905. · 1.10 Impact Factor
-
IEEE Trans. Computers. 01/2006; 55:1458-1472.
-
IEEE Journal on Selected Areas in Communications. 01/2006; 24:2147-2158.
-
IEEE Trans. Computers. 01/2006; 55:893-905.
-
INFOCOM 2006. 25th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 23-29 April 2006, Barcelona, Catalunya, Spain; 01/2006
-
[show abstract]
[hide abstract]
ABSTRACT: The chapter presents a comprehensive discussion on the benefits of a hybrid optical WDM network solution while introducing
the concept of waveband switching for port cost reduction. The chapter provides a detailed overview of different waveband
routing and assignment algorithms that exploits the logical hierarchy in terms of wavebands and wavelengths. Cost effectiveness
of the hybrid solution is also discussed through simple analytical and simulation results.
KeywordsOptical network-routing-paths-wavelength-waveband-optimization-aggregation-wavelength division multiplexing-optical cross-connects-demultiplexing-multiplexing-optical switches-packing
12/2004: pages 23-49;
-
[show abstract]
[hide abstract]
ABSTRACT: Aggregation of individual wavelengths into wavebands for their subsequent switching and routing as a single group is an attractive way for scalable and cost-efficient optical networks. We analyze the implications of this waveband hierarchy for a single optical node by analyzing two issues: the proper selection of waveband sizes and the assignment of wavebands for a limited set of input-output patterns of traffic. We formulate a general model and propose optimal algorithmic solutions for both problems. The performance of resulting sets of non-uniform wavebands is studied for several representative cases (a single node, an optical ring network, an optical mesh network). The results demonstrate improved optical throughput and reduced cost of switching and routing when using non-uniform waveband hierarchy.
03/2003;
-
[show abstract]
[hide abstract]
ABSTRACT: Efficient bandwidth allocation strategy with simultaneous fulfillment of QoS requirement of a user in a mobile cellular network is still a critical and an important practical issue. We explore the problem of finding the reservation schedue that would minimize the amount of time for which bandwidth has to be allocated in a cell while meeting the QoS constraint. With the knowledge about the the arrival and residence time distribution of a user in a cell, the above problem can be optimally solved using a dynamic programming based approach in polynomial time. To be able to use the solution, we provide a mechanism for constructing the arrival/residence time distribution based on the measurement of hand-off events in a cell. The above solution allows us to propose an optimal time based bandwidth reservation and call admission scheme. By being scalable and distributed, the proposed scheme justifies for practical implementation. Simulations results are also presented to show the effectiveness of the scheme to achieve the target QoS level and optimal bandwidth utilization.
03/2003;
-
01/2003
-
[show abstract]
[hide abstract]
ABSTRACT: Providing quality of service(QoS) guarantees in mobile data networks is an inherently challenging task. Mobility of users imposes a spatial demand on resources resulting in overloaded regions that are entirely dependent on mobility pattern of users, that is often unpredictable.
10/2002;
-
[show abstract]
[hide abstract]
ABSTRACT: It is an inherently challenging task to provide Quality of Service(QoS) to real time multimedia users in a cellular network owing to their mobility induced uncertainty. We propose an implicit resource allocation strategy and justify the need of such a strategy toward an effective solution to QoS provisioning. The reservation scheme presented here based on this proposed strategy aims at meeting users' QoS requirement while maintaining a better utilization as compared to the conventional resource reservation schemes. Simulation results are presented which show the effectiveness of the scheme under a varying level of user mobility. I.
02/2002;
-
[show abstract]
[hide abstract]
ABSTRACT: Efficient bandwidth allocation strategy with simultaneous fulfillment of QoS requirement of a user in a mobile cellular network is still a critical and an important practical issue. We explore the problem of minimizing the amount of time for which bandwidth has to be allocated in a cell while meeting the QoS constraint. With the knowledge about the the arrival and residence time distribution of a user in a cell, the aboveproblem can be optimallysolved using a dynamic programming based approach in polynomial time. To be able to use the solution, we provide a mechanism for constructing the arrival/residence time distribution based on the measurement of hand-off events in a cell. The above solution allows us to propose an optimal time based bandwidth reservation and call admission scheme. By being scalable and distributed, the proposed scheme justifies for practical implementation. Simulations results are also presented to show the effectiveness of the scheme to achieve the target QoS level and optimal bandwidth utilization.
09/2001;
-
[show abstract]
[hide abstract]
ABSTRACT: Efficient bandwidth allocation strategy with simultaneous fulfillment of QoS requirement of a user in a mobile cellular network is still a critical and an important practical issue. We explore the problem of minimizing the amount of time for which bandwidth has to be allocated in a cell while meeting the QoS constraint. With the knowledge about the the arrival and residence time distribution of a user in a cell, the above problem can be optimally solved using a dynamic programming based approach in polynomial time. To be able to use the solution, we provide a mechanism for constructing the arrival/residence time distribution based on the measurement of hand-off events in a cell. The above solution allows us to propose an optimal time based bandwidth reservation and call admission scheme. By being scalable and distributed, the proposed scheme justifies for practical implementation. Simulations results are also presented to show the effectiveness of the scheme to achieve the target QoS level and optimal bandwidth utilization. I.
09/2001;
-
[show abstract]
[hide abstract]
ABSTRACT: Aggregation of individual wavelengths into wavebands for their subsequent switching and routing as a single group is an attractive way for scalable and cost-efficient optical networks. We analyze the implications of this waveband hierarchy for a single optical node by analyzing two issues: the proper selection of waveband sizes and the assignment of wavebands for a limited set of input-output patterns of traffic. We formulate a general model and propose optimal algorithmic solutions for both problems. The performance of resulting sets of nonuniform wavebands is studied for several representative cases (a single node, an optical ring network, an optical mesh network). The results demonstrate improved optical throughput and reduced cost of switching and routing when using nonuniform waveband hierarchy.
INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies;
-
[show abstract]
[hide abstract]
ABSTRACT: Efficient bandwidth allocation strategy with simultaneous fulfillment of QoS requirement of a user in a mobile cellular network is still a critical and an important practical issue. We explore the problem of finding the reservation schedule that would minimize the amount of time for which bandwidth has to be allocated in a cell while meeting the QoS constraint. With the knowledge about the arrival and residence time distribution of a user in a cell, the above problem can be optimally solved using a dynamic programming based approach in polynomial time. To be able to use the solution, we provide a mechanism for constructing the arrival/residence time distribution based on the measurement of hand-off events in a cell. The above solution allows us to propose an optimal time based bandwidth reservation and call admission scheme. By being scalable and distributed, the proposed scheme justifies for practical implementation. Simulations results are also presented to show the effectiveness of the scheme to achieve the target QoS level and optimal bandwidth utilization.
INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies;
