No abstract

End-to-end Quality of Service (QoS) provisioning in wireless heterogeneous networks require complex resource management and link utilization strategies. One important issue in QoS compliance relates to load-balanced resource management for increased survivability and availability of network services. In this paper, QoS provisioning issue has been addressed with the help of token bucket regulator (TBR) based cumulative link capacity estimation, using multiple radio access technologies. This estimation is used to achieve redundant paths to ingress router of a QoS provisioned subnet, which increases availability of network services. Traffic is routed through anyone or combination of multiple available paths, enabling fast data forwarding. The fluctuations of link conditions in heterogeneous wireless networks are also absorbed in the token bucket regulator causing smooth traffic flow. Simulation results provide sufficient support in favor of proposed model for maximized call-admission, minimized call-block and improved resource management under high traffic load conditions.

Multi-server scheduling of traffic flows over heterogeneous wireless channels affix fresh concerns of inter-packet delay variations and associated problems of out-ofsequence reception, buffer management complexity, packet drops and re-ordering overhead. In this paper, we have presented an exclusive multi-server scheduling algorithm that is specifically tuned for mobile routers equipped with multiple wireless interfaces and has attained multiple care-of-address registrations with its home agent (HA). The proposed adaptive, Selfclocked, Multi-server (ASM) scheduling algorithm is based on predetermined transmission deadlines for each arrived packet at the mobile router. The mobile flows receive desired service levels in accordance with their negotiated service rates and are only constraint by the cumulative capacity of all active links. The major challenge lies in the handling of asymmetric channels to stitch into a unified virtual channel of higher capacity with reliable service guarantees during mobility. The sorted list of transmission schedules is used to assign physical channels in increasing order of their availability. This approach specifically encapsulates the physical layer disconnections during the handovers and ensures continuous service to ongoing flows. The proposed scheduling scheme is supplemented by an analytical model and simulations to verify its efficacy. The simulation results demonstrate higher degree of reliability and scalability of service provisioning to flows during mobility.

Absircrci -Nowadays the importance of intrusion detection is amplified due to incredible increase in number of attacks on the networks. The ubiquity of the Internet and the easy perpetration of the attacks will lead to more hostile trafic on the Internet. With the advent of high-speed Internet connections, the organizations today find it dificult to detect intrusions. So multi sensor Intrusion Detection Systems are inevitable. The optimum distribution of traflic to the sensors is a challenging task. I n this paper we present a mechanism to split trafic to different intrusion detection sensors to make the task manageable. This splitting of trafic to each sensor is managed by policies enforced on the splitter by the management console. The system is adaptive in the sense that it can adjust the splitting policies for keeping load disparity among sensors reduced. This mechanism of policy-reloading also take into the account the similarity between all possible pairs of policies and tries to minimize the packet duplication rate during the operation of the system. Our mechanism is based on the observation that minimizing the percentage of traftic being duplicated can enhance system performance. We have also discussed the effects of reloading of splitting policies on packet duplication rate and load on sensors.

No abstract

No abstract

No abstract

Mobility management in a fast moving environment is convoluted by issues like speed of movement, detection of movement, handoff processing and scarcity of media resources. Most of the proposed architectures and solutions for mobility management use complex processing to reduce handoff latencies. In this paper a light-weight fast mobility management scheme is proposed which is based on strategic deployment of Wireless LAN (WLAN) hotspots in a hierarchy of overlapped components like Handoff Anchor Points (HAP), Access Routers (ARs) and Access Points (APs). The major handoff decision is taken in the HAP, a novel component in proposed architecture, which last for a significantly longer time due to reduced chances in probable moving path and by sending Early Binding Updates through active ARs. Handoff latency has been reduced to almost link layer handoff time with a high level of predictability and reliability. Simulation results highlight improvements achieved in throughput, scalability, and handoff latencies.