With the wide spread of WiFi hotspots, concentrated traffic workload on Smart Web (SW) can slow down the network performance. This paper presents a congestion management strategy considering real time activities in today’s smart web. With the SW context, cooperative packet recovery using resource reservation procedure for TCP flows was adapted for mitigating packet losses. This is to maintain data consistency between various access points of smart web hotspot. Using a real world scenario, it was confirmed that generic TCP cannot handle traffic congestion in a SW hotspot network. With TCP in scalable workload environments, continuous packet drops at the event of congestion remains obvious. This is unacceptable for mission critical domains. An enhanced Link State Resource Reservation Protocol (LSRSVP) which serves as dynamic feedback mechanism in smart web hotspots is presented. The contextual behaviour was contrasted with the generic TCP model. For the LS-RSVP, a simulation experiment for TCP connection between servers at the remote core layer and the access layer was carried out while using selected benchmark metrics. From the results, under realistic workloads, a steady-state throughput response was achieved by TCP LS-RSVP to about 3650Bits/secs compared with generic TCP plots in a previous study. Considering network service availability, this was found to be dependent on fault-tolerance of the hotspot network. From study, a high peak threshold of 0.009 (i.e. 90%) was observed. This shows fairly acceptable service availability behaviour compared with the existing TCP schemes. For packet drop effects, an analysis on the network behaviour with respect to the LS-RSVP yielded a drop response of about 0.000106 bits/sec which is much lower compared with the case with generic TCP with over 0.38 bits/sec. The latency profile of average FTP download response was found to be 0.030secs, but with that of FTP upload response, this yielded about 0.028 sec. The results from the study demonstrate efficiency and optimality for realistic loads in Smart web contexts.
M phil-computer-science-wireless-communication-projectsVijay Karan
List of Wireless Communication IEEE 2006 Projects. It Contains the IEEE Projects in the Domain Wireless Communication for M.Phil Computer Science students.
Talhunt is a leader in assisting and executing IEEE Engineering projects to Engineering students - run by young and dynamic IT entrepreneurs. Our primary motto is to help Engineering graduates in IT and Computer science department to implement their final year project with first-class technical and academic assistance.
Project assistance is provided by 15+ years experienced IT Professionals. Over 100+ IEEE 2015 and 200+ yester year IEEE project titles are available with us. Projects are based on Software Development Life-Cycle (SDLC) model.
M.E Computer Science Wireless Communication ProjectsVijay Karan
List of Wireless Communication IEEE 2006 Projects. It Contains the IEEE Projects in the Domain Wireless Communication for M.E Computer Science students.
M.Phil Computer Science Wireless Communication ProjectsVijay Karan
List of Wireless Communication IEEE 2006 Projects. It Contains the IEEE Projects in the Domain Wireless Communication for M.Phil Computer Science students.
M phil-computer-science-wireless-communication-projectsVijay Karan
List of Wireless Communication IEEE 2006 Projects. It Contains the IEEE Projects in the Domain Wireless Communication for M.Phil Computer Science students.
Talhunt is a leader in assisting and executing IEEE Engineering projects to Engineering students - run by young and dynamic IT entrepreneurs. Our primary motto is to help Engineering graduates in IT and Computer science department to implement their final year project with first-class technical and academic assistance.
Project assistance is provided by 15+ years experienced IT Professionals. Over 100+ IEEE 2015 and 200+ yester year IEEE project titles are available with us. Projects are based on Software Development Life-Cycle (SDLC) model.
M.E Computer Science Wireless Communication ProjectsVijay Karan
List of Wireless Communication IEEE 2006 Projects. It Contains the IEEE Projects in the Domain Wireless Communication for M.E Computer Science students.
M.Phil Computer Science Wireless Communication ProjectsVijay Karan
List of Wireless Communication IEEE 2006 Projects. It Contains the IEEE Projects in the Domain Wireless Communication for M.Phil Computer Science students.
A PROACTIVE FLOW ADMISSION AND RE-ROUTING SCHEME FOR LOAD BALANCING AND MITIG...IJCNCJournal
The centralized architecture in software-defined network (SDN) provides a global view of the underlying network, paving the way for enormous research in the area of SDN traffic engineering (SDN TE). This research focuses on the load balancing aspects of SDN TE, given that the existing reactive methods for data-plane load balancing eventually result in packet loss and proactive schemes for data plane load
balancing do not address congestion propagation. In the proposed work, the SDN controller periodically monitors flow level statistics and utilization on each link in the network and over-utilized links that cause network congestion and packet loss are identified as bottleneck links. For load balancing the identified largest flow and further traffic through these bottleneck links are rerouted through the lightly-loaded alternate path. The proposed scheme models a Bayesian Network using the observed port utilization and residual bandwidth to decide whether the newly computed alternate path can handle the new flow load before flow admission which in turn reduces congestion propagation. The simulation results show that
when the network traffic increases the proposed method efficiently re-routes the flows and balance the network load which substantially improves the network efficiency and the quality of service (QoS) parameters.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
A Bandwidth Efficient Scheduling Framework for Non Real Time Applications in ...ijdpsjournal
The key concern on the bandwidth allocation and scheduling for non real time traffic are the fulfillment of its minimum throughput requirement and improvement of bandwidth utilization with acceptable delay. This paper proposes a simple and efficient scheduling framework for allocating bandwidth to non real time
polling service (nrtPS) users in IEEE 802.16 networks. In this framework, jointly selective repeat ARQ at the MAC layer and adaptive modulation and coding techniques at the physical are considered. Numerical simulations demonstrate that the proposed scheduling approach provides a graceful compromise between bandwidth utilization and packet delivery delay while maintaining the minimum throughput requirements of nrtPS applications. Thus proves the efficiency of the proposed framework. The simulation is done for unicast scenario.
MULTI-CONSTRAINTS ADAPTIVE LINK QUALITY INDEX BASED MOBILE-RPL ROUTING PROTOC...IJCNCJournal
The importance of IPv6 Routing Protocol for Low power and Lossy Networks (LLNs), also called RPL, has motivated in the development of a robust and quality of service (QoS) oriented Multi-Constraints Adaptive Link Quality Index (MALQI) based routing protocol. Unlike classical RPL protocols, MALQI enables mobile-RPL while ensuring fault-resilient, reliable and QoS communication over LLNs. MALQI protocol exploits key novelties such as signal strength based mobile node positioning, average received signal strength indicator (ARSSI) and ETX based objective function for fault tolerant best forwarding path selection. The functional architecture of MALQI enables it to be used as the parallel to the link layer RPL that even in the case of link failure can assist efficient data delivery over LLNs. Once detecting link outage, MALQI can execute node discover and best forwarding path selection to assist QoS delivery. Contiki-Cooja based simulation reveals that MALQI based mobile-RPL outperforms other state-of-art routing protocols.
DWDM-RAM: An Architecture for Data Intensive Service Enabled by Next Generati...Tal Lavian Ph.D.
An architecture is proposed for data-intensive services enabled by next generation dynamic optical networks. The architecture supports new data communication services that allow for coordinating extremely large sets of distributed data. The architecture allows for novel features including algorithms for optimizing and scheduling data transfers,methods for allocating and scheduling network resources, and an intelligent middleware platform that is capable of interfacing application level services to the underlying optical technologies. The significance of the architecture is twofold: 1) it encapsulates “optical network resources” into a service framework to support dynamically provisioned and advance scheduled data-intensive transport services, and 2) it establishes a generalized enabling framework for intelligent services and applications over next generation networks, not necessarily optical end-to-end. DWDM-RAM1 is an implementation version of the architecture, which is conceptual as well as experimental. This architecture has been implemented in prototype on OMNInet, which is an advanced experimental metro area optical testbed that is based on novel architecture, protocols, control plane services (Optical Dynamic Intelligent Network-ODIN2), and advanced photonic components. This paper presents the concepts behind the DWDM-RAM architecture and its design. The paper also describes an application scenario using the architecture’s data transfer service and network resource services over the agile OMNInet testbed.
Efficient IOT Based Sensor Data Analysis in Wireless Sensor Networks with Cloudiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
A dynamic performance-based_flow_controlingenioustech
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
A novel token based approach towards packet loss controleSAT Journals
Abstract Due to the advent of technologies like Web 2.0, the Internet applications are able to support transmission of multimedia content to end users. In such applications the transmission might result in packet loss as well. In this context, it is essential to have packet loss control mechanisms that can avoid deterioration of quality of services while rendering media rich content. The quality of service in this case depends on congestion control. Many protocols have been introduced in order to supplement the standard TCP protocol in order to control network congestion. The CSFQ which was built for fair service with open – loop controller has started deterioration in quality as P2P flows dominated Internet traffic of late. One of the closed loop congestion control known as Token-Based Congestion Control (TBCC) was able to restrict consuming resources and provide best service to end users. It monitors inter-domain traffic for trust relationships. Recently, Shi et al. presented a new mechanism known as Stable Token-Limited Congestion Control (STLCC) for controlling inter-domain congestion and improve network performance. In this paper we implement the STLCC mechanism. We built a prototype application that demonstrates the proof of concept. The experimental results revealed that the proposed application is able to control network congestion by controlling packet loss thus improving performance of network. Keywords – Networking, packet loss control, data gram, packet, TCP, congestion control
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Comparative Analysis of Green Algorithm within Active Queue Management for Mo...ijtsrd
The Queue Management Techniques play an important role in improving the Quality of Service in Mobile Ad hoc Networks. The need of congestion control and Queue management is inevitable in Mobile Ad hoc Network. Understanding and analyzing the latest AQM Techniques give an insight to improving throughput, packet loss rate, average end to end delay and other parameters that severely affect the performance. The performance of mobile ad hoc networks is evaluated by varying the Channel Error Rate, Bandwidth and Delay at different fragment sizes of different traffic flows. The proposed method performs the network analysis of new Routing protocols. The work proposes to evaluate various Active Queue Management Techniques in a multi traffic environment i.e., sources generating both TCP and UDP traffic classes. The UDP is propagated via CBR and TCP is propagated via FTP. The implementation of the proposed queue management technique has been done in NS 2. In the proposed work we have make NS 2 compatible with GREEN by integrating source code into the ns 2 installation files and using various AQMs in comparison with GREEN to calculate the throughput at various Bandwidths across network. Using various AQMs in comparison with GREEN we have calculated the throughput at various Delays across the network and we have also calculated the throughput at various channels Error Rate across the network. The proposed method has been compared with other primitive AQM techniques so that a repository of best available results can be obtained for design and research purposes. The proposed method has outperformed the existing queue management techniques in number of scenarios. Zulai Khan | Rashmi Raj ""Comparative Analysis of Green Algorithm within Active Queue Management for Mobile Ad Hoc Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23950.pdf
Paper URL: https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/23950/comparative-analysis-of-green-algorithm-within-active-queue-management-for-mobile-ad-hoc-network/zulai-khan
A PROACTIVE FLOW ADMISSION AND RE-ROUTING SCHEME FOR LOAD BALANCING AND MITIG...IJCNCJournal
The centralized architecture in software-defined network (SDN) provides a global view of the underlying network, paving the way for enormous research in the area of SDN traffic engineering (SDN TE). This research focuses on the load balancing aspects of SDN TE, given that the existing reactive methods for data-plane load balancing eventually result in packet loss and proactive schemes for data plane load
balancing do not address congestion propagation. In the proposed work, the SDN controller periodically monitors flow level statistics and utilization on each link in the network and over-utilized links that cause network congestion and packet loss are identified as bottleneck links. For load balancing the identified largest flow and further traffic through these bottleneck links are rerouted through the lightly-loaded alternate path. The proposed scheme models a Bayesian Network using the observed port utilization and residual bandwidth to decide whether the newly computed alternate path can handle the new flow load before flow admission which in turn reduces congestion propagation. The simulation results show that
when the network traffic increases the proposed method efficiently re-routes the flows and balance the network load which substantially improves the network efficiency and the quality of service (QoS) parameters.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
A Bandwidth Efficient Scheduling Framework for Non Real Time Applications in ...ijdpsjournal
The key concern on the bandwidth allocation and scheduling for non real time traffic are the fulfillment of its minimum throughput requirement and improvement of bandwidth utilization with acceptable delay. This paper proposes a simple and efficient scheduling framework for allocating bandwidth to non real time
polling service (nrtPS) users in IEEE 802.16 networks. In this framework, jointly selective repeat ARQ at the MAC layer and adaptive modulation and coding techniques at the physical are considered. Numerical simulations demonstrate that the proposed scheduling approach provides a graceful compromise between bandwidth utilization and packet delivery delay while maintaining the minimum throughput requirements of nrtPS applications. Thus proves the efficiency of the proposed framework. The simulation is done for unicast scenario.
MULTI-CONSTRAINTS ADAPTIVE LINK QUALITY INDEX BASED MOBILE-RPL ROUTING PROTOC...IJCNCJournal
The importance of IPv6 Routing Protocol for Low power and Lossy Networks (LLNs), also called RPL, has motivated in the development of a robust and quality of service (QoS) oriented Multi-Constraints Adaptive Link Quality Index (MALQI) based routing protocol. Unlike classical RPL protocols, MALQI enables mobile-RPL while ensuring fault-resilient, reliable and QoS communication over LLNs. MALQI protocol exploits key novelties such as signal strength based mobile node positioning, average received signal strength indicator (ARSSI) and ETX based objective function for fault tolerant best forwarding path selection. The functional architecture of MALQI enables it to be used as the parallel to the link layer RPL that even in the case of link failure can assist efficient data delivery over LLNs. Once detecting link outage, MALQI can execute node discover and best forwarding path selection to assist QoS delivery. Contiki-Cooja based simulation reveals that MALQI based mobile-RPL outperforms other state-of-art routing protocols.
DWDM-RAM: An Architecture for Data Intensive Service Enabled by Next Generati...Tal Lavian Ph.D.
An architecture is proposed for data-intensive services enabled by next generation dynamic optical networks. The architecture supports new data communication services that allow for coordinating extremely large sets of distributed data. The architecture allows for novel features including algorithms for optimizing and scheduling data transfers,methods for allocating and scheduling network resources, and an intelligent middleware platform that is capable of interfacing application level services to the underlying optical technologies. The significance of the architecture is twofold: 1) it encapsulates “optical network resources” into a service framework to support dynamically provisioned and advance scheduled data-intensive transport services, and 2) it establishes a generalized enabling framework for intelligent services and applications over next generation networks, not necessarily optical end-to-end. DWDM-RAM1 is an implementation version of the architecture, which is conceptual as well as experimental. This architecture has been implemented in prototype on OMNInet, which is an advanced experimental metro area optical testbed that is based on novel architecture, protocols, control plane services (Optical Dynamic Intelligent Network-ODIN2), and advanced photonic components. This paper presents the concepts behind the DWDM-RAM architecture and its design. The paper also describes an application scenario using the architecture’s data transfer service and network resource services over the agile OMNInet testbed.
Efficient IOT Based Sensor Data Analysis in Wireless Sensor Networks with Cloudiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
A dynamic performance-based_flow_controlingenioustech
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
A novel token based approach towards packet loss controleSAT Journals
Abstract Due to the advent of technologies like Web 2.0, the Internet applications are able to support transmission of multimedia content to end users. In such applications the transmission might result in packet loss as well. In this context, it is essential to have packet loss control mechanisms that can avoid deterioration of quality of services while rendering media rich content. The quality of service in this case depends on congestion control. Many protocols have been introduced in order to supplement the standard TCP protocol in order to control network congestion. The CSFQ which was built for fair service with open – loop controller has started deterioration in quality as P2P flows dominated Internet traffic of late. One of the closed loop congestion control known as Token-Based Congestion Control (TBCC) was able to restrict consuming resources and provide best service to end users. It monitors inter-domain traffic for trust relationships. Recently, Shi et al. presented a new mechanism known as Stable Token-Limited Congestion Control (STLCC) for controlling inter-domain congestion and improve network performance. In this paper we implement the STLCC mechanism. We built a prototype application that demonstrates the proof of concept. The experimental results revealed that the proposed application is able to control network congestion by controlling packet loss thus improving performance of network. Keywords – Networking, packet loss control, data gram, packet, TCP, congestion control
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
Clustering is an important research area for mobile ad hoc networks (MANETs) as it increases the capacity of network, reduces the routing overhead and makes the network more scalable in the presence of both high mobility and a large number of mobile nodes. Routing protocols based on flat topology are not scalable because of their built-in characteristics. However, clustering cause overhead which consumes considerable bandwidth, drain mobile nodes energy quickly, likely cause congestion, collision and data delay in larger networks. This paper uses an implementation of the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based routing protocol to examine the influence of clustering on the performance of mobile ad hoc networks. This paper evaluates channel utilization and control overhead as a function of number of nodes per sq. km to show the effect of clustering. Simulation results show that in high mobility scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Comparative Analysis of Green Algorithm within Active Queue Management for Mo...ijtsrd
The Queue Management Techniques play an important role in improving the Quality of Service in Mobile Ad hoc Networks. The need of congestion control and Queue management is inevitable in Mobile Ad hoc Network. Understanding and analyzing the latest AQM Techniques give an insight to improving throughput, packet loss rate, average end to end delay and other parameters that severely affect the performance. The performance of mobile ad hoc networks is evaluated by varying the Channel Error Rate, Bandwidth and Delay at different fragment sizes of different traffic flows. The proposed method performs the network analysis of new Routing protocols. The work proposes to evaluate various Active Queue Management Techniques in a multi traffic environment i.e., sources generating both TCP and UDP traffic classes. The UDP is propagated via CBR and TCP is propagated via FTP. The implementation of the proposed queue management technique has been done in NS 2. In the proposed work we have make NS 2 compatible with GREEN by integrating source code into the ns 2 installation files and using various AQMs in comparison with GREEN to calculate the throughput at various Bandwidths across network. Using various AQMs in comparison with GREEN we have calculated the throughput at various Delays across the network and we have also calculated the throughput at various channels Error Rate across the network. The proposed method has been compared with other primitive AQM techniques so that a repository of best available results can be obtained for design and research purposes. The proposed method has outperformed the existing queue management techniques in number of scenarios. Zulai Khan | Rashmi Raj ""Comparative Analysis of Green Algorithm within Active Queue Management for Mobile Ad Hoc Network"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23950.pdf
Paper URL: https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/23950/comparative-analysis-of-green-algorithm-within-active-queue-management-for-mobile-ad-hoc-network/zulai-khan
Traffic-aware adaptive server load balancing for softwaredefined networks IJECEIAES
Servers in data center networks handle heterogeneous bulk loads. Load balancing, therefore, plays an important role in optimizing network bandwidth and minimizing response time. A complete knowledge of the current network status is needed to provide a stable load in the network. The process of network status catalog in a traditional network needs additional processing which increases complexity, whereas, in software defined networking, the control plane monitors the overall working of the network continuously. Hence it is decided to propose an efficient load balancing algorithm that adapts SDN. This paper proposes an efficient algorithm TAASLB-traffic-aware adaptive server load balancing to balance the flows to the servers in a data center network. It works based on two parameters, residual bandwidth, and server capacity. It detects the elephant flows and forwards them towards the optimal server where it can be processed quickly. It has been tested with the Mininet simulator and gave considerably better results compared to the existing server load balancing algorithms in the floodlight controller. After experimentation and analysis, it is understood that the method provides comparatively better results than the existing load balancing algorithms.
Efficient and Fair Bandwidth Allocation AQM Scheme for Wireless NetworksCSCJournals
Heterogeneous Wireless Networks are considered nowadays as one of the potential areas in research and development. The traffic management’s schemes that have been used at the fusion points between the different wireless networks are classical and conventional. This paper is focused on developing a novel scheme to overcome the problem of traffic congestion in the fusion point router interconnected the heterogeneous wireless networks. The paper proposed an EF-AQM algorithm which provides an efficient and fair allocation of bandwidth among different established flows. Finally, the proposed scheme developed, tested and validated through a set of experiments to demonstrate the relative merits and capabilities of a proposed scheme
Comparative analysis of the performance of various active queue management te...IJECEIAES
This paper demonstrates the robustness of active queue management techniques to varying load, link capacity and propagation delay in a wireless environment. The performances of four standard controllers used in Transmission Control Protocol/Active Queue Management (TCP/AQM) systems were compared. The active queue management controllers were the Fixed-Parameter Proportional Integral (PI), Random Early Detection (RED), Self-Tuning Regulator (STR) and the Model Predictive Control (MPC). The robustness of the congestion control algorithm of each technique was documented by simulating the varying conditions using MATLAB® and Simulink® software. From the results obtained, the MPC controller gives the best result in terms of response time and controllability in a wireless network with varying link capacity and propagation delay. Thus, the MPC controller is the best bet when adaptive algorithms are to be employed in a wireless network environment. The MPC controller can also be recommended for heterogeneous networks where the network load cannot be estimated.
Talhunt is a leader in assisting and executing IEEE Engineering projects to Engineering students - run by young and dynamic IT entrepreneurs. Our primary motto is to help Engineering graduates in IT and Computer science department to implement their final year project with first-class technical and academic assistance.
Project assistance is provided by 15+ years experienced IT Professionals. Over 100+ IEEE 2015 and 200+ yester year IEEE project titles are available with us. Projects are based on Software Development Life-Cycle (SDLC) model.
VHFRP: Virtual Hexagonal Frame Routing Protocol for Wireless Sensor NetworkIJCNCJournal
As physical and digital worlds become increasingly intertwined, wireless sensor networks are becoming an indispensable technology. A mobile sink may be required for some applications in the sensor field, where incomplete and/or delayed data delivery can lead to inappropriate conclusions. Therefore, latency and packet delivery ratios must be of high quality. In most existing schemes, mobile sinks are used to extend network lifetimes. By partitioning the sensor field into k equal sized frames, the proposed scheme creates a virtual hexagonal structure. Each frame header (FH) is linked together through the creation of a virtual backbone network. Frame headers are assigned to nodes near the centre of each frame. The virtual backbone network enables data collection from members of the frame and delivers it to the mobile sink. The proposed Virtual Hexagonal Frame Routing Protocol (VHFRP) improves throughput by 25%, energy consumption by 30% and delay by 9% as compared with static sink scenario.
VHFRP: VIRTUAL HEXAGONAL FRAME ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKIJCNCJournal
As physical and digital worlds become increasingly intertwined, wireless sensor networks are becoming an
indispensable technology. A mobile sink may be required for some applications in the sensor field, where
incomplete and/or delayed data delivery can lead to inappropriate conclusions. Therefore, latency and
packet delivery ratios must be of high quality. In most existing schemes, mobile sinks are used to extend
network lifetimes. By partitioning the sensor field into k equal sized frames, the proposed scheme creates a
virtual hexagonal structure. Each frame header (FH) is linked together through the creation of a virtual
backbone network. Frame headers are assigned to nodes near the centre of each frame. The virtual
backbone network enables data collection from members of the frame and delivers it to the mobile sink.
The proposed Virtual Hexagonal Frame Routing Protocol (VHFRP) improves throughput by 25%, energy
consumption by 30% and delay by 9% as compared with static sink scenario.
Token Based Packet Loss Control Mechanism for NetworksIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
Energy Behavior in Ad Hoc Network Minimizing the Number of Hops and Maintaini...CSCJournals
Wireless ad-hoc mesh network is a special kind of network, where all of the nodes move in time. The topology of the network changes as the nodes are in the proximity of each other. Ad-hoc networks are generally self-configuring no stable infrastructure takes a place. In this network, each node should help relaying packets of neighboring nodes using multi-hop routing mechanism. This mechanism is needed to reach far destination nodes to solve problem of dead communication. This multiple traffic "hops" within a wireless mesh network caused dilemma. Wireless mesh network that contain multiple hops become increasingly vulnerable to problems such as energy degradation and rapid increasing of overhead packets. This paper provides a generic routing framework that balances energy efficient broadcast schemes in Wireless (Ad-Hoc) Mesh Network and maintaining connectivity of nodes (mobile terminals). Typically, each node’s activities will consume energy, either for sending packets, receiving or preparing/processing packets. Number of hops, distance of nodes, and size of packet will determine the consumption of energy. The framework is based on the principle that additional relay nodes with appropriate energy and routing metric between source and final destination significantly reduces the energy consumption necessary to deliver packets in Wireless (Ad-Hoc) Mesh Network while keep the connectivity of dynamic nodes. Using the framework, the average network connectivity is kept 18% higher and the lifetime of network lasting more than 2.38% compared with network with Link State Routing mechanism. The simulation notes that the end-to-end delay may increase rapidly if relay nodes are more than five.
Effective Router Assisted Congestion Control for SDN IJECEIAES
Router Assisted Congestion Control (RACC) was designed to improve endto-end congestion control performance by using prior knowledge on network condition. However, the traditional Internet does not provide such information, which makes this approach is not feasible to deliver. Our paper addresses this network information deficiency issue by proposing a new congestion control method that works on the Software Defined Network (SDN) framework. We call this proposed method as PACEC (Path Associativity Centralized Congestion Control). In SDN, global view of the network information contains the network topology including link properties (i.e., type, capacity, power consumption, etc.). PACEC uses this information to determine the feedback signal, in order for the source to start sending data at a high rate and to quickly reach fair-share rate. The simulation shows that the efficiency and fairness of PACEC are better than Transmission Control Protocol (TCP) and Rate Control Protocol (RCP).
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields depth and
queue length. Queue length field solves the traffic-aware problem. Depth field creates a
backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential
field to make dynamic decision for data forwarding. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
TTACCA: TWO-HOP BASED TRAFFIC AWARE CONGESTION CONTROL ALGORITHM FOR WIRELESS...cscpconf
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields depth and
queue length. Queue length field solves the traffic-aware problem. Depth field creates a
backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential
field to make dynamic decision for data forwarding. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
Efficiency enhancement using optimized static scheduling technique in TSCH ne...IJECEIAES
In recent times, the reliable and real-time data transmission becomes a mandatory requirement for various industries and organizations due to the large utilization of Internet of Things (IoT) devices. However, the IoT devices need high reliability, precise data exchange and low power utilization which cannot be achieved by the conventional Medium Access Control (MAC) protocols due to link failures and high interferences in the network. Therefore, the Time-Slotted Channel Hopping (TSCH) networks can be used for link scheduling under the IEEE 802.15.4e standard. In this paper, we propose an Optimized Static Scheduling Technique (OSST) for the link scheduling in IEEE 802.15.4e based TSCH networks. In OSST the link schedule is optimized by considering the packet latency information during transmission by checking the status of the transmitted packets as well as keeping track of the lost data packets from source to destination nodes. We evaluate the proposed OSST model using 6TiSCH Simulator and compare the different performance metrics with Simple distributed TSCH Scheduling.
Call Admission Control (CAC) with Load Balancing Approach for the WLAN NetworksIJARIIT
The cell migrations take place between the different network operators, and require the significant information exchange between the operators to handle the migratory users. The new user registration requires the pre-shared information from the user’s equipment, which signifies the user recognition before registering the new user over the network. In this thesis, the proposed model has been aimed at the development of the new call admission control mechanism with the sub-channel assignment. The very basic utilization of the proposed model is to increase the number of the users over the given cell units, which is realized by using the sub-channel assignment to the users of the network. The proposed model is aimed at solving the issue by assigning the dual sub channels over the single communication channel. Also the proposed model is aimed at handling the minimum resource users by incorporating the load balancing approach over the given network segment. The load balancing approach shares the load of the overloaded cell with the cell with lowest resource utilization. The proposed model performance has been evaluated in the various scenarios and over all of the BTS nodes. The proposed model results have been obtained in the form of the resource utilization, network load, transmission delay, consumed bandwidth and data loss. The proposed model has shown the efficiency obtained by using the proposed call admission control (CAC) along with the new load balancing mechanism. The proposed model has shown the robustness of the proposed model in handling the cell overloading factors.
11th International Conference on Computer Science, Engineering and Informati...ijgca
11th International Conference on Computer Science, Engineering and Information
Technology (CSEIT 2024) will provide an excellent international forum for sharing knowledge
and results in theory, methodology and applications of Computer Science, Engineering and
Information Technology. The Conference looks for significant contributions to all major fields of
the Computer Science and Information Technology in theoretical and practical aspects. The aim
of the conference is to provide a platform to the researchers and practitioners from both academia
as well as industry to meet and share cutting-edge development in the field.
SERVICE LEVEL AGREEMENT BASED FAULT TOLERANT WORKLOAD SCHEDULING IN CLOUD COM...ijgca
Cloud computing is a concept of providing user and application oriented services in a virtual environment.
Users can use the various cloud services as per their requirements dynamically. Different users have
different requirements in terms of application reliability, performance and fault tolerance. Static and rigid
fault tolerance policies provide a consistent degree of fault tolerance as well as overhead. In this research
work we have proposed a method to implement dynamic fault tolerance considering customer
requirements. The cloud users have been classified in to sub classes as per the fault tolerance requirements.
Their jobs have also been classified into compute intensive and data intensive categories. The varying
degree of fault tolerance has been applied consisting of replication and input buffer. From the simulation
based experiments we have found that the proposed dynamic method performs better than the existing
methods.
SERVICE LEVEL AGREEMENT BASED FAULT TOLERANT WORKLOAD SCHEDULING IN CLOUD COM...ijgca
Cloud computing is a concept of providing user and application oriented services in a virtual environment.
Users can use the various cloud services as per their requirements dynamically. Different users have
different requirements in terms of application reliability, performance and fault tolerance. Static and rigid
fault tolerance policies provide a consistent degree of fault tolerance as well as overhead. In this research
work we have proposed a method to implement dynamic fault tolerance considering customer
requirements. The cloud users have been classified in to sub classes as per the fault tolerance requirements.
Their jobs have also been classified into compute intensive and data intensive categories. The varying
degree of fault tolerance has been applied consisting of replication and input buffer. From the simulation
based experiments we have found that the proposed dynamic method performs better than the existing
methods.
11th International Conference on Computer Science, Engineering and Informatio...ijgca
11th International Conference on Computer Science, Engineering and Information Technology (CSEIT 2024) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Computer Science, Engineering and Information Technology. The Conference looks for significant contributions to all major fields of the Computer Science and Information Technology in theoretical and practical aspects. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas, but are not limited to.
Load balancing functionalities are crucial for best Grid performance and utilization. Accordingly,this
paper presents a new meta-scheduling method called TunSys. It is inspired from the natural phenomenon of
heat propagation and thermal equilibrium. TunSys is based on a Grid polyhedron model with a spherical
like structure used to ensure load balancing through a local neighborhood propagation strategy.
Furthermore, experimental results compared to FCFS, DGA and HGA show encouraging results in terms
of system performance and scalability and in terms of load balancing efficiency.
11th International Conference on Computer Science and Information Technology ...ijgca
11th International Conference on Computer Science and Information Technology (CSIT 2024) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Computer Science and Information Technology. The Conference looks for significant contributions to all major fields of the Computer Science and Information Technology in theoretical and practical aspects. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
AN INTELLIGENT SYSTEM FOR THE ENHANCEMENT OF VISUALLY IMPAIRED NAVIGATION AND...ijgca
Technological advancement has brought the masses unprecedented convenience, but unnoticed by many, a
population neglected through the age of technology has been the visually impaired population. The visually
impaired population has grown through ages with as much desire as everyone else to adventure but lack
the confidence and support to do so. Time has transported society to a new phase condensed in big data,
but to the visually impaired population, this quick-pace living lifestyle, along with the unpredictable nature
of natural disaster and COVID-19 pandemic, has dropped them deeper into a feeling of disconnection from
the society. Our application uses the global positioning system to support the visually impaired in
independent navigation, alerts them in face of natural disasters, and reminds them to sanitize their devices
during the COVID-19 pandemic
13th International Conference on Data Mining & Knowledge Management Process (...ijgca
13th International Conference on Data Mining & Knowledge Management Process (CDKP 2024) provides a forum for researchers who address this issue and to present their work in a peer-reviewed forum.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas, but are not limited to these topics only.
Call for Papers - 15th International Conference on Wireless & Mobile Networks...ijgca
15th International Conference on Wireless & Mobile Networks (WiMoNe 2023) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Wireless & Mobile computing Environment. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Wireless, Mobile Networks & its applications had received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
Call for Papers - 4th International Conference on Big Data (CBDA 2023)ijgca
4th International Conference on Big Data (CBDA 2023) will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the areas of Big Data. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of Big Data.
Call for Papers - 15th International Conference on Computer Networks & Commun...ijgca
15th International Conference on Computer Networks & Communications (CoNeCo 2023) looks for significant contributions to the Computer Networks & Communications for Wired and Wireless Networks in theoretical and practical aspects. Original papers are invited on Computer Networks, Network Protocols and Wireless Networks, Data Communication Technologies, and Network Security. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Call for Papers - 15th International Conference on Computer Networks & Commun...ijgca
15th International Conference on Computer Networks & Communications (CoNeCo 2023) looks for significant contributions to the Computer Networks & Communications for Wired and Wireless Networks in theoretical and practical aspects. Original papers are invited on Computer Networks, Network Protocols and Wireless Networks, Data Communication Technologies, and Network Security. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Call for Papers - 9th International Conference on Cryptography and Informatio...ijgca
9th International Conference on Cryptography and Information Security (CRIS 2023) provides a forum for researchers who address this issue and to present their work in a peer-reviewed forum. It aims to bring together scientists, researchers and students to exchange novel ideas and results in all aspects of cryptography, coding and Information security.
Call for Papers - 9th International Conference on Cryptography and Informatio...ijgca
9th International Conference on Cryptography and Information Security (CRIS 2023) provides a forum for researchers who address this issue and to present their work in a peer-reviewed forum. It aims to bring together scientists, researchers and students to exchange novel ideas and results in all aspects of cryptography, coding and Information security.
Call for Papers - 4th International Conference on Machine learning and Cloud ...ijgca
4th International Conference on Machine learning and Cloud Computing (MLCL 2023) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Cloud computing. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
Call for Papers - 11th International Conference on Data Mining & Knowledge Ma...ijgca
11th International Conference on Data Mining & Knowledge Management Process (DKMP 2023) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Data Mining and knowledge management process. The goal of this conference is to bring together researchers and practitioners from academia and industry to focus on understanding Modern data mining concepts and establishing new collaborations in these areas.
Call for Papers - 4th International Conference on Blockchain and Internet of ...ijgca
4th International Conference on Blockchain and Internet of Things (BIoT 2023) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Blockchain and Internet of Things. The Conference looks for significant contributions to all major fields of the Blockchain and Internet of Things in theoretical and practical aspects.
Call for Papers - International Conference IOT, Blockchain and Cryptography (...ijgca
International Conference IOT, Blockchain and Cryptography (IOTBC 2023) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT, Blockchain and Cryptography.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas, but are not limited to these topics only.
Call for Paper - 4th International Conference on Cloud, Big Data and Web Serv...ijgca
4th International Conference on Cloud, Big Data and Web Services (CBW 2023) will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the areas of Cloud, Big Data and Web services. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of Cloud, Big Data and web services.
Call for Papers - International Journal of Database Management Systems (IJDMS)ijgca
The International Journal of Database Management Systems (IJDMS) is a bi monthly open access peer-reviewed journal that publishes articles which contributenew results in all areas of the database management systems & its applications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on understanding Modern developments in this filed and establishing new collaborations in these areas.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
ANALYSIS OF LINK STATE RESOURCE RESERVATION PROTOCOL FOR CONGESTION MANAGEMENT IN SMART WEB HOTSPOT ENVIRONMENTS
1. International Journal of Grid Computing & Applications (IJGCA) Vol.7, No.2, June 2016
DOI:10.5121/ijgca.2016.7201 1
ANALYSIS OF LINK STATE RESOURCE
RESERVATION PROTOCOL FOR CONGESTION
MANAGEMENT IN SMART WEB HOTSPOT
ENVIRONMENTS
Anulika Okoye Joy1
, K.C. Okafor2
, I.A Godspower3
and O.A.Chinedu4
1
Dept.of Electrical and Electronic Engineering, Chukwuemeka Odumegwu Ojukwu
University, (COOU) Uli, Anambra State, Nigeria
2
Dept. of Electrical and Electronic Engineering, Federal University of Technology
(FUTO), Owerri, Nigeria
3
Dept. of Computer Science, Nnamdi Azikiwe University (UNIZIK), Awka, Nigeria
4
Dept. of Electronic and Computer Engineering, Nnamdi Azikiwe University (UNIZIK),
Awka, Nigeria.
ABSTRACT
With the wide spread of WiFi hotspots, concentrated traffic workload on Smart Web (SW) can slow down
the network performance. This paper presents a congestion management strategy considering real time
activities in today’s smart web. With the SW context, cooperative packet recovery using resource
reservation procedure for TCP flows was adapted for mitigating packet losses. This is to maintain data
consistency between various access points of smart web hotspot. Using a real world scenario, it was
confirmed that generic TCP cannot handle traffic congestion in a SW hotspot network. With TCP in
scalable workload environments, continuous packet drops at the event of congestion remains obvious. This
is unacceptable for mission critical domains. An enhanced Link State Resource Reservation Protocol (LS-
RSVP) which serves as dynamic feedback mechanism in smart web hotspots is presented. The contextual
behaviour was contrasted with the generic TCP model. For the LS-RSVP, a simulation experiment for TCP
connection between servers at the remote core layer and the access layer was carried out while using
selected benchmark metrics. From the results, under realistic workloads, a steady-state throughput
response was achieved by TCP LS-RSVP to about 3650Bits/secs compared with generic TCP plots in a
previous study. Considering network service availability, this was found to be dependent on fault-tolerance
of the hotspot network. From study, a high peak threshold of 0.009 (i.e. 90%) was observed. This shows
fairly acceptable service availability behaviour compared with the existing TCP schemes. For packet drop
effects, an analysis on the network behaviour with respect to the LS-RSVP yielded a drop response of about
0.000106 bits/sec which is much lower compared with the case with generic TCP with over 0.38 bits/sec.
The latency profile of average FTP download response was found to be 0.030secs, but with that of FTP
upload response, this yielded about 0.028 sec. The results from the study demonstrate efficiency and
optimality for realistic loads in Smart web contexts.
KEYWORDS
Hotspot Networks, TCP Flows, Traffic Congestion, Throughput, latency, Service Availability
1. INTRODUCTION
Smart web represents a disruptive paradigm shift in the generic wireless network architecture. It
makes web services to serve both the real and virtual world users [1]. This type of web model is
2. International Journal of Grid Computing & Applications (IJGCA) Vol.7, No.2, June 2016
2
sensitive to targeted things/objects, application physical environments, or even situations, and
respond proactively and intelligently. In Smart web, network congestion occurs when the
resource demand is greater than the available computing resources, such as bandwidths of links,
buffer memory space and CPU processing capacity, etc, at the intermediate nodes (such as
routers, servers, storage, etc). However, Smart Congestion Control (SCC) is a modified
perspective to existing congestion management schemes. This is because it focuses on using
baseline feedback resource allocation to maintain an acceptable performance level on the demand
of the available network resources. Therefore, a well detailed design is required to provide
optimal service delivery under heavy realistic workload in smart web. Existing networks and
methods for implementing context-aware web services on web 2 and 3 mainly enumerate
different implementations corresponding to different attribute values of the network context in
order to improve QoS. As things in the physical work merges with the virtual world, there is need
to evolve a flexible congestion free network for smart web service of things.
This paper proposes a novel smart web services congestion control algorithm for end user context
of things. When neglected, traffic oscillation that is highly disruptive will be evidenced in smart
web networks. Consequently, TCP LS-RSVP is proposed to manage context of things in smart
web services network. This implies that users can hardly notice any form of congestion in the
network.
2. CLASSICAL THEORIES ON GENERIC TCP WLAN CONGESTION
ALGORITHM
Before the advent of smart web internet, the current use of Wireless Local Area Networks
(WLAN IEEE 802.11) hotspot for Internet access from wireless stations was dominated by
downlink Transmission control Protocol (TCP) traffic. The TCP [2], is basically used to provide
reliable communications on top of IP and Ethernet, as it employs loss-based congestion control
algorithm. Packet loses are evidence with this type of algorithm as the rate of sending precisely
controlled. Besides, point to point queuing delay can grow to the extreme maximum [3]. It known
that the characteristics of TCP have not been sufficiently taken into account for data transport
over WLANs [4] for smart web services.
Clearly, the congestion challenges found in hotspot infrastructures in homes, offices, and public
areas has not been fully addressed [5] [6]. This has necessitated alternative approaches in smart
computing.
To understand the issue of WLAN congestion, the important layers in IEEE 802.11 WLAN such
as the Media Access Control (MAC) and Physical (PHY) layers have been defined by the IEEE
802.11 standard [6]. It has been observed that Flow-Aware WLANs [7] uses the Distributed
Coordination Function (DCF) to coordinate channel access. However, in smart computing, TCP
based Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) is still insufficient
for a successful data frame transmission [4]. The duplication of acknowledgment functions at the
MAC and transport layers, window size issues and other related overheads can significantly
degrade the throughput performance in smart web computing. Hence, TCP scheme will hardly
satisfy the QoS requirement of smart web in today’s network.
In this paper, smart web refers to the online usage of intelligent and productive resources for
effective computing. Examples include, chat services, download repositories (Google play store
apps), On-demand storage/billing and Enterprise Resource Planning Systems (ERPs). There is
3. International Journal of Grid Computing & Applications (IJGCA) Vol.7, No.2, June 2016
3
need for a scheme that can eliminate the duplication of the two acknowledgements on the hotspot
WLAN for smart web services. This scheme should produce a significant performance
improvement, particularly in the infrastructure-mode WLAN running smart web services through
an access point (AP). Congestion management in smart web computing will be explored through
a proposed LS-RSVP.
3. RELATED WORK
3.1. Congestion Management in Hotspots
Rigorous study of literature reveals that efforts have been made to alleviate network congestion in
wireless environments. The authors in [8], proposed a conceptual design model for high
performance hotspot network infrastructure, (GRID WLAN) while investigating the effects of
GRID WLAN access point buffer size distributions with respect to load intensities as well as
fragmentation capacities.
The authors in [9] developed a rate estimation algorithm that uses symbol level combining for
cooperative packet recovery in enterprise WLAN. Mobility susceptibility was discussed in [10]
where node capacity and power consumption level contributes to TCP performance degradation
often leading to packet losses.
The work in [11] focused on Delay Tolerant Networks (DTN) while proposing a buffer
management policy for message controls by node buffers. Congestion behaviour an IEEE 802.11
based WLAN hosting web and shared file system was discussed in [12]. From their work, a
queuing model, which provides the mean session delay in the presence of short-lived flows in the
network, was developed. Their analysis accounts for the TCP delayed ACK option in the
network. A TCP flow-aware wireless mesh network was presented in [13] while the authors in
[14] presented a network performance optimization strategy. In [15], a novel transport protocol in
the TCP/UDP family that provides a congestion-control was presented. This takes care of the
flow of unreliable datagram. The works in [16], [17], [18] discussed on WLANs networks with
related TCP congestion schemes.
From the review studies, a link state algorithm considering a two stage BSS model and other
WLAN infrastructural (offering FTP and HTTP) services for a high density network is yet to be
developed. This will offer a useful guild to developing Internet of Things (IoT) network QoS
evaluation. This paper, will use a real testbed as a requirement for the study of generic TCP
congestion control scheme in a wireless network scenario. It is argued that a well designed
network testbed that provides stable data rates, excellent buffer management, and wireless packet
recycling with a fair level of QoS services for all traffic sources must be maintained.
3.2. Limitations of Existing Schemes
Based on the analysis of existing research efforts, the following observations are highlighted:
- Existing works failed to account for explicit resource reservation for TCP flows thereby
avoiding packet losses in heavily congested environment while still allowing nodes to
gain fair access to the channel.
- Existing works still limits their discussion to frame transmissions at 1Mbps and 11Mbps
for all congestion levels. This is unacceptable for current high density hotspot
implementations for smart web services.
4. International Journal of Grid Computing & Applications (IJGCA) Vol.7, No.2, June 2016
4
- At high congestion levels, details on successful transmission of large frames/packets has
not been fully addressed
- The issue of quality of service (QoS) only considered connection oriented protocol-TCP
and not connectionless oriented protocols –UDP
- The feedback algorithms in existing works induce over 30% network delay, thereby
creating a non responsive network.
The deficiencies in the IEEE 802.11 protocols considering TCP flow implementations demands
for an improved strategy. This research will empirically analyse a heavily-congested wireless
network using LS-RSVP. This will be carried out to offer significant insight into the behaviour of
SW network. With the insight, this can be utilized to design better systems and protocols
4. RESEARCH METHODOLOGY
The methodology used in this work follows the decomposition of traffic bucket for congestion
management in a selected reference testbed. Using a real world testbed (University of Nigeria,
ICT datacenter hotspot) that supports interactive traffic such as Telnet, voice over IP, text data,
email, http etc, Ethereal Wireshark was used to observe TCP packet drops with increased queues
(network users) carrying out large packet LAN-to-LAN FTP transfers, browsing, downloading,
etc. This becomes obvious as they are queue on slower links. The approach here is to investigate
on a traditional TCP-IP congestion scheme on the basis of QoS features such as delay,
throughput, jitter, etc on slower-speed links. Fig.1 is a representative framework of a traditional
TCP-IP congestion control mechanism depicted in UNN as a case study.
Figure 1. A model for traditional TCP-IP Congestion Control Mechanism
Having identified the challenges found in Fig.1, this work then developed a replacement model
shown in Fig.2. In this case, the dataset behaviour of ethereal Wireshack in the production
network running interactive traffic such as Telnet, Voice over IP, email, http, etc was leveraged
for the study. With this replacement framework, services will be less susceptible to packet drops
even at high realistic loads. With the resource reservation, latency and jitter will be minimized
5. International Journal of Grid Computing & Applications (IJGCA) Vol.7, No.2, June 2016
5
particularly, when the network processes large packets (for example, LAN-to-LAN FTP transfers
traversing a WAN link). This suits the hotpot scenario where down time is dreaded. This
framework offers a more viable congestion avoidance scheme within the context of smart
computing in the hotspot infrastructure. As shown in Fig.2, the rate regulator controls incoming
traffic as well as utilizes the buffer resources for queuing. FIFO scheduling is then used to output
services after some form of processing.
Figure 2. An Improved TCP-IP Congestion Control Mechanism based on LS-RSVP
4.1. Algorithm for Link State Resource Reservation Setup Mechanism
Various works on congestion management has been studied previously with some identified the
research gaps. This section focused on formulating the algorithm of smart web LS-RSVP
considering the entire network architecture and some QoS metrics for evaluations. The Riverbed
C++ Modeller simulator was used for the configuration and implementation. The profile and
application palettes were set up for all the intended services for a hotspot scenario. These services
occur on three levels: Application—RSVP interface process level, RSVP process level, Traffic
Control process levels. RSVP is a hop-by-hop feedback QoS signaling protocol. This means that
LS-RSVP messages are transmitted from a source node to a destination sink using RSVP-aware
data path. The LS-RSVP approach handles traffic flow a sender to a sink node as logically
independent of other users on the network. Meanwhile, a reservation is made for each
transmission cycle. The flow in RSVP is a form of full duplex communication where the
reservations for traffic users can be made from any or both directions. The reservation setup
mechanism is shown in the algorithm in Table 1.
6. International Journal of Grid Computing & Applications (IJGCA) Vol.7, No.2, June 2016
6
Table 1: LS-RVSP for Smart Web Congestion Control
From the algorithm in Table 1, a unicast or multicast flow compel a sender node to be aware of
the characteristics of the sink node before instantiating the LS-RSVP. There could be regular or
periodic updates using RSVP messages. Every request and acknowledgement including the state
of the network resource like link bandwidth, buffer sizes, etc are satisfied before any form of
transmission can take place. The sink will always request for a notification about the status of the
connecting network devices. An affirmative confirmation implies that the network resource
conditions are satisfied. In this case, feedback signalling is used to accept the incoming or out-
going messages. Link prediction is found useful in this regard. If the reservation is successful, a
Resv state is created in the data path as well as in the entire network. In each instance, when the
congestion state exceeds the device holding capacity, the feedback path as depicted in Fig. 2 is
instantiated. In the implementation, the LS-RSVP is achieved in the simulation design. The
supported services the network context whose process runs only in IP-enabled nodes include the
following applications: Database, Email, FTP, Remote Login, Video Conferencing (for both
unicast and multicast sessions), and Voice (for both unicast and multicast sessions). The merits of
LS-RSVP are discussed below.
4.2. Advantages of Smart Web LS-RSVP Algorithm
While the proposed algorithm LS-RSVP has the ability to adjust the transmission rate constraints
based on congestion feedback with resource reservations, it still has constraints on how this
adaptation can be performed to minimize unpredictable QoS issues. Thus, it will need some
control over the short-term dynamics of congestion disturbances while being fair to other traffic
on medium timescales. The merits of the proposed algorithm include:
i. Low per-packet overhead. Here, Smart web service communication will achieve lower
delay in terms of response time with high throughput. Protocol overhead does not expand
the packets unduly leading to fast response times or latency.
ii. Middlebox Traversal: TCP-Friendly Rate Control (TFRC) and TCP layer 4dynamic
modulation feedbacks are a congestion control mechanisms that adjusts its sending rate
more smoothly than the generic TCP does, while maintaining long-term fair bandwidth
sharing with TCP.
iii. QoS fairness and Stability: The scheme offers a rate based feedback that is light
weighted while supporting congestion control. Clearly, QoS fairness and stability are
achieved by instantaneous feedback negotiation in the Fig. 2.
7. International Journal of Grid Computing & Applications (IJGCA) Vol.7, No.2, June 2016
7
5. PERFORMANCE EVALUATIONS
5.1. Simulation Testbed
To demonstrate the network architecture of the hotspot environment running LS-RSVP algorithm
implementation, a simulation testbed experiment was built with OPNET IT Guru 9.1 (now
riverbed modeller 17.5). The LS-RSVP algorithm is then configured in the OPNET engine. This
consists of a large scale remote datacenter servers running Http and web services. Ten subnet
sites were created which houses 100 smart mobile client nodes. Also, ten access points were used
as their respective base stations. Then an IP gateway router was used to connect all the smart web
users to the IP cloud. The TCP LS-RSVP algorithm was configured in the trace files for all
mobile nodes including the APs in six basic configuration scenarios. In this case, load variation
was made from five users to forty users in the ten subnets sites. The subnet sites and IP gateway
cloud emulates the smart web WAN link with the desired throughput, delay/latency, service
availability, packet data drop, FTP/HTTP latency profiles. Now, Fig 2 was implemented in
OPNET IT Guru which was used to generate the parameters for the case scenario in the
simulations. Traffic attributes for the smart web WLAN were configured in the simulation
engine. The runtime environment attribute were as follows in the OPNET simulator. In the
characterization of the experimental and simulation testbed, the configured with values in the
OPNET engine was leveraged. Simulation duration of 120minutes for each scenario was used;
Link propagation delay was set at 0.5millisecons. The switch output buffer has 100packets with
an update interval of 5000events. Various TCP variants were also enabled. Running the test bed,
the following metrics were measured viz: throughput, Delay/latency, service availability, packet
data drop, FTP/HTTP latency profiles, via template scenario of Fig. 3 which shows the validation
testbed while Fig.4 and 5 shows the link State RSVP successful simulation run/compilation for
smart web context following Table 2
Table 2: Smart Web -WLAN Simulation Parameter Table for TCP LS-RSVP
8. International Journal of Grid Computing & Applications (IJGCA) Vol.7, No.2, June 2016
8
Figure 3. Validation testbed with Smart web WLAN Subnet 0 to subnet 10.
Figure 4. Link State RSVP successful simulation Run
Figure 5. Hotspot WLAN Realistic Load Traffic Animation Scenario
9. International Journal of Grid Computing & Applications (IJGCA) Vol.7, No.2, June 2016
9
5.2. Analysis of Results
In this work, an evaluation on LS-RSVP TCP variant was carried out for the smart web network
infrastructure using the selected QoS metrics. Essentially, the smart web QoS explains the overall
performance of the network as perceived by the end users. The analysis in context focused on
using a quantitative approach to analyze the QoS behaviour in the proposed network. These are
briefly discussed below.
i. Throughput QoS Response
Fig. 6 illustrates the steady-state throughput response achieved by TCP LS-RSVP algorithm
under realistic loads. Interestingly, the algorithm shows a progressive line trend over a long
duration of time with peak throughput value of over 3650Bits/secs. This value is relatively higher
than most TCP schemes. This is due to its connection oriented behavior leading to non
degradation of the network as user density increases under realistic load conditions. In high
performance computing networks, this type of behaviour will facilitate network scalability with
dynamic services automation on the cluster server backbone. The trade-off could be cost of
maintenance which is currently addressed by bare-metal virtualization and dynamic over
allocation schemes. This could be a very good reason for consolidation of servers and other
logical resources in smart web infrastructures.
Figure 6: LS-RSVP Throughput Plot
ii. Delay QoS Response
Fig.7 shows the latency plot of LS-RSVP under realistic load in smart web environment. It
represents the performance seen by the smart web users in the network. It was observed that
latency trend curve began from zero and normalized at 0.0004s for the WLAN realistic load
scenario. Essentially, the proposed LS-RSVP showed a comparative latency response when with
generic TCP. It maintained a steady rate of about 0.0004s relative to generic TCP control scheme.
The feedback algorithm of Fig. 2 scenario enabled fast initialization for incremental users on the
network under peak congestion states. A delay or latency value of 0.0004s literally implies a very
10. International Journal of Grid Computing & Applications (IJGCA) Vol.7, No.2, June 2016
10
fast network. This will directly impact on the network throughput, thereby enhancing users
experience on the smart web.
Figure 7: LS-RSVP Delay Plot
iii. Network Service Availability QoS Analysis
Fig. 8 depicts the network service availability response plot of the congestion state. The network
availability is dependent on fault-tolerance of the bulk arrival and bulk service policy in smart
web hotspot network. A high uptime or service availability depicts an acceptable operational
performance. By eradicating single point of failures through redundancy, introducing efficient
crossover as well as failure detection systems, reliability could be derived.
To study the performance under link failures (downtime), the link interfaces were manually
unplugged in some selected hotspot sites and then plugged in at time 42s in the simulation panel.
Also few backend servers [1 to 2] were shut down at time 104s in order to assess the impact of
congestion modes of LS-RSVP. Interestingly, path convergence was observed. The LS-RSVP
traffic was maintained as well and the CPU utilizations are about 40%, and 45%, for senders, and
receivers, respectively. This is a different scenario for generic TCP based networks. In context,
this work makes two observations from the experiment. First, the smart web WLAN is a very
resilient to congestion failures. The network throughput is recovered to the best value after only a
few seconds compared to generic TCP congestion mechanism.
Second, the smart WLAN implementation detects link failures and node failures much faster than
generic TCP algorithm because it uses medium sensing network capacity, with its fault tolerant
and suppression routing algorithm.
Figure 8: Network Service Availability Response Plot
11. International Journal of Grid Computing & Applications (IJGCA) Vol.7, No.2, June 2016
11
Clearly, from the plot in Fig. 8, it was showed that the proposed LS-RSVP hotspot smart WLAN
had relatively more service availability compared with the existing TCP WLAN model. For the
flow traffic, the peak threshold occurred at 0.009. i.e. 90% which is fairly acceptable. In the
production environment, this must be improved upto 99.99999% which will amount to 0.0864ms
downtime per day. When the system is up, smart web services will remain available. The network
outage could only occur when the redundant components fail as a result of human or machine
error. In this regard, effective load balancing and failover are active redundant schemes used in
smart web cloud environment to achieve zero performance degradation or even outage of any
kind.
iv. Packet Drop Effects
In this case, an analysis on the network behavior with respect to the LS-RSVP algorithm
discussed previously was carried out. Fig. 9 shows the end-to-end packet drop result of the LS-
RSVP algorithm for two-tier topology of Fig.3 topology reflecting the discussion carried out in
this study. From the result, packet drop response shows a great dissimilarity with previous study.
As observed in the plot, packet drop response was observed to be about 0.000106 bits/sec which
is much lower compared with the case with generic TCP with over 0.38 bits/sec. At the event of
congestion, its feedback loop recycles packets avoiding congestion scenarios.
Figure 9: Packet Drop Response (Bits/Secs)
v. FTP, HTTP Latency Profiles
Fig. 10 shows the latency profile of average FTP download response to be 0.030secs with that of
FTP upload response is about 0.028 sec. Fig.11 shows the latency profile of average HTTP page
response to be 0.0389 secs. From the context of smart web WLAN, these values demonstrate
efficiency and optimality for realistic loads.
12. International Journal of Grid Computing & Applications (IJGCA) Vol.7, No.2, June 2016
12
Figure 10: FTP Latency Profile
Figure 11: HTTP Latency Profile
In summary, the proposed link state algorithm (LS-RSVP) which is based on a two stage BSS
model and other WLAN infrastructures have been described. In the network, a consideration for
FTP and HTTP services in a high density network has been discussed in relation to smart web
networks. This was carried out after considering a real life testbed that have limitations based on
generic TCP congestion control scheme for a wireless network scenario in an earlier work [8]. A
13. International Journal of Grid Computing & Applications (IJGCA) Vol.7, No.2, June 2016
13
well design network testbed that provides stable data rates, excellent buffer management for APs
and wireless devices with packet recycling and a fair level of Quality of Services for all traffic
sources was achieved for smart web environment. The framework for the proposed link state TCP
algorithm implementation was realized with a trace file in Riverbed C++ Modeller prediction
model. The essential parameters in this research includes viz: Throughput, delay, throughput,
service availability, utilization.
6. CONCLUSIONS
In this paper, an improved congestion management scheme was introduced in smart hotspot
networks considering realistic loads. The use LS-RSVP for effective QoS provisioning was
discussed while outlining its merits. The limitations of existing works were highlighted while
justifying our initial proposal, via a simulation study for the selected metrics. With existing TCP
scheme, smart web networks will continually experience congestion under realistic loads. The
proposed LS-RSVP uses dynamic feedback mechanism in any given hotspots environment to
improve QoS. Besides its can dynamically adapt to extended service set designs. From the
results, under realistic loads, the steady-state throughput response achieved by TCP LS-RSVP
algorithm was observed to about 3500 packet/bits compared with TCP plots in our earlier
empirical study. The latency plot of LS-RSVP under realistic load maintained a steady rate of
about 0.0004s which makes network process automation easily achievable compared with
existing TCP schemes. Considering network service availability, this was observed to be
dependent on fault-tolerance of the hotspot network (i.e. its redundancy design). In this regard, a
fairly observable peak threshold was achieved. This opined to be a reasonable service availability
compared with the existing TCP WLAN model. For packet drop effects, an analysis on the
network behavior with respect to the LS-RSVP algorithm yielded a lower packet drop response of
compared with the case with generic TCP. Further, it was showed that the latency profile of
average FTP download and FTP upload responses are satisfactory for smart web services
provisioning. Future work will present the validation and empirical results from a mathematical
model of the system testbed.
7. ACKNOWLEDGEMENTS
We wish to thank the University of Nigeria Nsukka ICT innovation center network administrators
and Kswitche Research & Consults Groups for their informed technical inputs and supports.
REFERENCES
[ 1] J.He, Y.Zhang, G.Huang, J.Cao, ( 2012), “A smart web service based on the context of things”,
Journal ACM Transactions on Intenet Technology(TOIT), Vol.11, Issue 3, New york, USA.
[ 2] S.Floyd, et.al, (1999) “The NewReno Modification to TCP’s fast Recovery Algorithm”, RFC
2582,IETF.
[ 3] H.Shimonishi, J.Higuch, T.Yoshikawa, and Atsushi Iwata, “A Congestion Control Algorithm For
DataCenter Area Communications,
[ 4] Qixiang Pang, Soung C. Liew, Victor C.M. Leung, “Performance Improvement of 802.11 Wireless
Access Network with TCP ACK Agent and Auto-Zoom Backoff Algorithm.
[ 5] M. S. Gast, (2002), “ 802.11 Wireless Networks: The Definitive Guides”, O’Reilly.
[ 6] IEEE Standard for Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY)
Specifications, (1999), ISO/IEC 8802-11:1999E)..
[ 7] S. Oueslati and J. Roberts, (2005), “A new direction for quality of service: Flow-aware Networking,”
in NGI 2005, Rome, Italy.
14. International Journal of Grid Computing & Applications (IJGCA) Vol.7, No.2, June 2016
14
[ 8] Udeze C. C, Okafor K.C, H. C Inyiama, C. C. Okezie, (2012) “ A Conceptual Design Model for High
Performance Hotspot Network Infrastructure (GRID WLAN)”, (IJACSA) International Journal of
Advanced Computer Science and Applications, Vol. 3, No. 1, Pp.93-99 .
[ 9] Mahanth Gowda, Souvik Sen,Romit Roy Choudhury, Sung-Ju Lee, “Cooperative Packet Recovery in
Enterprise WLANs”
[ 10] Haniza N., Zulkiflee M., Abdul S.Shibghatullah, Shahrin S., Congestive Loss in Wireless Ad hoc
Network-Network Performance Analysis“World of Computer Science and Information Technology
Journal (WCSIT) ISSN: 2221-0741 Vol. 1, No. 6, 269-273, 201. Pp. 269-273
[ 11] Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulos, (2008),“ “Optimal Buffer Management
Policies for Delay Tolerant Networks” In Proc. 2nd Conf. San fransico.
[ 12] Daniele Miorandi a,Arzad A. Kherani b, Eitan Altman,(2006),“A queuing model for HTTP traffic
over IEEE 802.11 WLANs, Computer Networks50, 63–79.
[ 13] Juan J. Galvez, Pedro M. Ruiz, Antonio F. Gomez Skarmeta, “TCP flow-aware Channel Re-
Assignment in Multi-Radio Multi-Channel Wireless Mesh Networks”
[ 14] Amit P. Jardosh Krishna N. Ramachandran Kevin C. Almeroth Elizabeth M. Belding-Royer,
“Understanding Congestion in IEEE 802.11b Wireless Networks”,
[ 15] Eddie Kohler, Mark Handley, Sally Floyd, “Designing DCCP: Congestion Control Without
Reliability.
[ 16] Ghaida A. AL-Suhail, Turki Y. Abdallah, and Omar Majid, (2012), “Fuzzy-Logic Adaptive Queuing
For A Heuristic TCP Performance In Mobile Wireless Networks”, International Journal of Computer
Networks & Communications (IJCNC) Vol.4, No.3, Pp. 191-205.
[ 17] Welzl M. “Network Congestion Control: Managing Internet Traffic,” 282 pages, July 2005.
[ 18] J. Widmer, C. Boutoemans, J. Y. Boudec, (2004), “End-to-End Congestion Control for TCP Friendly
Flows with Variable Packet Size”, ACM SIGCOMM 2004.
[ 19 ]J.C. Ochi, C.O. Ohaneme, A.C.O. Azubog,(2015), “Development of an Intelligent Fuzzy-Based
Algorithm for Data Congestion Management Scheme in Wireless LAN”, International Journal of
Innovative Technology and Exploring Engineering (IJITEE),Vol.5 Issue-5, Pp.`5-26