The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The development of telehaptic communication protocols has gained widespread focus over the past decade. Several protocols have been proposed for carrying out telehaptic activities over a shared network. However, a comprehensive analysis of the impact of the network crosstraffic on the telehaptic stream, and the feasibility of Quality of Service (QoS) compliance, is lacking in the literature. In this...
We consider the problem of optimal distributed scheduling for delay minimization in single-hop wireless networks. We focus on static scheduling policies, where the CSMA channel access rates are determined by the long-run traffic statistics, but not the instantaneous queue states. Such static scheduling is preferable over dynamic scheduling policies like max-weight when the traffic flows are heterogeneous...
We propose a network-based opportunistic improvisation to adaptive sampling for the forward channel telehaptic data stream on a time-varying network. The algorithm explores real-time tuning of the perceptual deadband parameter to minimize network underutilization, and consequently improves the quality of telehaptic communication. We describe in detail the rationale behind the design choices of the...
Spectrum holding per cellular telephony service provider in India is significantly lower than the world average. The spectrum is also severely fragmented across bands and the fragments also have different license conditions. Regulators in India have recently recognized that such spectrum fragmentation is a source of inefficiency for the service providers and have allowed sharing of spectrum among...
Motivated by cloud services with ad-supported revenues, we consider the interplay of network effects, congestion, and competition in determining the market structure in such environments. In particular, we study the strategic interactions between competing service providers and a user base, modeling congestion sensitivity and two forms of positive network effects: “firm-specific” versus “industry-wide...
This paper focuses on the design and analysis of scheduling policies for multi-class queues, such as those found in wireless networks and high-speed switches. In this context, we study the response time tail under generalized max-weight policies in settings where the traffic flows are highly asymmetric. Specifically, we study an extreme setting with two traffic flows, one heavy-tailed, and one light-tailed...
In this paper, we address two issues in multihop wireless networks—poor end-to-end delay performance and high per-slot computational overhead of the classical max-weight algorithm. To reduce the end-to-end delay, we first propose a simple modification to the classical maximum weight scheduling algorithm that promotes the use of shorter paths by the packets. The significantly lower delays are shown...
It has been recently discovered that heavy-tailed file completion time can result from protocol interaction even when file sizes are light-tailed. A key to this phenomenon is the RESTART feature where if a file transfer is interrupted before it is completed, the transfer needs to restart from the beginning. In this paper, we show that independent or bounded fragmentation produces light-tailed file...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.