4 May 2018 in Transportation Research Record: Journal of the Transportation Research Board
AAArun Prakash Akkinepally
+4
Among the new transportation services made possible by the introduction of automated vehicles, automated mobility-on-demand (AMoD) has attracted a lot of attention from both industry and researchers. AMoD provides a service similar to taxi or ride-sharing services, while being driverless. It is expected to attract a huge fraction of travelers currently using mass transit or private vehicles and will have a disruptive effect on urban transportation. While most studies have focused on the operational efficiency of the technology itself, our work aims to investigate its impact on urban mobility. Our contribution is two-fold. First, we present a flexible AMoD modeling and simulation framework developed within a multi-modal agent-based urban simulation platform (SimMobility). The framework allows the detailed simulation and assessment of different AMoD operations together with an activity-based framework that accounts for changes in demand, such as activity participation, trip making, mode, destination, or route choice decisions. Second, we focus our attention on the role of mass transit in a futuristic urban system where AMoD is widely available. Mass transit is already challenged by current ride-sharing services, for example, Uber and Lyft, which provide comparatively better and cheaper services. This trend will plausibly be exacerbated with the introduction of AMoD, which may indirectly act as a replacement to mass transit. Our simulation results show that mass transit is irreplaceable, despite the high efficiency of AMoD, in order to avoid congestion and maintain a sustainable urban transportation system with acceptable levels of service.
14 May 2015 in IEEE Transactions on Parallel and Distributed Systems
Albeit an important goal of caching is traffic reduction, a perhaps even more important aspect follows from the above achievement: the reduction of internet service provider (ISP) operational costs that comes as a consequence of the reduced load on transit and provider links. Surprisingly, to date this crucial aspect has not been properly taken into account in cache design. In this paper, we show that the classic caching efficiency indicator, i.e., the hit ratio, conflicts with cost. We therefore propose a mechanism whose goal is the reduction of cost and, in particular, we design a cost-aware (CoA) cache decision policy that, leveraging price heterogeneity among external links, tends to store with more probability the objects that the ISP has to retrieve through the most expensive links. We provide a model of our mechanism, based on Che's approximation, and, by means of a thorough simulation campaign, we contrast it with traditional cost-blind schemes, showing that CoA yields a significant cost saving, that is furthermore consistent over a wide range of scenarios. We show that CoA is easy to implement and robust, making the proposal of practical relevance.
31 January 2018 in IEEE/ACM Transactions on Networking
In-network caching is an appealing solution to cope with the increasing bandwidth demand of video, audio, and data transfer over the Internet. Nonetheless, in order to protect consumer privacy and their own business, content providers (CPs) increasingly deliver encrypted content, thereby preventing Internet service providers (ISPs) from employing traditional caching strategies, which require the knowledge of the objects being transmitted. To overcome this emerging tussle between security and efficiency, in this paper we propose an architecture in which the ISP partitions the cache space into slices, assigns each slice to a different CP, and lets the CPs remotely manage their slices. This architecture enables transparent caching of encrypted content and can be deployed in the very edge of the ISP's network (i.e., base stations and femtocells), while allowing CPs to maintain exclusive control over their content. We propose an algorithm, called SDCP, for partitioning the cache storage into slices so as to maximize the bandwidth savings provided by the cache. A distinctive feature of our algorithm is that ISPs only need to measure the aggregated miss rates of each CP, but they need not know the individual objects that are requested. We prove that the SDCP algorithm converges to a partitioning that is close to the optimal, and we bound its optimality gap. We use simulations to evaluate SDCP's convergence rate under stationary and nonstationary content popularity. Finally, we show that SDCP significantly outperforms traditional reactive caching techniques, considering both CPs with perfect and with imperfect knowledge of their content popularity.
19 April 2023 in Transportation Research Part C: Emerging Technologies