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.
The Internet architecture provides a mechanism for protecting individual flows from congestion, by introducing queue management and scheduling algorithms in Input-Queued switches having finite queue size to improve the QoS performance in terms of throughput and delay. Queue management algorithms manage the length of packet queues by dropping packets when necessary or appropriate, while Scheduling...
Clock skew scheduling is an efficient technique to minimize the cycle period by properly assigning clock delays to registers in a circuit. But its effectiveness is limited by the difficulty in implementing a large number of arbitrary clock skews. Multi-domain clock skew scheduling and prescribed-domain clock skew scheduling are two alternatives to overcome this shortage by restricting the number of...
Clock skew minimization is an important design consideration. However, with the advance of the technology and the smaller device scaling, Process, Voltage, and Temperature (PVT) variations make the clock skew minimization face great challenges. To mitigate the impact of PVT variations, many previous works proposed the Post Silicon Tuning (PST) architecture to dynamically balance the skew of a clock...
In wireless environment, the periodic moments of wireless networks may causes the fluctuation of available bandwidth by varying with time and location. The periodic fluctuation disturbs the resource distribution and Quality of Service (QoS). Qos design is the fundamental functionality of the networking router to enable differentiated delivery and to guarantee the delivery quality for different service...
Network-on-Chip (NoC) is becoming a promising communication architecture in place of dedicated interconnections and shared buses for embedded systems. Nevertheless, it has also created new design issue such as communication congestion and power consumption. A major factor leading to communication congestion is mapping of application tasks to NoC. Latency, throughput, and overall execution time are...
This paper develops a framework to analyze the latency and delay composition of workflows in a real-time networked aggregation system. These workflows are characterized by different sensor inputs that are processed along parallel branches that eventually merge or fuse to compute the aggregation result. The results for each flow must be produced within certain end-to-end deadlines or else the information...
We consider a path-scheduling problem at a resource constrained node A that transmits two types of flows to a given destination through alternate paths. Type-1 flow is assumed to have a higher priority than type-2 flow thus, it is never rejected upon arrival. Type-2 flow, on the other hand, may be denied admission to the queue. Once accepted to the system, a packet joins queue 1 and is guaranteed...
WiMAX (Worldwide Interoperability for Microwave Access) is emerging as one of the most promising technology for wireless communication network in metropolitan areas today. It is designed to provide different services such as voice, data and video with different type of QoS(Quality of Service). A scheduling scheme plays a very important role to achieve the QoS requirement. There are scheduling algorithms...
Quantum computers are exponentially faster than their classical counterparts in terms of solving some specific, but important problems. The biggest challenge in realizing a quantum computing system is the environmental noise. One way to decrease the effect of noise (and hence, reduce the overhead of building fault tolerant quantum circuits) is to reduce the latency of the quantum circuit that runs...
Aggregate scheduling in routers merges several flows into one aggregate flow. We propose an approach for computing the end-to-end delay bound of individual flows in a FIFO multiplexer under aggregate scheduling. A synthetic case study exhibits that the end-to-end delay bound is up to 33.6% tighter than the case without considering the traffic peak behavior.
The IEEE 802.16 defines two basic operational modes: point-to-multipoint (PMP) and mesh. The mesh mode provides two scheduling algorithms for assigning time slots to each network node: centralized and distributed. The aim of this paper is to address the Quality of Services (QoS) problem in coordinated distributed scheduling in mesh mode by proposing a new architecture for QoS-aware IEEE 802.16 mesh...
Machine to Machine (M2M) communications are expected to grow dramatically in next years. Scheduling techniques are determinant to achieve high spectral efficiency in wireless systems and to provide QoS guarantees to system users. In this work, several scheduling algorithms are evaluated in order to accommodate delay limited M2M communications over an LTE system. Simulation results show a reduction...
Cooperative schemes for critical content distribution over vehicular networks are presented and analyzed. The first scheme is based on unicasting from the base station, whereas the second is based on threshold based multicasting. Long Term Evolution (LTE) is used for long range communications with the base station (BS) and 802.11p is considered for inter-vehicle collaboration on the short range. A...
This paper introduces the first exact method for optimal resource sharing in a pipelined system in order to minimize area. Given as input a dependence graph and a throughput requirement, our approach searches through the space of legal resource allocations, performing both scheduling and optimal buffer insertion, in order to produce the minimum area implementation. Furthermore, we do not arbitrarily...
The present work proposes a communication system to ensure Internet connectivity and network transparency to a group of nodes within a vehicle in the heterogeneous wireless networks environment. It organizes routers and hosts located inside a vehicle into a mobile network. Each vehicle is equipped with multiple cares of addresses corresponding to multiple network interfaces. The proposed scheme provides...
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...
Police departments in the United States strive to schedule officers so that a number of benchmarks are met. The police administration is often asked to justify to local governing bodies the size of the police force. To assess the effects of force size and scheduling strategies on the ability to meet the benchmark goals, we develop a discrete-event simulation for the calls for service (CFS). Using...
Virtualization based cloud computing hosts networked applications in virtual machines (VMs), and provides each VM the desired degree of performance isolation using resource isolation mechanisms. Existing isolation solutions address heavily on resource proportionality such as CPU, memory and I/O bandwidth, but seldom focus on resource provisioning rate. Even the VM is allocated with adequate resources,...
FPGA dynamic partial reconfiguration (DPR) tend to be adopted for its flexibility and fewer resource consumption increasingly in hardware implementation, especially in communication devices. A crossbar scheduling algorithm is used to schedule the crossbar, or decide the order in which cells will be served. The is lip and FIRM are two classic crossbar scheduling algorithms, but they do not support...
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...
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.