Packet switched networks offer a particularly challenging research subject to the control community: the dynamics of a network buffer, their simplest component, are nonlinear and exhibit a saturation effect that cannot be neglected. In many practical cases, networks are made up of the interconnection of a large number of such basic elements. This gives rise to high dimensional nonlinear systems for which few general results exist today in the literature. Furthermore, these physical interconnections that may sometimes span a very long distance induce a transmission delay and the queues in intermediary nodes induce a buffering delay. Finding a model able to both take into account as much of this complexity as possible while being simple enough to be analysed mathematically and used for control purposes is the first objective of this thesis. To accomplish this goal, a so-called "fluid-flow model" based on fluid exchange between buffers is presented. Neglecting the transmission and propagation delays, this model concentrates on the dynamics of the buffer loads and is particularly well suited for a mathematical analysis. Throughout the work, a systematic system point of view is adopted in an effort to perform a rigorous analysis using tools from automatic control and dynamical systems theory. This model is then used to study a feedback control law where each node receives state information from its directly connected neighbours, hence referred to as hop-by-hop control. The properties of the closed-loop system are analysed and a global stability analysis is performed using existing results from the compartmental and cooperative system literature. The global mass conservation typically ensured by end-to-end control protocols is studied in the last chapter using, once again, a compartmental framework. Finally, a numerical study of a strategy combining the end-to-end and the hop-by-hop approaches is presented. It is shown that problems encountered with hop-by-hop control may then be successfully alleviated.

<p> <p>&nbsp / </p> </p> <p align="left">IP multicast is an efficient mechanism for simultaneously transmitting bulk data to multiple receivers. Many applications can benefit from multicast, such as audio and videoconferencing, multi-player games, multimedia broadcasting, distance education, and data replication. For either technical or policy reasons, IP multicast still has not yet been deployed in today&rsquo / s Internet. Congestion is one of the most important issues impeding the development and deployment of IP multicast and multicast applications.</p>

The subject of this paper is the congestion tax in Stockholm, Sweden. The study has been conducted with the purpose to examine of how public attitudes towards congestion charging looks and the reason behind the attitude. And also to examine if there are any differences in attitudes between those living inside and outside the payment zones, between men and women and between car owners and those who do not own a car or have a driver's license. The study used a questionnaire sent out electronically to a group of friends of friends and of friends’ family members. The respondents think it´s very important to present a better option if price incitements are to be used; in this case the better option is public transportation. Revenues should be spent so that large amounts go to the public transportation. There were no attitude differences between residents living inside the payment zones and those living outside the payment zones and between men and women. There is an attitude difference between those who own a car and those who do not own a car or have a driver's license. Those who own a car are more negative to the congestion charge than those who do not own a car or have a driver's license. This is believed to diminish if information is given to the public on how the revenue is spent and if congestion charge is introduced in several of the larger cities in Sweden.

A Mobile Ad Hoc Network (MANET) is a shared wireless network without any infrastructure, consisting of mobile nodes connected by wireless links. The nodes are free to move and organize themselves arbitrarily. The nodes in the network are therefore depending on each other in order to communicate over multiple hops. Due to the physical characteristics of wireless networks, the channel is time-varying, which makes it hard to both predict and sustain a bit rate level. The nodes’ mobility causes topology changes, and further load and capacity variations. Traditional usage areas are battlefield and disaster areas, while new areas like extended network coverage and gaming are emerging. Quality of Service (QoS) is needed in every network in order to differentiate traffic with different performance requirements, e.g. voice and e-mail applications. Providing QoS in wireless environments with varying conditions is complex, and hard guarantees can not be given. Consequently, the aim is to give differentiated treatment to traffic with different performance requirements. In addition, we can not study the MANET without considering fixed networks. Communication with fixed networks is important, for example by accessing the Internet. In this thesis the Differentiated Services (DiffServ) architecture is applied and adapted to MANETs. Using the same QoS architecture will ease the transition between the wireless and wired domain. But the special characteristics of wireless networks require modifications to the original DiffServ architecture. In investigations there was found restrictions on the number of classes to use, and this number was dependent on the type of traffic in the network. A QoS architecture based on the DiffServ framework is proposed, with an admission control based on the concept of shadow classes, and Explicit Congestion Notification (ECN) to avoid congestion. New flows are tested in a shadow class before getting admission to the network and its designated class. The shadow class has the same scheduling properties as the designated class, but is differentiated by a higher drop probability in the buffers. Both the admission control and ECN are thus build on the same principle by controlling the load from probabilistic functions in the buffers, and are studied to find their individual and combined effects. In wireless environments the probability of a packet loss increases with the number of hops, which gives services an unpredictable performance for users. A predictable service, independent of number of hops, is provided by scheduling based on the path information; the packets are differentiated based on the number of hops made or left to make, increasing the predictability at the cost of performance.

Since the implementation of the congestion charge in Gothenburg on the first of January 2013, there has been a debate whether or not the congestion charge would harm the retail business. This concerns, in particular the retail stores located in the charging zone. The general aim of this study was to investigate attitudes and consumer behavior related to the recently introduced congestion charge in Gothenburg and to illustrate the possible impact the congestion charge may have had on retail business performance. In order to do this we conducted a questionnaire survey of visitors to Bäckebol shopping center (n=335). The questionnaire consisted of 24 questions and the response rate was 76 %. In addition, we performed two extensive interviews with key representatives for the local retail business in order to add context and background to the questionnaire findings.  In the questionnaire, consumer behavior was investigated by questions on time of visit, destination, and means of transport. In the analyses we assessed associations between changes in consumer behavior, acceptance and demographic factors. The results of this study showed a low level of acceptance of the congestion charge in the study population. Furthermore, we found a high proportion of subjects reporting a behavioral change related to the introduction of the congestion charge. This was associated to but not explained by a low level of acceptance. It was also related to residency outside the inner parts of Gothenburg.  In this way our results support the theory of an association between behavioral change, degree of acceptance as well as demographic factors. However, in a comparison of certain aspects of behavioral change to a previous study conducted prior to the introduction of the congestion charge we found no difference. It is likely that behavioral changes related to the congestion charge have taken place but they may have been exaggerated in the questionnaire responses. The interviews implied that the congestion charge has had an effect on business performance in Gothenburg but in this investigation we have not been able to find firm proof of this. We can conclude that there appears to be a low acceptance of the congestion charge in particular in suburban areas of Gothenburg and this is most likely associated with a consumer behavioral change.  For further research it would be interesting to obtain information on business performance and customer frequencies before and after the introduction of the congestion charge. In addition it would be of interest to investigate in greater detail the association between acceptance and behavioral change and if retail stores that handle bulky goods are more likely to be affected by a congestion charges than other businesses.

Supply chain network design involves location decisions for production facilities and distribution centers. We consider a make-to-order supply chain environment where distribution centers serve as crossdocking terminals. Long waiting times may occur at a cross-docking terminal, unless sucient handling capacity is installed. In this study, we deal with a facility location problem with congestion eects at distribution centers. Along with location decisions, we make capacity allocation (service rate) and demand allocation decisions so that the total cost, including facility opening, transportation and congestion costs, is minimized. Response time to customer orders is a critical performance measure for a supply chain network. The decisions like where the plants and distribution centers are located aect the response time of the system. Response time is more sensitive to these decisions in a make-to-order business environment. In a distribution network where distribution centers function as cross-docking terminals, capacity or the service rate decisions also aect the response time performance. This study is closely related to a recent work Vidyarthi et al. (2009) which models distribution centers asM/G/1 queuing systems. They use the average waiting time formula ofM/G/1 queuing model. Thus, the average waiting time at a distribution center is a nonlinear function of the demand rate allocated to and the service rate available at the distribution center. The authors Vidyarthi et al. (2009) propose a linear approximation approach and a Lagrangian based heuristic for the problem. Dierent than the solution approach proposed in Vidyarthi et al. (2009), we propose a closed form formulation for the problem. In particular, we show that the waiting time function derived from M/G/1 queuing model can be represented via second order conic inequalities. Then, the problem becomes a mixed integer second order cone programming problem which can be solved by using commercial branch-and-bound software such as IBM ILOG CPLEX. Our computational tests show that proposed reformulation can be solved in reasonable CPU times for practical size instances.

The amount of distributed generation (DG) is increasing worldwide, and it is located in distribution networks close to consumers or even in the consumers¡¦ side of the meter. Therefore, the net demand to be supplied through transmission and distribution networks may decrease, allowing to postpone reinforcement of existing networks. This thesis presents a methodology for assessing the potential benefits of using non--constructional reinforcement strategies to relieve distribution network congestion and increase the utilization of the network assets. Due to the randomness of involved variables (load demand patterns, DG hourly production, DG availability, etc.), a simulation approach is used to model the uncertainties. The benefits of DG, energy storage (ES), and demand response (DR) on congestion relief and investment deferment are evaluated. The analyzed items include: the distribution network investment avoided cost, levelized annual cost, hourly overload probability, and hourly overload risk. Simulation results indicate the potential benefits of non--traditional strategies in increasing the distribution network utilization and relieving network congestion.

A packet will be dropped when it arrives at a congested node in a routing path. The authors of [22] proposed the CRP protocol that can alleviate the congestion problem by splitting the traffic to the bypass nodes. In this thesis, we propose a new routing protocol, called MIMO-assisted congestion-adaptive routing protocol (MCRP for short), for multi-hop mobile ad hoc networks (MANETs for short). In MCRP, nodes periodically record the information of their rate-link/range-link neighbors. MCRP alleviates the congestion problem by dynamically adjusting the MIMO antenna mode and splitting the traffic to the downstream range-link neighbors. In addition, MCRP can quickly reestablish the routing path when it is broken due to node failure or mobility. Simulation results show that MCRP outperforms the existing protocols in terms of packet delivery ratio and end-to-end throughput.

The objective of this research is to develop distributed approaches to optimizing network traffic. Two problems are studied, which include exploiting social networks in routing packets (coupons) to desired network nodes (users in the social network), and developing a rate based transport protocol, which will guarantee that all the flows in a network (e.g. Internet) meet a delay constraint per packet. Firstly, we will study social networks as a means of obtaining information about a system. They are increasingly seen as a means of obtaining awareness of user preferences. Such awareness could be used to target goods and services at them. We consider a general user model, wherein users could buy different numbers of goods at a marked and at a discounted price. Our first objective is to learn which users would be interested in a particular good. Second, we would like to know how much to discount these users such that the entire demand is realized, but not so much that profits are decreased. We develop algorithms for multihop forwarding of such discount coupons over an online social network, in which users forward coupons to each other in return for a reward. Coupling this idea with the implicit learning associated with backpressure routing (originally developed for multihop wireless networks), we would like to demonstrate how to realize optimal revenue. We will then propose a simpler heuristic algorithm and try to show, using simulations, that its performance approaches that of backpressure routing. As the second problem, we look at the traditional formulation of the total value of information transfer, which is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixed route, and the objective is to maximize the total system throughput under some concept of fairness, subject to capacity constraints of the links used. This problem is well studied under the framework of network utility maximization and has led to several different distributed congestion control schemes. However, this idea of value does not capture the fact that flows might associate value, not just with throughput, but with link-quality metrics such as packet delay, jitter and so on. The traditional congestion control problem is redefined to include individual source preferences. It is assumed that degradation in link quality seen by a flow adds up on the links it traverses, and the total utility is maximized in such a way that the quality degradation seen by each source is bounded by a value that it declares. Decoupling source-dissatisfaction and link-degradation through an ?effective capacity? variable, a distributed and provably optimal resource allocation algorithm is designed, to maximize system utility subject to these quality constraints. The applicability of our controller in different situations is illustrated, and results are supported through numerical examples.

This thesis demonstrates the performance of Probabilistic Early Response TCP (PERT), a new TCP congestion control, for video streaming. As a delay based protocol, it measures the delay at the end host and adjusts the congestion window accordingly. Our experiments show that PERT improves video delivery performance by decreasing the fraction of packets delivered late. Furthermore, our Linux live streaming test indicates that PERT is able to reduce the playback glitches, when high resolution video is delivered over a link with non-zero packet loss. In order to operate PERT at higher thoughputs, we design PERT to work with Acknowledgement (ACK) coalescing at the receiver. ACK coalescing makes data transfers burstier and makes it hard to estimate delays accurately. We apply TCP pacing to fix this issue, and validate its effectiveness in the aspects of throughput, packet loss and fairness. Our experiment results also show that PERT with Delayed ACK and Pacing is more friendly, and therefore more suitable when multiple traffic flows are competing for limited bottleneck bandwidth or sharing the same router buffer.