Quality-of-service provisioning in high speed networks : routing perspectives

The continuous growth in both commercial and public network traffic with various quality-of-service (QoS) requirements is calling for better service than the current Internet\u27s best effort mechanism. One of the challenging issues is to select feasible paths that satisfy the different requirements of various applications. This problem is known as QoS routing. In general, two issues are related to QoS routing: state distribution and routing strategy. Routing strategy is used to find a feasible path that meets the QoS requirements. State distribution addresses the issue of exchanging the state information throughout the network, and can be further divided into two sub-problems: when to update and how to disseminate the state information. In this dissertation, the issue of when to update link state information from the perspective of information theory is addressed. Based on the rate-distortion analysis, an efficient scheme, which outperforms the state of the art in terms of both protocol overhead and accuracy of link state information, is presented. Second, a reliable scheme is proposed so that, when a link is broken, link state information is still reachable to all network nodes as long as the network is connected. Meanwhile, the protocol overhead is low enough to be implemented in real networks. Third, QoS routing is NP-complete. Hence, tackling this problem requires heuristics. A common approach is to convert this problem into a shortest path or k-shortest path problem and solve it by using existing algorithms such as Bellman-Ford and Dijkstra algorithms. However, this approach suffers from either high computational complexity or low success ratio in finding the feasible paths. Hence, a new problem, All Hops k-shortest Path (AHKP), is introduced and investigated. Based on the solution to AHKP, an efficient self-adaptive routing algorithm is presented, which can guarantee in finding feasible paths with fairly low average computational complexity. One of its most distinguished properties is its progressive property, which is very useful in practice: it can self-adaptively minimize its computational complexity without sacrificing its performance. In addition, routing without considering the staleness of link state information may generate a significant percentage of false routing. Our proposed routing algorithm is capable of minimizing the impact of stale link state information without stochastic link state knowledge. Fourth, the computational complexities of existing s-approximation algorithms are linearly proportional to the adopted linear scaling factors. Therefore, two efficient algorithms are proposed for finding the optimal (the smallest) linear scaling factor such that the computational complexities are reduced. Finally, an efficient algorithm is proposed for finding the least hop(s) multiple additive constrained path for the purpose of saving network resources

Polycyclic aromatic hydrocarbons biodegradation using isolated strains under indigenous condition

The treatment and disposal of domestic sIudge is an expensive and environmentally sensitive problem. It is also a growing problem since sludge production will continue to increase as new wastewzter treatment plants are built due to population increase. The large volume of domestic sIudge produced had made it difficult for many countries including Malaysia to assure complete treatment of the sludge before discharging to the receiving environment. Domestic sludge contains diverse range of pollutants such as pathogen, inorganic and organic compounds. These pollutants are toxic, mutagenic or carcinogenic and may threaten human health. Iiilproper disposal and handling of sludge may pose serious impact to the environment especially on soil and water cycles. Previous studies on Malaysian domestic sludge only reported on bulk parameters and heavy metals. Thus, no study reported on organic micro pollutants, namely, polycylic aromatic hydrocarbons (PAHs). Their recalcitrance and persistence make them problematic environmental contaminants. Microbial degradation is considered to be the primary mechanism of PAHs removal from the environment. Much has been reported on biodegradation of PAHs in several countries but there is a lack of information quantitative on this subject in Malaysia. This study is carried out to understand the nature of domestic sludge and to provide a better understanding on the biodegradation processes of PAHs. The methodology of this study comprised field activities, laboratory work and mathematical modelling. Field activities involved sampling of domestic sludge from Kolej Mawar, Universiti Teknologi MARA, Shah Alam, Selangor. Laboratory activities include seven phases of experimental works. First phase is characterization study of domestic sludge based on bulk parameters, heavy metals and PAHs. Second phase is enrichment and purification of bacteria isolated from domestic sludge using single PAHs and mixed PAHs as growth substrate. This was followed by identification of bacteria using BIOLOG system. The fourth phase focussed on turbidity test to monitor growth rate of the isolated bacteria. Preliminary degradation study involves optimization of the process at different substrate concentration, bacteria concentration, pH and temperature. The optimum conditions established from optimization study were used in degradation study. In biodegradation study, two experimental conditions were performed. These conditions include using bacteria isolated from single PAHs as substrate and bacteria isolated from mixed PAHs. Protein and pH tests were done during degradation study. Final activity is mathematical modelling of the biodegradation process. In general results on bulk parameters are comparable to previous studies. Zinc was the main compound with a mean concentration of 11 96.4 mglkg. PAHs were also detected in all of the samples, with total concentration between 0.72 to 5.36 mglkg dry weight for six PAHs. In the examined samples, phenanthrene was the main compound with a mean concentration of 1.0567 mglkg. The results fiom purification studies of bacteria strains sucessfull isolated 13 bacteria strains fiom single PAH substrate while three bacteria were isolated from the mixed PAHs substrate. Based on bacteria growth rates, only six strains grown on single PAHs and three strains grown on mixed PAHs were used for further studies. Results from the optimization study of biodegradation indicated that maximum rate of PAHs removal occurred at 100 mg~-' of PAHs, 10% bacteria concentration, pH 7.0 and 30°C. The results showed that bacteria grown on lower ring of PAHs are not able to grow on higher ring of PAHs. As for example Micrococcus diversus grown on napthalene as sole carbon source was unable to degrade other PAHs like acenapthylene, acenapthene, fluorene, phenanthrene and antlracene. In the case of bacteria isolated from mixed PAHs, the results showed that most of the napthalene was degraded by isolated strains with the highest average degradation rate followed by acenapthylene, acenapthene, fluorene, phenanthrene and anthracene. 377$3(53867$.$$1�781.8�781�$0,1$+ D4ff + c\,cpda~ition trends were observed in the study could be attributed to the different subsr , i,lo\~ir 'Led during isolation process. Interaction through cometabolism and synergistic ocolq bacteria strains isolated from single substrate. Thus, only synergistic interaction was oL, :a 77ed for bacteria isolated from mixed substrate. Corynebacterium urolyticum re\e;;ed I,, be the best strain in degrading PAHs. The experimental results have led to a model conccl~t desclibing I'AHs degradation

Efficient packet delivery in modern communication networks

Modern communication networks are often designed for diverse applications, such as voice, data and video. Packet-switching is often adapted in today’s networks to transmit multiple types of traffic. In packet-switching networks, network performance is directly affected by how the networks handle their packets. This work addresses the packet-handling issues from the following two aspects: Quality of Service (QoS) and network coding. QoS has been a well-addressed issue in the study of IP-based networks. Generally, nodes in a network need to be informed of the state of each communication link in order to make intelligent decisions to route packets according to their QoS demands. The link state can, however, change rapidly in a network; therefore, nodes would have to receive frequent link state updates in order to maintain the latest link state information at all times. Frequent link state updating is resource-consuming and hence impractical in network design. Therefore, there is a trade-off between the link state updating frequency and the QoS routing performance. It is necessary to design a link state update algorithm that utilizes less frequent link state updates to achieve a high degree of satisfaction in QoS performance. The first part of this work addresses this link state update problem and provides two solutions: ROSE and Smart Packet Marking. ROSE is a class-based link state update algorithm, in which the class boundaries are designed based on the statistical data of users’ QoS requests. By doing so, link state update is triggered only when certain necessary conditions are met. For example, if the available bandwidth of a link is fluctuating within a range that is higher than the highest possible bandwidth request, there is no need to update the state of this link. Smart Packet Marking utilizes a similar concept like ROSE, except that the link state information is carried in the probing packet sent in conjunction with each connection request instead of through link state updates. The second part of this work addresses the packet-handling issue by means of network coding. Instead of the traditional store-and-forward approach, network coding allows intermediate nodes in a multi-hop path to code multiple packets into one in order to reduce bandwidth consumption. The coded packet can later be decoded by its recipients to retrieve the original plain packet. Network coding is found to be beneficial in many network applications. This dissertation makes contributions in network coding in two areas: peer-to-peer file sharing and wireless ad-hoc networks. The benefit of network coding in peer-to-peer file sharing networks is analyzed, and a network coding algorithm – Downloader-Initiated Random Linear Network Coding (DRLNC) – is proposed. DLRNC shifts the coding decision from the seeders to the leechers; by doing so it solves the “collision” problem without increasing the field size. In wireless network coding, this work addresses the implementation difficulty pertaining to MAC layer scheduling. To achieve the ideal network coding gain in wireless networks, it requires perfect MAC layer scheduling. This dissertation first provides an algorithm to solve the ideal-case MAC layer scheduling problem. Since the ideal MAC layer schedule is often difficult to realize, a practical approach is then proposed to increase the network coding performance by modifying the ACK packets in the 802.11 MAC

A Localized Adaptive Proportioning Approach to QoS Routing

In QoS routing, paths for flows are selected based on knowledge of resource availability at network nodes and the QoS requirements of flows. Several QoS routing schemes have been proposed that differ in the way they gather information about the network state and select paths based on this information. We broadly categorize these schemes into best path routing and proportional routing. The best path routing schemes gather global network state information and always select the best path for an incoming I-low,based on this global view. It has been shown that best path routing schemes require frequent exchange of network state, imposing both communication overhead on the network and processing overheads on the core routers. On the other hand, proportional routing schemes proportion incoming flows among a set of candidate paths. We have shown that it is possible to compute near-optimal proportions using only locally collected information. Furthermore, a few good candidate paths can be selected using infrequently exchanged global information and thus with minimal communication overhead. We describe these schemes in detail and demonstrate that proportional routing schemes can achieve higher throughput with lower overhead than best path routing schemes

Cross-layer aided energy-efficient routing design for ad hoc networks

In this treatise, we first review some basic routing protocols conceived for ad hoc networks, followed by some design examples of cross-layer operation aided routing protocols. Specifically, cross-layer operation across the PHYsical layer (PHY), the Data Link layer (DL) and even the NETwork layer (NET) is exemplified for improving the energy efficiency of the entire system. Moreover, the philosophy of Opportunistic Routing (OR) is reviewed for the sake of further reducing the system's energy dissipation with the aid of optimized Power Allocation (PA). The system's end-to-end throughput is also considered in the context of a design example

A COMPARATIVE STUDY IN WIRELESS SENSOR NETWORKS

ABSTRAC

Analysis of topology aggregation techniques for QoS routing

We study and compare topology aggregation techniques used in QoS routing. Topology Aggregation (TA) is defined as a set of techniques that abstract or summarize the state information about the network topology to be exchanged, processed, and maintained by network nodes for routing purposes. Due to scalability, aggregation techniques have been an integral part of some routing protocols. However, TA has not been studied extensively except in a rather limited context. With the continuing growth of the Internet, scalability issues of QoS routing have been gaining importance. Therefore, we survey the current TA techniques, provide methodology to classify, evaluate, and compare their complexities and efficiencies. ©2007 ACM.postprin