14,419 research outputs found
Distributed Queuing in Dynamic Networks
We consider the problem of forming a distributed queue in the adversarial
dynamic network model of Kuhn, Lynch, and Oshman (STOC 2010) in which the
network topology changes from round to round but the network stays connected.
This is a synchronous model in which network nodes are assumed to be fixed, the
communication links for each round are chosen by an adversary, and nodes do not
know who their neighbors are for the current round before they broadcast their
messages. Queue requests may arrive over rounds at arbitrary nodes and the goal
is to eventually enqueue them in a distributed queue. We present two algorithms
that give a total distributed ordering of queue requests in this model. We
measure the performance of our algorithms through round complexity, which is
the total number of rounds needed to solve the distributed queuing problem. We
show that in 1-interval connected graphs, where the communication links change
arbitrarily between every round, it is possible to solve the distributed
queueing problem in O(nk) rounds using O(log n) size messages, where n is the
number of nodes in the network and k <= n is the number of queue requests.
Further, we show that for more stable graphs, e.g. T-interval connected graphs
where the communication links change in every T rounds, the distributed queuing
problem can be solved in O(n+ (nk/min(alpha,T))) rounds using the same O(log n)
size messages, where alpha > 0 is the concurrency level parameter that captures
the minimum number of active queue requests in the system in any round. These
results hold in any arbitrary (sequential, one-shot concurrent, or dynamic)
arrival of k queue requests in the system. Moreover, our algorithms ensure
correctness in the sense that each queue request is eventually enqueued in the
distributed queue after it is issued and each queue request is enqueued exactly
once. We also provide an impossibility result for this distributed queuing
problem in this model. To the best of our knowledge, these are the first
solutions to the distributed queuing problem in adversarial dynamic networks.Comment: In Proceedings FOMC 2013, arXiv:1310.459
Based on Regular Expression Matching of Evaluation of the Task Performance in WSN: A Queue Theory Approach
Due to the limited resources of wireless sensor network, low efficiency of real-time communication scheduling, poor safety defects, and so forth, a queuing performance evaluation approach based on regular expression match is proposed, which is a method that consists of matching preprocessing phase, validation phase, and queuing model of performance evaluation phase. Firstly, the subset of related sequence is generated in preprocessing phase, guiding the validation phase distributed matching. Secondly, in the validation phase, the subset of features clustering, the compressed matching table is more convenient for distributed parallel matching. Finally, based on the queuing model, the sensor networks of task scheduling dynamic performance are evaluated. Experiments show that our approach ensures accurate matching and computational efficiency of more than 70%; it not only effectively detects data packets and access control, but also uses queuing method to determine the parameters of task scheduling in wireless sensor networks. The method for medium scale or large scale distributed wireless node has a good applicability
Self-Organization in Traffic Lights: Evolution of Signal Control with Advances in Sensors and Communications
Traffic signals are ubiquitous devices that first appeared in 1868. Recent
advances in information and communications technology (ICT) have led to
unprecedented improvements in such areas as mobile handheld devices (i.e.,
smartphones), the electric power industry (i.e., smart grids), transportation
infrastructure, and vehicle area networks. Given the trend towards
interconnectivity, it is only a matter of time before vehicles communicate with
one another and with infrastructure. In fact, several pilots of such
vehicle-to-vehicle and vehicle-to-infrastructure (e.g. traffic lights and
parking spaces) communication systems are already operational. This survey of
autonomous and self-organized traffic signaling control has been undertaken
with these potential developments in mind. Our research results indicate that,
while many sophisticated techniques have attempted to improve the scheduling of
traffic signal control, either real-time sensing of traffic patterns or a
priori knowledge of traffic flow is required to optimize traffic. Once this is
achieved, communication between traffic signals will serve to vastly improve
overall traffic efficiency
Combining distributed queuing with energy harvesting to enable perpetual distributed data collection applications
This is the peer reviewed version of the following article: Vazquez-Gallego F, Tuset-Peiró P, Alonso L, Alonso-Zarate J. Combining distributed queuing with energy harvesting to enable perpetual distributed data collection applications. Trans Emerging Tel Tech. 2017;e3195 , which has been published in final form at https://doi.org/10.1002/ett.3195. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.This paper presents, models, and evaluates energy harvesting–aware distributed queuing (EH-DQ), a novel medium access control protocol that combines distributed queuing with energy harvesting (EH) to address data collection applications in industrial scenarios using long-range and low-power wireless communication technologies. We model the medium access control protocol operation using a Markov chain and evaluate its ability to successfully transmit data without depleting the energy stored at the end devices. In particular, we compare the performance and energy consumption of EH-DQ with that of time-division multiple access (TDMA), which provides an upper limit in data delivery, and EH-aware reservation dynamic frame slotted ALOHA, which is an improved variation of frame slotted ALOHA. To evaluate the performance of these protocols, we use 2 performance metrics: delivery ratio and time efficiency. Delivery ratio measures the ability to successfully transmit data without depleting the energy reserves, whereas time efficiency measures the amount of data that can be transmitted in a certain amount of time. Results show that EH-DQ and TDMA perform close to the optimum in data delivery and outperform EH-aware reservation dynamic frame slotted ALOHA in data delivery and time efficiency. Compared to TDMA, the time efficiency of EH-DQ is insensitive to the amount of harvested energy, making it more suitable for energy-constrained applications. Moreover, compared to TDMA, EH-DQ does not require updated network information to maintain a collision-free schedule, making it suitable for very dynamic networks.Peer ReviewedPostprint (author's final draft
Dynamic Load-Balancing Vertical Control for Large-Scale Software-Defined Internet of Things
As the global Internet of things increasingly is popular with consumers and
business environment, network flow management has become an important topic to
optimize the performance on Internet of Things. The rigid existing Internet of
things (IoT) architecture blocks current traffic management technology to
provide a real differentiated service for large-scale IoT. Software-defined
Internet of Things (SD-IoT) is a new computing paradigm that separates control
plane and data plane, and enables centralized logic control. In this paper, we
first present a general framework for SD-IoT, which consists of two main
components: SD-IoT controllers and SD-IoT switches. The controllers of SD-IoT
uses resource pooling technology, and the pool is responsible for the
centralized control of the entire network. The switches of SD-IoT integrate
with the gateway functions, which is responsible for data access and
forwarding. The SD-IoT controller pool is designed as a vertical control
architecture, which includes the main control layer and the base control layer.
The controller (main controller) of the main control layer interacts upward
with the application layer, interacts with the base control layer downwards,
and the controller (base controller) of the basic control layer interacts with
the data forwarding layer. We propose a dynamic balancing algorithm of the main
controller based on election mechanism and a dynamic load balancing algorithm
of the basic controller based on the balanced delay, respectively. The
experimental results show that the dynamic balancing algorithm based on the
election mechanism can ensure the consistency of the messages between the main
controllers, and the dynamic load balancing algorithm based on the balanced
delay can balance between these different workloads in the basic controllers.Comment: 25 pages, 10 figure
Response-Time-Optimized Distributed Cloud Resource Allocation
A current trend in networking and cloud computing is to provide compute
resources over widely dispersed places exemplified by initiatives like Network
Function Virtualisation. This paves the way for a widespread service deployment
and can improve service quality; a nearby server can reduce the user-perceived
response times. But always using the nearest server is a bad decision if that
server is already highly utilized.
This paper investigates the optimal assignment of users to widespread
resources -- a convex capacitated facility location problem with integrated
queuing systems. We determine the response times depending on the number of
used resources. This enables service providers to balance between resource
costs and the corresponding service quality. We also present a linear problem
reformulation showing small optimality gaps and faster solving times; this
speed-up enables a swift reaction to demand changes. Finally, we compare
solutions by either considering or ignoring queuing systems and discuss the
response time reduction by using the more complex model. Our investigations are
backed by large-scale numerical evaluations
A Comparative Study of SIP Overload Control Algorithms
Recent collapses of SIP servers in the carrier networks indicates two
potential problems of SIP: (1) the current SIP design does not easily scale up
to large network sizes, and (2) the built-in SIP overload control mechanism
cannot handle overload conditions effectively. In order to help carriers
prevent widespread SIP network failure effectively, this chapter presents a
systematic investigation of current state-of-the-art overload control
algorithms. To achieve this goal, this chapter first reviews two basic
mechanisms of SIP, and summarizes numerous experiment results reported in the
literatures which demonstrate the impact of overload on SIP networks. After
surveying the approaches for modeling the dynamic behaviour of SIP networks
experiencing overload, the chapter presents a comparison and assessment of
different types of SIP overload control solutions. Finally it outlines some
research opportunities for managing SIP overload control.Comment: Network and Traffic Engineering in Emerging Distributed Computing
Applications, Edited by J. Abawajy, M. Pathan, M. Rahman, A.K. Pathan, and
M.M. Deris, IGI Global, 2012, pp. 1-2
Toward Optimal Performance with Network Assisted TCP at Mobile Edge
In contrast to the classic fashion for designing distributed end-to-end (e2e)
TCP schemes for cellular networks (CN), we explore another design space by
having the CN assist the task of the transport control. We show that in the
emerging cellular architectures such as mobile/multi-access edge computing
(MEC), where the servers are located close to the radio access network (RAN),
significant improvements can be achieved by leveraging the nature of the
logically centralized network measurements at the RAN and passing information
such as its minimum e2e delay and access link capacity to each server.
Particularly, a Network Assistance module (located at the mobile edge) will
pair up with wireless scheduler to provide feedback information to each server
and facilitate the task of congestion control. To that end, we present two
Network Assisted schemes called NATCP (a clean-slate design replacing TCP at
end-hosts) and NACubic (a backward compatible design requiring no change for
TCP at end-hosts). Our preliminary evaluations using real cellular traces show
that both schemes dramatically outperform existing schemes both in single-flow
and multi-flow scenarios.Comment: To appear in USENIX's HotEdge 201
Real Time scheduling with Virtual Nodes for Self Stabilization in Wireless Sensor Networks
In this paper we propose a new scheduling algorithm called Real Time
Scheduling (RTS) which uses virtual nodes for self stabilization. This
algorithm deals with all the contributing components of the end-to-end
travelling delay of data packets in sensor network and with virtual nodes
algorithm achieves QoS in terms of packet delivery, multiple connections,
better power management and stable routes in case of failure. RTS delays
packets at intermediate hops (not just prioritizes them) for a duration that is
a function of their deadline. Delaying packets allows the network to avoid hot
spotting while maintaining deadline-faithfulness. We compare RTS with another
prioritizing and scheduling algorithm for real-time data dissemination in
sensor networks, velocity monotonic scheduling. This paper simulates RTS based
on two typical routing protocols, shortest path routing and greedy forwarding
with J-Sim.Comment: arXiv admin note: substantial text overlap with arXiv:cs/0608069 by
other authors without attributio
Communication models for monitoring and mobility verification in mission critical wireless networks
Recent technological advances have seen wireless sensor networks emerge as an interesting research topic because of its ability to realize mission critical applications like in military or wildfire detection. The first part of the thesis focuses on the development of a novel communication scheme referred here as a distributed wireless critical information-aware maintenance network (DWCIMN), which is presented for preventive maintenance of network-centric dynamic systems. The proposed communication scheme addresses quality of service (QoS) issues by using a combination of a head-of-the-line queuing scheme, efficient bandwidth allocation, weight-based backoff mechanism, and a distributed power control scheme. A thorough analysis of a head-of-the-line priority queuing scheme is given for a single-server, finite queue with a batch arrival option and user priorities. The scheme is implemented in the Network Simulator (NS-2), and the results demonstrate reduced queuing delays and efficient bandwidth allocation for time-critical data over non time critical data. In the second part, we introduce a unique mobility verification problem in wireless sensor networks wherein the objective is to verify the claimed mobility path of a node in a co-operating mission critical operation between two allies. We address this problem by developing an efficient power-control based mobility verification model. The simulation framework is implemented in Matlab and the results indicate successful detection of altered claimed paths within a certain error bound --Abstract, page iii
- …