We derive the waiting time in a queueing scheme, which an arriving job can be denied service with probability relative to queue size. Such scheme is generalization of tail-drop queue, when buffer (waiting room) full, and found computer networking, call centers other everyday life applications systems. To make model very general, we use arrival process enables shaping arbitrary interarrival dist...

One of user's queries from navigation service is to find the nearest facility in terms of time. The facility that is being questioned by the user as a destination may have a queuing service system (e.g. bank), which means that the cost function of the shortest path includes the waiting time at the destination as well as the travel time. This research conducts in the zone 1 of Mashhad with Bank ...

Abstract Computing a (short) path between two vertices is one of the most fundamental primitives in graph algorithmics. In recent years, study paths temporal graphs, that is, graphs where vertex set fixed but edge changes over time, gained more and attention. A time-respecting, or , if it uses edges with non-decreasing time stamps. We investigate basic constraint for paths, spent at each must n...