In the sensor networks for surveillance, the requirements of providing energy efficiency and service differentiation, which is to deliver high-priority packets preferentially, while maintaining high goodput, which is to deliver many packets within their deadline are increasing. However, previous works have difficulties in satisfying the requirements simultaneously. Thus, we propose GES-MAC, which satisfies the requirements simultaneously. GES-MAC reduces idle listening energy consumption by using a duty cycle, periodic listen (i.e., turn on radio module) and sleep (i.e. turn off radio module) of sensor nodes. Cluster-based multi-hop scheduling provides high goodput in a duty-cycled environment by scheduling clusters of nodes in the listen period and opportunistically forwarding data packets in the sleep period. Priority-aware schedule switching makes more high-priority packets reach the sink node by letting high-priority packets preempt the schedules of low-priority packets. In experiments with MICA2 based sensor nodes and in simulations, the energy consumption of the radio module is reduced by 70% compared to the approaches without a duty cycle, while providing 80% 100% goodput of the approaches that provide high goodput. Service differentiation is also supported with little overhead.

In peer-to-peer (P2P) content sharing, users can share their content by contributing their own resources to one another. However, since there is no incentive for contributing contents or resources to others, users may attempt to obtain content without any contribution. To motivate users to contribute their resources to the service, incentive-rewarding mechanisms have been proposed. On the other hand, emerging wireless technologies, such as IEEE 802.11 wireless local area networks, beyond third generation (B3G) cellular networks and mobile WiMAX, provide high-speed Internet access for wireless users. Using these high-speed wireless access, wireless users can use P2P services and share their content with other wireless users and with fixed users. However, this diversification of access networks makes it difficult to appropriately assign rewards to each user according to their contributions. This is because the cost necessary for contribution is different in different access networks. In this paper, we propose a novel incentive-rewarding mechanism called EMOTIVER that can assign rewards to users appropriately. The proposed mechanism uses an external evaluator and interactive learning agents. We also investigate a way of appropriately controlling rewards based on the system service's quality and managing policy.

Wireless content sharing where peers share content and services via wireless access networks requires user contributions, as in fixed P2P content sharing. However, in wireless access environments, since the resources of mobile terminals are strictly limited, mobile users are not as likely to contribute as ones in fixed environments. Therefore, incentives to encourage user contributions are more significant in wireless access environments. Although an incentive service differentiation architecture where the content transfer rate is adjusted according to the contributions of each downloading user has been already proposed for fixed P2P, it may not work well in wireless access environments because several factors effect wireless throughput. In this paper, we propose a novel architecture for contribution-based transfer-rate differentiation using wireless quality of service (QoS) techniques that motivates users to contribute their resources for wireless content sharing. We also propose a radio resource assignment method for our architecture. Computer simulations and game-theoretic calculations validate our architecture.

We propose a service differentiation scheme for optical burst switching (OBS) with the scheduling algorithm Horizon. In the proposed scheme, in addition to the latest horizon used in the conventional Horizon, we introduce the second latest horizon and use them for reservation preemption. Burst priority order is perfectly guaranteed according to the burst class information informed by its control packet if the arrival time of the burst is later than the second latest horizon and earlier than the latest horizon. Since the extra offset time is no longer needed for service differentiation, the burst blocking probability and the data latency will be reduced. We assume a multi-hop network with ring topology where bursts traverse five intermediate nodes, and evaluate the performance in terms of the end-to-end and hop-by-hop burst blocking probabilities. Simulation results show that the proposed scheme can achieve service differentiation with smaller blocking probability than the extra-offset-time-based scheme with Horizon. Furthermore, we show that the proposed scheme preserves service differentiation even in multi-hop environments.

Supporting Quality of Service (QoS) over the Internet is a very important issue and many mechanism have been already devised or are under way towards achieving this goal. One of the most important approaches is the class-based architecture, which provides a scalable mechanism for QoS support in a TCP/IP network. Class-based service differentiation can be realized without resource reservation, admission control and traffic policing. However, the resulting services are only relative. While it is, in principle, not feasible to provision for absolute guarantees without admission control and/or traffic policing, such a service can be reasonably well emulated using adaptive rate allocation at the link scheduler of routers. In this paper, we propose mechanism for link scheduler of router that achieve emulated absolute and other relative guarantees using dynamic weighted fair queueing (DWFQ) combining with class packet dropping. The weights of DWFQ are frequently adjusted to current load conditions and based on prediction of realistic class traffic. These mechanisms can realize many approaches to QoS guarantees and class-based differentiation.

In this paper we present a network layer based admission control and simple class based service differentiation model to support QoS in mobile ad hoc network. Our distributed admission control procedure works along with the route finding phase of reactive routing protocols for mobile ad hoc network (AODV, DSR etc). We also propose a simple class based distributed service differentiation system to support QoS once a traffic is admitted by our admission control mechanism. The proposed service differentiation is based on DiffServ model and includes modifications like configuration of each node with edge and core functionality, dynamic selection of edge/core functionality, use of minimal and simple classes. Simulation results show that our system allows seven times more real time traffic in the network than the proposed QoS for AODV model while satisfying the demanded end-to-end delay and providing low jitter.

Optical Burst Switching (OBS) has been developed as an efficient switching technique to exploit the capacity provided by Wavelength Division Multiplexing (WDM) transmission technology for the next generation optical Internet. One critical design issue in OBS is how to provide Quality-of-Service (QoS) on optical networks. In order to provide the service differentiation, we propose in this paper a buffer allocation algorithm to schedule bursts at the edge OBS nodes, a bandwidth allocation algorithm and a Fiber Delay Line (FDL) allocation algorithm to schedule bursts at the core OBS nodes. We also introduce a new burst assembly technique in which the burst is generated either when the sum of the collected packet sizes reaches the maximum threshold or when the burst assembling time reaches the timeout limit. Our simulation results show that the proposed algorithms achieve the controllable burst loss probability for different service classes. The bandwidth allocation algorithm performs very well at the core OBS nodes in terms of the low loss probability.