The Experts below are selected from a list of 321 Experts worldwide ranked by ideXlab platform
Dai Ju-feng - One of the best experts on this subject based on the ideXlab platform.
-
An Improved Scheduling Algorithm for Real-Time Uplink Services in IEEE82.16e
2007 IEEE International Symposium on Consumer Electronics, 2007Co-Authors: Dong Guojun, Dai Ju-fengAbstract:In IEEE802.16e, Scheduling Services represent the data handling mechanisms supported by the MAC scheduler for data transport on a connection. Each connection is associated with a single Scheduling Service. A Scheduling Service is determined by a set of QoS parameters that quantify its behaviors. Taking three types of Scheduling Services into consideration, UGS (unsolicited granted Scheduling), rtPS (realtime polling Scheduling) and ertPS (extended realtime polling Scheduling), this paper proposes a realtime uplink Scheduling Service algorithm by modeling an Improved ertPS Scheduling Service algorithm which maximizes the usage of uplink access resource and guarantees data rate and delay requirement. Simulation results show that the throughput performance of the proposed algorithm is better than the algorithms in IEEE802.16e on the basis of guaranteed delay performance.
-
Improved Scheduling algorithm for real-time uplink Services in IEEE802.16e
Journal of Computer Applications, 2007Co-Authors: Dai Ju-fengAbstract:In IEEE802.16e, Scheduling Services represent the data handling mechanisms supported by the MAC scheduler for data transport on a connection. Each connection is associated with a single Scheduling Service. A Scheduling Service is determined by a set of QoS parameters that quantify its behaviors. Taking three types of Scheduling Services into consideration, UGS (Unsolicited Granted Scheduling), rtPS (real-time Polling Scheduling) and ertPS (extended real-time Polling Scheduling), this paper proposed a real-time uplink Scheduling Service algorithm irtPS (improved real-time Polling Scheduling). The proposed algorithm maximized the usage of uplink access resource and guaranteed data rate and delay requirement. Mathematical modeling and analysis results show that the throughput performance of the proposed algorithm is better than the algorithms in IEEE802.16e on the precondition of guaranteed delay performance.
Qun Shi - One of the best experts on this subject based on the ideXlab platform.
-
Supporting MPEG video transport on DOCSIS-compliant cable networks
IEEE Journal on Selected Areas in Communications, 2000Co-Authors: Dennis Bushmitch, Sarit Mukherjee, Sathya Narayanan, M. Ratty, Qun ShiAbstract:A novel quality of Service (QoS) Scheduling mechanism suitable for transporting variable bit rate video in the upstream direction over a DOCSIS (data over cable system interface specification)-compliant cable network is presented. It is shown, via simulation using real life video traces, that the proposed Scheduling Service provides significant improvements as compared to the existing DOCSIS QoS Scheduling Services, with regard to bandwidth utilization and latency distribution. The proposed Scheduling Service is also applicable to transport integrated Services over the Internet and can be utilized by other emerging multimedia applications, where data are bursty in nature and variable in bit rate.
Chen Ding - One of the best experts on this subject based on the ideXlab platform.
-
IEEE SCC - Prioritizing and Scheduling Service Requests under Time Constraints
2014 IEEE International Conference on Services Computing, 2014Co-Authors: Farnaz Dargahi, Chun Wang, Mohammad Fozlul Haque Bhuiyan, Chen DingAbstract:This paper presents a game theoretic model and an iterative bidding framework for the Service request prioritizing and Scheduling problem in Software as a Service (SaaS) environments. We focus on a type of settings in which the Service provider's existing capacity is over demanded and customers' Service requests are constrained with completion times. To gain more profit, the provider needs to prioritize customers' requests based on their profitability and schedule as many profitable requests as possible. The prioritizing and Scheduling problem is considered in a strategic setting in which customers' values on the Service requests are their private information that is not known to the provider, which calls for economic based models. The key issue here is how to maximize economic social welfare across all customers given the presence of customers' self-interests. We propose an iterative bidding framework as a multilateral negotiation platform for the Service provider and its customers to allocate compute capacity among Service requests. The proposed bidding framework is evaluated by a computational study. The data from the experiments show that the proposed approach produces near optimal solutions with moderate information revelation. It also scales well to large size problem instances.
Xiong Delan - One of the best experts on this subject based on the ideXlab platform.
-
Service model of spatial data storage Scheduling based on subdivision theory
Computer Science, 2012Co-Authors: Xiong DelanAbstract:With the spatial data applications to the depth and breadth of expansion,spatial data exist for speed,efficiencyand other problems in the organization,storage,update,applications and other aspects.In view of the above problems,based on global subdivision organization theory,combined with the client oriented aggregation Service that G/S mode,studied and proposed a space subdivision data storage Scheduling Service model,and presented the model architecture,data access process,designs the address coding structure and resolution process,forming effective mechanism of space subdivision data organization and management,according to the needs of integration,fast Scheduling with data distributed storage and client information aggregation.Finally realized and verified the prototype system,it has certain theo-ry significance and the application value.
Wei Xie - One of the best experts on this subject based on the ideXlab platform.
-
contract selection for a multi Service sharing platform with self Scheduling capacity
Omega-international Journal of Management Science, 2019Co-Authors: Yongwu Zhou, Xiaogang Lin, Yuanguang Zhong, Wei XieAbstract:Abstract In this paper, we investigate three commission contracts for a monopoly firm, who acts as a transaction platform between customers and Service providers. The platform provides multiple Services with self-Scheduling Service providers and allows the customers to purchase different Services based on their preferences. Ideally, for the transactions of different Services, the platform can charge different rates of commissions accordingly, which is called the “optimal contract”, to maximize its profit. However, in practice, the other two contracts are commonly adopted, i.e., the free-customers-commission (FCC) contract and the dynamic-customers-commission (DCC) contract, and both of them do not apply the optimal commission policy. In particular, the three contracts all regulate the numbers of providers who join the platform. By observing these phenomena, we propose to study the commission and recruitment strategies for different contracts. We analyze the reason why the platforms adopt the FCC or DCC contract, but not the optimal contract, over different development stages. Compared to the optimal contract, our results show that the DCC contract hurts the customer surplus but improves the provider surplus, while the FCC contract can improve the benefits of both parties. We also extend our base model to incorporate the price endogeneity and competition concerns. The results of our study can be used to explain the underlying mechanisms of the proposed three contracts and provide guidance to the practitioners to select the best-fit one.
