90 research outputs found
QoS in Today's Internet
To be able to guarantee service quality end-to-end Quality of Service has to be deployed. This thesis addresses the problems with applying QoS end-to-end over today’s Internet. A rather pessimistic conclusion states that QoS over Internet is hard (impossible?) to realize without introducing virtual circuits or similar. The concept of flows and label switching is introduced. Some QoS techniques are presented
Expectations, Network Effects and Timing of Technology Adoption: Some Empirical Evidence from a Sample of SMEs in Italy
We provide evidence on the influence of expectations and network effects on the timing of technological adoption. By considering a sample of SMEs operating in Italy we focus on the determinants of their decision to adopt Fast Ethernet, a communication standard for Local Area Networks (LANs). We find that both expectations and network effects significantly affect the timing of adoption. In particular, price expectations generally tend to delay adoption and (indirect) network effects in the form of backward compatibility as well as informational spillovers tend to foster adoption. Firm size also matters.diffusion, network effects, expectations, LAN equipment, SMEs
Re-feedback: freedom with accountability for causing congestion in a connectionless internetwork
This dissertation concerns adding resource accountability to a simplex internetwork such as the Internet,
with only necessary but sufficient constraint on freedom. That is, both freedom for applications to evolve
new innovative behaviours while still responding responsibly to congestion; and freedom for network
providers to structure their pricing in any way, including flat pricing.
The big idea on which the research is built is a novel feedback arrangement termed ‘re-feedback’.
A general form is defined, as well as a specific proposal (re-ECN) to alter the Internet protocol so that
self-contained datagrams carry a metric of expected downstream congestion.
Congestion is chosen because of its central economic role as the marginal cost of network usage.
The aim is to ensure Internet resource allocation can be controlled either by local policies or by market
selection (or indeed local lack of any control).
The current Internet architecture is designed to only reveal path congestion to end-points, not networks.
The collective actions of self-interested consumers and providers should drive Internet resource
allocations towards maximisation of total social welfare. But without visibility of a cost-metric, network
operators are violating the architecture to improve their customer’s experience. The resulting fight
against the architecture is destroying the Internet’s simplicity and ability to evolve.
Although accountability with freedom is the goal, the focus is the congestion metric, and whether
an incentive system is possible that assures its integrity as it is passed between parties around the system,
despite proposed attacks motivated by self-interest and malice.
This dissertation defines the protocol and canonical examples of accountability mechanisms. Designs
are all derived from carefully motivated principles. The resulting system is evaluated by analysis
and simulation against the constraints and principles originally set. The mechanisms are proven to be
agnostic to specific transport behaviours, but they could not be made flow-ID-oblivious
Some analysis on mobile-agent based network routing
©2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.Deployment of mobile agents in network-based applications has attracted lots of attentions in recent years. How to control the activities of agents is crucial for effective application of mobile agents. This paper focuses on the application of mobile agents in network routing. Two important activity properties of mobile agents are identified: the probability of success (the probability of finding the destination) and the distribution of mobile agents running in the network. To our knowledge, little work has been done on these two aspects. Our results show that the number of mobile agents can be controlled by adjusting the number of agents generated per request and the number of jumps each mobile agent can move. Thus, we can improve network performance by tuning relevant parameters.Wenyu Qu, Hong She
Service management for multi-domain Active Networks
The Internet is an example of a multi-agent system. In our context, an agent is synonymous with network operators, Internet service providers (ISPs) and content providers. ISPs mutually interact for connectivity's sake, but the fact remains that two peering agents are inevitably self-interested. Egoistic behaviour manifests itself in two ways. Firstly, the ISPs are able to act in an environment where different ISPs would have different spheres of influence, in the sense that they will have control and management responsibilities over different parts of the environment. On the other hand, contention occurs when an ISP intends to sell resources to another, which gives rise to at least two of its customers sharing (hence contending for) a common transport medium. The multi-agent interaction was analysed by simulating a game theoretic approach and the alignment of dominant strategies adopted by agents with evolving traits were abstracted. In particular, the contention for network resources is arbitrated such that a self-policing environment may emerge from a congested bottleneck. Over the past 5 years, larger ISPs have simply peddled as fast as they could to meet the growing demand for bandwidth by throwing bandwidth at congestion problems. Today, the dire financial positions of Worldcom and Global Crossing illustrate, to a certain degree, the fallacies of over-provisioning network resources. The proposed framework in this thesis enables subscribers of an ISP to monitor and police each other's traffic in order to establish a well-behaved norm in utilising limited resources. This framework can be expanded to other inter-domain bottlenecks within the Internet. One of the main objectives of this thesis is also to investigate the impact on multi-domain service management in the future Internet, where active nodes could potentially be located amongst traditional passive routers. The advent of Active Networking technology necessitates node-level computational resource allocations, in addition to prevailing resource reservation approaches for communication bandwidth. Our motivation is to ensure that a service negotiation protocol takes account of these resources so that the response to a specific service deployment request from the end-user is consistent and predictable. To promote the acceleration of service deployment by means of Active Networking technology, a pricing model is also evaluated for computational resources (e.g., CPU time and memory). Previous work in these areas of research only concentrate on bandwidth (i.e., communication) - related resources. Our pricing approach takes account of both guaranteed and best-effort service by adapting the arbitrage theorem from financial theory. The central tenet for our approach is to synthesise insights from different disciplines to address problems in data networks. The greater parts of research experience have been obtained during direct and indirect participation in the 1ST-10561 project known as FAIN (Future Active IP Networks) and ACTS-AC338 project called MIAMI (Mobile Intelligent Agent for Managing the Information Infrastructure). The Inter-domain Manager (IDM) component was integrated as an integral part of the FAIN policy-based network management systems (PBNM). Its monitoring component (developed during the MIAMI project) learns about routing changes that occur within a domain so that the management system and the managed nodes have the same topological view of the network. This enabled our reservation mechanism to reserve resources along the existing route set up by whichever underlying routing protocol is in place
An Experimental Evaluation of Constrained Application Protocol Performance over TCP
The Internet of Things (IoT) is the Internet augmented with diverse everyday and industrial objects, enabling a variety of services ranging from smart homes to smart cities. Because of their embedded nature, IoT nodes are typically low-power devices with many constraints, such as limited memory and computing power. They often connect to the Internet over error-prone wireless links with low or variable speed. To accommodate these characteristics, protocols specifically designed for IoT use have been designed.
The Constrained Application Protocol (CoAP) is a lightweight web transfer protocol for resource manipulation. It is designed for constrained devices working in impoverished environments. By default, CoAP traffic is carried over the unreliable User Datagram Protocol (UDP). As UDP is connectionless and has little header overhead, it is well-suited for typical IoT communication consisting of short request-response exchanges. To achieve reliability on top of UDP, CoAP also implements features normally found in the transport layer. Despite the advantages, the use of CoAP over UDP may be sub-optimal in certain settings. First, some networks rate-limit or entirely block UDP traffic. Second, the default CoAP congestion control is extremely simple and unable to properly adjust its behaviour to variable network conditions, for example bursts. Finally, even IoT devices occasionally need to transfer large amounts of data, for example to perform firmware updates. For these reasons, it may prove beneficial to carry CoAP over reliable transport protocols, such as the Transmission Control Protocol (TCP). RFC 8323 specifies CoAP over stateful connections, including TCP. Currently, little research exists on CoAP over TCP performance.
This thesis experimentally evaluates CoAP over TCP suitability for long-lived connections in a constrained setting, assessing factors limiting scalability and problems packet loss and high levels of traffic may cause. The experiments are performed in an emulated network, under varying levels of congestion and likelihood of errors, as well as in the presence of overly large buffers. For TCP results, both TCP New Reno and the newer TCP BBR are examined. For baseline measurements, CoAP over UDP is carried using both the default CoAP congestion control and the more advanced CoAP Simple Congestion Control/Advanced (CoCoA) congestion control.
This work shows CoAP over TCP to be more efficient or at least on par with CoAP over UDP in a constrained setting when connections are long-lived. CoAP over TCP is notably more adept than CoAP over UDP at fully utilising the capacity of the link when there are no or few errors, even if the link is congested or bufferbloat is present. When the congestion level and the frequency of link errors grow high, the difference between CoAP over UDP and CoAP over TCP diminishes, yet CoAP over TCP continues to perform well, showing that in this setting CoAP over TCP is more scalable than CoAP over UDP. Finally, this thesis finds TCP BBR to be a promising congestion control candidate. It is able to outperform the older New Reno in almost all explored scenarios, most notably in the presence of bufferbloat
Recommended from our members
Operational support systems for satellite communications
The role of satellite communications is changing from providing bandwidth linking network operators interconnections towards providing IP enabled communications to end users. This migration from few high-value routes towards many low-value routes means that integration and automation of processes with terrestrial networks becomes critical in driving down unit costs. Integration and automation is necessary on all planes: user, control and management. In satellite communications, management aspects, underpinned by Operational Support Systems (OSS) have received the least research attention, making this a valuable topic for study. In most areas, OSS for satellite systems are similar to other domains. However there are some notable areas of difference which have been the focus of this research. The eTOM business framework, developed by the TMF, has been used to highlight aspects of OSS unique to satellite. Since satellite capacity represents the highest operational cost of a satellite route, effective management while minimising the overhead traffic is critical. The transmission of IP packets is assumed and the real-time measurement of QoS parameters such as packet delay and loss emerged as the most important differences. A number of approaches to QoS measurement are feasible, however the use of trace packets is most promising especially for high network loads. An experiment compares the results from simulations, mathematical models and from a test network, using Poisson and self-similar traffic flows. The relationship between measurement accuracy and trace packet intensity is explored and the measurement response time to steps in traffic load is estimated. It is discovered that measurement accuracy improves as the queue load increases, in contrast to alternative approaches such as sampling of user packets. The response time to steps depends upon the degree of self-similarity and is generally longer than the times recommended by standards. A pragmatic approach to management of different modes is proposed where the measurement method is changed depending on the load
Equation-Based Congestion Control for Unicast Applications: the Extended Version
This paper proposes a mechanism for equation-based congestion control for unicast traffic. Most best-effort traffic in the current Internet is well-served by the dominant transport protocol TCP. However, traffic such as best-effort unicast streaming multimedia could find use for a TCP-friendly congestion control mechanism that refrains from reducing the sending rate in half in response to a single packet drop. With our mechanism, the sender explicitly adjusts its sending rate as a function of the measured rate of loss events, where a loss event consists of one or more packets dropped within a single round-trip time. We use both simulations and experiments over the Internet to explore performance. Equation-based congestion control is also a promising avenue of development for congestion control of multicast traffic, and so an additional reason for this work is to lay a sound basis for the later development of multicast congestion control
Policy based network management of legacy network elements in next generation networks for voice services
Magister Scientiae - MScTelecommunication companies, service providers and large companies are now
adapting converged multi-service Next Generation Networks (NGNs). Network
management is shifting from managing Network Elements (NE) to managing services. This paradigm shift coincides with the rapid development of Quality of Service (QoS) protocols for IP networks. NEs and services are managed with Policy Based Network Management (PBNM) which is most concerned with managing services that require QoS using the Common Open Policy Service (COPS) Protocol. These services include Voice over IP (VoIP), video conferencing and video streaming. It follows that legacy NEs without support for QoS need to be replaced and/or excluded from the network. However, since most of these services run over IP, and legacy NEs easily supports IP,
it may be unnecessary to throw away legacy NEs if it can be made to fit within a PBNM approach. Our approach enables an existing PBNM system to include legacy NEs in its management paradigm. The Proxy-Policy Enforcement Point (P-PEP) and Queuing Policy Enforcement Point (Q-PEP) can enforce some degree of traffic shaping on a gateway to the legacy portion of the network. The P-PEP utilises firewall techniques using the common legacy and contemporary NE management protocol Simple Network Management Protocol (SNMP) while the Q-PEP uses queuing techniques in the form Class Based Queuing (CBQ) and Random Early Discard (RED) for traffic control.South Afric
- …