Database design principles for placement of delay-sensitive data on disks

1999 ◽  
Vol 11 (3) ◽  
pp. 425-447 ◽  
Author(s):  
S. Christodoulakis ◽  
F.A. Zioga
2018 ◽  
Vol 2018 ◽  
pp. 1-23 ◽  
Author(s):  
Mingfeng Huang ◽  
Anfeng Liu ◽  
Tian Wang ◽  
Changqin Huang

Energy-efficient data gathering techniques play a crucial role in promoting the development of smart portable devices as well as smart sensor devices based Internet of Things (IoT). For data gathering, different applications require different delay constraints; therefore, a delay Differentiated Services based Data Routing (DSDR) scheme is creatively proposed to improve the delay differentiated services constraint that is missed from previous data gathering studies. The DSDR scheme has three advantages: first, DSDR greatly reduces transmission delay by establishing energy-efficient routing paths (E2RPs). Multiple E2RPs are established in different locations of the network to forward data, and the duty cycles of nodes on E2RPs are increased to 1, so the data is forwarded by E2RPs without the existence of sleeping delay, which greatly reduces transmission latency. Secondly, DSDR intelligently chooses transmission method according to data urgency: the direct-forwarding strategy is adopted for delay-sensitive data to ensure minimum end-to-end delay, while wait-forwarding method is adopted for delay-tolerant data to perform data fusion for reducing energy consumption. Finally, DSDR make full use of the residual energy and improve the effective energy utilization. The E2RPs are built in the region with adequate residual energy and they are periodically rotated to equalize the energy consumption of the network. A comprehensive performance analysis demonstrates that the DSDR scheme has obvious advantages in improving network performance compared to previous studies: it reduces transmission latency of delay-sensitive data by 44.31%, reduces transmission latency of delay-tolerant data by 25.65%, and improves network energy utilization by 30.61%, while also guaranteeing the network lifetime is not lower than previous studies.


2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Sunil Kumar ◽  
Siddharth Khimsara ◽  
Kashyap Kambhatla ◽  
Kalyani Girivanesh ◽  
John D. Matyjas ◽  
...  

Node mobility in mobile ad hoc networks (MANETs) causes frequent route breakages and intermittent link stability. In this paper, we introduce a robust routing scheme, known as ad hoc on-demand multipath distance vector with dynamic path update (AOMDV-DPU), for delay-sensitive data transmission over MANET. The proposed scheme improves the AOMDV scheme by incorporating the following features: (i) a routing metric based on the combination of minimum hops and received signal strength indicator (RSSI) for discovery of reliable routes; (ii) alocal path updatemechanism which strengthens the route, reduces the route breakage frequency, and increases the route longevity; (iii) akeep alivemechanism for secondary route maintenance which enables smooth switching between routes and reduces the route discovery frequency; (iv) apacket salvagingscheme to improve packet delivery in the event of a route breakage; and (v) low HELLO packet overhead. The simulations are carried out in ns-2 for varying node speeds, number of sources, and traffic load conditions. Our AOMDV-DPU scheme achieves significantly higher throughput, lower delay, routing overhead, and route discovery frequency and latency compared to AOMDV. For H.264 compressed video traffic, AOMDV-DPU scheme achieves 3 dB or higher PSNR gain over AOMDV at both low and high node speeds.


Big Data ◽  
2020 ◽  
Author(s):  
Azath Mubarakali ◽  
Anand Deva Durai ◽  
Mohmmed Alshehri ◽  
Osama AlFarraj ◽  
Jayabrabu Ramakrishnan ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document