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.
Owed to its regular structure and rich interweaving, facilitating simple and efficient dissemination and aggregation of data, the hypercube is an effective and popular interconnection network for parallel and distributed computing. Its short paths make it suitable for latency critical real-time applications such as live streaming or estimation of system state vectors, including object tracking or...
Message Ferrying is a mobility assisted scheme in which a special node, called a message ferry, is tasked with delivering data among a set of disconnected wireless nodes. One key challenge for such scheme is to design the ferry route in a way that improves certain network characteristics such as average data delivery delay or data loss ratio. Previous work has optimized ferry travel time, rather than...
In P2P (Peer-to-Peer) VoD (Video-on-Demand) System, data scheduling strategy is critical to make full use of node resource in P2P network, and it can help optimize user experience as well as system throughput. But for a normal peer how to efficiently schedule media data still remains a challenging task. The kind of problem is NP-hard problem due to the dynamic characteristics of P2P network. This...
Scheduling schemes of wireless networks determine packet transmission opportunities for each network node by considering network parameters such as link quality, transmission rate, and delay. However, security has not been taken into account in these schemes, although it plays a critical role in network performance. In this paper a new scheduling scheme is proposed to determine packet transmissions...
In the paper, we consider the end-to-end routing and link scheduling problem for multi-hop wireless sensor networks. The efficient link scheduler under our consideration is intended to assign time slots to different users so as to minimize channel usage subject to constraints on data rate, delay bound, and delay bound violation probability. We also present a coupled robust multi-path routing structure...
Transmission scheduling to improve the capacity in wireless mesh networks (WMNs) is challenging. One promising candidate solution is backpressure scheduling, which was shown to provide throughput optimality and queue stability. Several recent practical systems that implement approximations of backpressure scheduling show performance benefits in WMNs that are based on IEEE 802.11, which is the most...
Vehicular Delay-Tolerant Networks (VDTNs) are a disruptive network architecture based on delay-tolerant network paradigm, gathering contributions from opportunistic and cooperative networks, and optical burst switching paradigm. VDTNs assume out-of-band signaling and handle non-real time applications with a low cost network infrastructure. In VDTNs, vehicles are opportunistically exploited to carry...
Perceptual visual quality guarantee is of vital concern for the P2P streaming systems. One of the challenging issues for assuring overall video quality in mesh-based P2P streaming is to design an effective media chunk scheduler. To the best of our knowledge, there is still a lack of studies on integrating video characteristics into P2P media chunk scheduler. Video packets do not contribute evenly...
Recently, some push-pull scheduling strategies have been proposed to replace the pull mechanism in mesh based P2P streaming systems. A push-pull mechanism is more efficient in terms of the overheads and leads to a much better playback delay performance since the pull part is mainly used either at startup or to recover lost content. In this work we combine the low scheduling delays of push scheduling...
In most existing handshake-based collision avoidance protocols, nodes in the proximity of the transmitter or receiver are kept silent during an ongoing communication session. In this paper, we utilize the long propagation delay in the underwater acoustic channel and the (possible) sparsity of the network topology to increase network throughput. We formalize conditions for which a node can transmit...
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for energy conservation in WSNs, random walks have been popular for many delay-tolerant applications in WSNs due to their many inherent desirable properties. In this paper, we consider an opportunistic forwarding under an asynchronous...
IEEE 802.16 based wireless mesh networks (WMNs) are a promising broadband access solution to support flexibility, cost effectiveness and fast deployment of the fourth generation infrastructure based wireless networks. Reducing the time for channel establishment is critical for low latency/interactive applications. In this paper, we propose two modifications to the election based transmission timing...
IEEE 802.16 supports both single-hop and multi-hop mesh modes. It defines several traffic and service categories and offers differentiated quality of service (QoS) through scheduling algorithms. In IEEE 802.16, a three-way handshaking mechanism is given to reserve the slots hop-by-hop for mesh networks, which is called Hop-by-hop Bandwidth Reservation Protocol (HBRP). However, HBRP can not assure...
In Wireless Sensor Network (WSN), one of the primary issues is energy conservation for extending network lifetime. Communication protocols for WSN help reduce the energy consumption via adopting sleep scheduling in the network. Random sleep scheduling is a desirable mechanism for its simplicity and steady duty cycle. However, the low duty cycle sleeping of nodes may destroy the connectivity of network,...
The adoption of scalable encoders can improve P2P-TV performance in heterogeneous scenarios, where peers with different capabilities coexist. In fact, each peer could dynamically adapt the resolution of the audio/video signals to its computation capabilities and available communication resources. Despite these clear benefits, casting a scalable encoder in a P2P-TV system requires sophisticated scheduling...
In order to evaluate the influence of neighbors' quality to P2P streaming system's performance during scheduling, this paper establishes a markov chain based differential function model to analyze the relationship between peer's average startup delay and probability neighbors have wanted data as well as neighbors' available upload bandwidth. This paper also proposes a scheduling feedback algorithm,...
This paper computes end-to-end delay bounds for prioritized data flows in disruption-tolerant networks (DTNs). DTNs suffer intermittent connectivity among nodes due to node mobility. When deployed in mission-critical applications, such as disaster response, an interesting question becomes to quantify end-to-end packet delays under assumptions on node mobility. In this paper, we answer this question...
In current live Peer-to-Peer (P2P) streaming systems, buffering delay is too large compared with the channel switching delay of traditional TV service provided by cable companies. In this paper, network coding is applied to a live P2P streaming system to minimize the buffering delay that users experience. A new scheduling algorithm is designed, with server-push mechanism and intelligent method for...
This paper presents a fully decentralized just-in-time workflow scheduling method in a P2P Grid system. The proposed solution allows each peer node to autonomously dispatch inter-dependent tasks of workflows to run on geographically distributed computers. To reduce the workflow completion time and enhance the overall execution efficiency, not only does each node perform as a scheduler to distribute...
Grid systems tend to grow in size, but currently deployed state-of-the-art schedulers have inherent scalability limits due to centralization and high messaging cost. In this paper, we explore the feasibility of scalable grid scheduling using a peer-to-peer overlay. We propose DGSASAP, a decentralized scheduling algorithm that schedules compute-intensive jobs such that their execution starts as soon...
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.