Browsing by Subject "delay"
Now showing 1 - 6 of 6
Results Per Page
Sort Options
Item Delay-sensitive Communications Code-Rates, Strategies, and Distributed Control(2012-02-14) Parag, ParimalAn ever increasing demand for instant and reliable information on modern communication networks forces codewords to operate in a non-asymptotic regime. To achieve reliability for imperfect channels in this regime, codewords need to be retransmitted from receiver to the transmit buffer, aided by a fast feedback mechanism. Large occupancy of this buffer results in longer communication delays. Therefore, codewords need to be designed carefully to reduce transmit queue-length and thus the delay experienced in this buffer. We first study the consequences of physical layer decisions on the transmit buffer occupancy. We develop an analytical framework to relate physical layer channel to the transmit buffer occupancy. We compute the optimal code-rate for finite-length codewords operating over a correlated channel, under certain communication service guarantees. We show that channel memory has a significant impact on this optimal code-rate. Next, we study the delay in small ad-hoc networks. In particular, we find out what rates can be supported on a small network, when each flow has a certain end-to-end service guarantee. To this end, service guarantee at each intermediate link is characterized. These results are applied to study the potential benefits of setting up a network suitable for network coding in multicast. In particular, we quantify the gains of network coding over classic routing for service provisioned multicast communication over butterfly networks. In the wireless setting, we study the trade-off between communications gains achieved by network coding and the cost to set-up a network enabling network coding. In particular, we show existence of scenarios where one should not attempt to create a network suitable for coding. Insights obtained from these studies are applied to design a distributed rate control algorithm in a large network. This algorithm maximizes sum-utility of all flows, while satisfying per-flow end-to-end service guarantees. We introduce a notion of effective-capacity per communication link that captures the service requirements of flows sharing this link. Each link maintains a price and effective-capacity, and each flow maintains rate and dissatisfaction. Flows and links update their respective variables locally, and we show that their decisions drive the system to an optimal point. We implemented our algorithm on a network simulator and studied its convergence behavior on few networks of practical interest.Item Exploiting level sensitive latches in wire pipelining(Texas A&M University, 2005-02-17) Seth, VikramThe present research presents procedures for exploitation of level sensitive latches in wire pipelining. The user gives a Steiner tree, having a signal source and set of destination or sinks, and the location in rectangular plane, capacitive load and required arrival time at each of the destinations. The user also defines a library of non-clocked (buffer) elements and clocked elements (flip-flop and latch), also known as synchronous elements. The first procedure performs concurrent repeater and synchronous element insertion in a bottom-up manner to find the minimum latency that may be achieved between the source and the destinations. The second procedure takes additional input (required latency) for each destination, derived from previous procedure, and finds the repeater and synchronous element assignments for all internal nodes of the Steiner tree, which minimize overall area used. These procedures utilize the latency and area advantages of latch based pipelining over flip-flop based pipelining. The second procedure suggests two methods to tackle the challenges that exist in a latch based design. The deferred delay padding technique is introduced, which removes the short path violations for latches with minimal extra cost.Item Flow Control of Real Time Multimedia Applications Using Model Predictive Control with a Feed Forward Term(2011-02-22) Duong, Thien ChiMultimedia applications over the Internet are getting more and more popular. While non-real-time streaming services, such as YouTube and Megavideo, are attracting millions of visiting per day, real-time conferencing applications, of which some instances are Skype and Yahoo Voice Chat, provide an interesting experience of communication. Together, they make the fancy Internet world become more and more amusing. Undoubtedly, multimedia flows will eventually dominate the computer network in the future. As the population of multimedia flows increases gradually on the Internet, quality of their service (QoS) is more of a concern. At the moment, the Internet does not have any guarantee on the quality of multimedia services. To completely surpass this limitation, modifications to the network structure is a must. However, it will take years and billions of dollars in investment to achieve this goal. Meanwhile, it is essential to find alternative ways to improve the quality of multimedia services over the Internet. In the past few years, many endeavors have been carried on to solve the problem. One interesting approach focuses on the development of end-to-end congestion control strategies for UDP multimedia flows. Traditionally, packet losses and delays have been commonly used to develop many known control schemes. Each of them only characterizes some different aspects of network congestion; hence, they are not ideal as feedback signals alone. In this research, the flow accumulation is the signal used in feedback for flow control. It has the advantage of reflecting both packet losses and delays; therefore, it is a better choice. Using network simulations, the accumulations of real-time audio applications are collected to construct adaptive flow controllers. The reason for choosing these applications is that they introduce more control challenges than non-real-time services. One promising flow control strategy was proposed by Bhattacharya and it was based on Model Predictive Control (MPC). The controller was constructed from an ARX predictor. It was demonstrated that this control scheme delivers a good QoS while reducing bandwidth use in the controlled flows by 31 percent to 44 percent. However, the controller sometime shows erratic response and bandwidth usage jumps frequently between lowest and highest values. This is not desirable. For an ideal controller, the controlled bandwidth should vary near its mean. To eliminate the deficiency in the strategy proposed by Bhattacharya, it is proposed to introduce a feed forward term into the MPC formulation, in addition to the feedback terms. Simulations show that the modified MPC strategy maintains the benefits of the Bhattacharya strategy. Furthermore, it increases the probability of bandwidth savings from 58 percent for the case of Bhattacharya model to about 99 percent for this work.Item Power supply noise in delay testing(2009-05-15) Wang, JingAs technology scales into the Deep Sub-Micron (DSM) regime, circuit designs have become more and more sensitive to power supply noise. Excessive noise can significantly affect the timing performance of DSM designs and cause non-trivial additional delay. In delay test generation, test compaction and test fill techniques can produce excessive power supply noise. This will eventually result in delay test overkill. To reduce this overkill, we propose a low-cost pattern-dependent approach to analyze noise-induced delay variation for each delay test pattern applied to the design. Two noise models have been proposed to address array bond and wire bond power supply networks, and they are experimentally validated and compared. Delay model is then applied to calculate path delay under noise. This analysis approach can be integrated into static test compaction or test fill tools to control supply noise level of delay tests. We also propose an algorithm to predict transition count of a circuit, which can be applied to control switching activity during dynamic compaction. Experiments have been performed on ISCAS89 benchmark circuits. Results show that compacted delay test patterns generated by our compaction tool can meet a moderate noise or delay constraint with only a small increase in compacted test set size. Take the benchmark circuit s38417 for example: a 10% delay increase constraint only results in 1.6% increase in compacted test set size in our experiments. In addition, different test fill techniques have a significant impact on path delay. In our work, a test fill tool with supply noise analysis has been developed to compare several test fill techniques, and results show that the test fill strategy significant affect switching activity, power supply noise and delay. For instance, patterns with minimum transition fill produce less noise-induced delay than random fill. Silicon results also show that test patterns filled in different ways can cause as much as 14% delay variation on target paths. In conclusion, we must take noise into consideration when delay test patterns are generated.Item The effect of weaving maneuvers on operation of a free right-turn lane at ramp terminals(Texas A&M University, 2006-04-12) Park, MinchulService interchange ramp terminals provide access from the local highway or urban street system to the freeway. In urban areas, the ramp terminals at the arterial road are usually signalized for separation of all high-volume conflicting movements. If right-turn or other movements exiting from the ramp terminals are high, a free right-turn lane, which improves operations for right-turn and through exiting traffic, is sometimes provided at the ramp terminals with an exclusive lane for right-turn vehicles on a departure leg. If the ramp terminal is closely followed by the next downstream intersection, weaving maneuvers will occur since some vehicles make a right turn at the ramp terminal and make a left turn at the downstream intersection. These weaving vehicles usually slow down or stop on the free right-turn lane in order to find an acceptable gap in the arterial road traffic. These slowing or stopping vehicles may cause safety and operational problems. This research evaluates the effect of these weaving maneuvers on the operations of a free right-turn lane at the ramp terminals. To provide a means for evaluating free right-turn lane operations, a linear regression model was developed to predict the delay on the free right-turn lane caused by stopped or slowed vehicles planning on making a weaving maneuver. The variables for this model were arterial through volumes, weaving volumes, number of lanes, and ramp spacing within the interchange. The regression model was based upon the results of the CORSIM traffic simulation model that was calibrated using field data obtained from the study site in College Station, Texas. Once the predicted model was developed, the model validation was performed using the field data to check the accuracy of its prediction. A statistical measure was performed for quantifying the difference between the observed and predicted delay on the free right turn lane. From the research results, it was concluded that the weaving maneuvers influence the operation of a free right-turn lane and cause delay on the free right-turn lane.Item Utilization-based delay guarantee techniques and their applications(2009-05-15) Wang, ShengquanMany real-time systems demand effective and efficient delay-guaranteed services to meet timing requirements of their applications. We note that a system provides a delay-guaranteed service if the system can ensure that each task will meet its predefined end-to-end deadline. Admission control plays a critical role in providing delayguaranteed services. The major function of admission control is to determine admissibility of a new task. A new task will be admitted into the system if the deadline of all existing tasks and the new task can be met. Admission control has to be efficient and efficient, meaning that a decision should be made quickly while admitting the maximum number of tasks. In this dissertation, we study a utilization-based admission control mechanism. Utilization-based admission control makes an admission decision based on a simple resource utilization test: A task will be admitted if the resource utilization is lower than a pre-derived safe resource utilization bound. The challenge of obtaining a safe resource utilization bound is how to perform delay analysis offline, which is the main focus of this dissertation. For this, we develop utilization-based delay guarantee techniques to render utilization-based admission control both efficient and effective, which is further confirmed with our data. We develop techniques for several systems that are of practical importance. We first consider wired networks with the Differentiated Services model, which is wellknown as its supporting scalable services in computer networks. We consider both cases of providing deterministic and statistical delay-guaranteed services in wired networks with the Differentiated Services model. We will then extend our work to wireless networks, which have become popular for both civilian and mission critical applications. The variable service capacity of a wireless link presents more of a challenge in providing delay-guaranteed services in wireless networks. Finally, we study ways to provide delayguaranteed services in component-based systems, which now serve as an important platform for developing a new generation of computer software. We show that with our utilization-based delay guarantee technique, component-based systems can provide efficient and effective delay-guaranteed services while maintaining such advantages as the reusability of components.