Abstract—In this paper we consider a local area network (LAN) of dual mode service
where one is a token bus and the other is a carrier sense multiple access with a collision
detection (CSMA/CD) bus. The objective of the paper is to find the overall cell/packet
dropping probability of a dual mode LAN for finitelength queue M/G/1(m) traffic. Here, the
offered traffic of the LAN is taken to be the equivalent carried traffic of a one-millisecond
delay. The concept of a tabular solution for two-dimensional Poisson’s traffic of circuit
switching is adapted here to find the cell dropping probability of the dual mode packet
service. Although the work is done for the traffic of similar bandwidth, it can be extended
for the case of a dissimilar bandwidth of a circuit switched network.
In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive network routing is investigated. Shortest Path routing is always not suitable for any wireless mobile network as in high traffic conditions, shortest path will always select the shortest path which is in terms of number of hops, between source and destination thus generating more congestion. In prioritized sweeping reinforcement learning method, optimization is carried out over confidence based dual reinforcement routing on mobile ad hoc network and path is selected based on the actual traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis is done on 50 Nodes Mobile ad hoc networks with random mobility. Various performance parameters such as Interval and number of nodes are used for judging the network. Packet delivery ratio, dropping ratio and delay shows optimum results using the prioritized sweeping reinforcement learning method.
Impact of le arrivals and departures on bufferingenioustech
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/
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Our area of interest for the paper is the improvement of performance of DSR routing protocol by
changing in algorithm and this Improved DSR protocol should compare with remaining protocols
taken in this research paper.
2. In this paper we made changesin traditional DSR protocol and generation of new improved DSR the
different performance parameters and compare with AODV/DSR/DSDV protocols in mobility and
non- mobility scenarios nodes up to 300.
3. We can plot the graphs throughput, End to end Delay, Packet delivery Ratio, Dropping Ratio, and
average energy consumption on Mobility and Non-Mobility scenario by using Network Simulator
version 2.34 for Modified DSR protocols. M-DSR, DSDV perform well when Mobility is low.
In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive network routing is investigated. Shortest Path routing is always not suitable for any wireless mobile network as in high traffic conditions, shortest path will always select the shortest path which is in terms of number of hops, between source and destination thus generating more congestion. In prioritized sweeping reinforcement learning method, optimization is carried out over confidence based dual reinforcement routing on mobile ad hoc network and path is selected based on the actual traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis is done on 50 Nodes Mobile ad hoc networks with random mobility. Various performance parameters such as Interval and number of nodes are used for judging the network. Packet delivery ratio, dropping ratio and delay shows optimum results using the prioritized sweeping reinforcement learning method.
Impact of le arrivals and departures on bufferingenioustech
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/
An Enhanced DSR Protocol for Improving QoS in MANETKhushbooGupta145
Ad hoc network is a network without centralized administration in which different users can communicate and exchange information. In such a structure, all the nodes participate in order to achieve the network and ensure the travel of the information. Hence, multihopping techniques are used to achieve this task. The communication reliability within an ad hoc network and how the different nodes act are managed by routing protocols. Nowadays, different types of protocols exist. Nevertheless, the source routing ones, based on information known at the source of the communication, seem to attract more studies. Source routing protocols had shown interesting results in realistic scenarios in areas such as military battlefields or airport stations.
This Paper deals with DSR Protocol and is focused on the multipath aspect of this routing protocol. Since, it is necessary to understand that multipath techniques enhance reliability and can ensure security. We have simulated a new multipath algorithm. The solution had been evaluated with the network Simulator 2. Since we want to know how our protocol reacts in different mobility cases, the random waypoint model which allows us to present relevant results, due to the fact this situation is taken into account.
Simulation results show that the multipath protocol behaves better than DSR, the main actual reactive protocol. The Proposed protocol MSR performs well in high mobility by using much less overhead than DSR. Additionally, it is interesting to see that DSR without any modifications manage poorly in high mobility situation.
PERFORMANCE ANALYSIS AND COMPARISON OF IMPROVED DSR WITH DSR, AODV AND DSDV R...ijp2p
Mobile Ad-hoc networks are categorized by multi-hop wireless connectivity and numbers of nodes are connecting each other through wireless network. It includes several routing protocols specifically designed for ad-hoc routing. The most widely used ad hoc routing protocols are Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV), and Dynamic Source Routing (DSR). In this paper, we present an analysis of DSR protocol and propose our algorithm to improve the performance of DSR protocol by using small delay applied on last route ACK path when an original route fails in Mobile Ad Hoc networks. Past researchers the MANET have focused on simulation study by varying network parameters, such as network size, number of nodes. The simulation results shows that the M-DSR protocol
having some excellent performance Metrics then other protocols. We have taken different performance parameters over the comparison of Modified -DSR with other three protocols in mobility as well as Nonmobility scenario up to 300 nodes in MANETs using NS2 simulator. To achieve this goal DSR is modified by using modified algorithm technique in order to load balancing, to avoid congestion and lower packet
delivery.
Our area of interest for the paper is the improvement of performance of DSR routing protocol by
changing in algorithm and this Improved DSR protocol should compare with remaining protocols
taken in this research paper.
2. In this paper we made changesin traditional DSR protocol and generation of new improved DSR the
different performance parameters and compare with AODV/DSR/DSDV protocols in mobility and
non- mobility scenarios nodes up to 300.
3. We can plot the graphs throughput, End to end Delay, Packet delivery Ratio, Dropping Ratio, and
average energy consumption on Mobility and Non-Mobility scenario by using Network Simulator
version 2.34 for Modified DSR protocols. M-DSR, DSDV perform well when Mobility is low.
Performance analysis of routing protocols and tcp variants under http and ftp...IJCNCJournal
MANET stands for mobile ad-hoc network that has multi-hop and dynamic nature, where each station changes its location frequently and automatically configures itself. In this paper, four routing protocols
that areOLSR,GRP,DSR, and AODV are discussed along with three TCP variants that are SACK, New Reno and Reno. The main focus of this paper is to study the impact
scalability, mobility and traffic loads on routing protocols and TCP variants. Thepaper results shows that the proactive protocols OLSR and GRP outperform the reactive protocols AODV and DSR with the same nodes size, nodes speed, and traffic load. On the other hand, the TCP variants research reveal the superiority of the TCP SACK variant over the other two variants in case of adapting to varying network size, while the TCP Reno variant acts more
robustly in varying mobility speeds and traffic loads.
Delay Sensitive Packet Scheduling Algorithm for MANETs by Cross LayerAM Publications
The delay sensitive packet scheduling and routing algorithm to effectively deliver delay sensitive data’s over a multihop
networks. First packet urgency, node urgency, route urgency are calculated on the basis of end-to-end delay requirements.
Based on these urgency metrics, the proposed packet scheduling algorithm determines the transmission order of each packet to
minimize the node urgency without unnecessary packet drop, and the proposed routing algorithm establishes a route to minimize
the derivatives of route urgency in order to maximize the number of packets delivered within the required end-to-end delay.
Finally experimental results are presented to evaluate the performance of the proposed joint working algorithms.
Bandwidth aware on demand multipath routing in manetsijwmn
Mobile Ad-hoc Networks (MANETs) are self configuring, decentralized and dynamic nature wireless
networks which have no infrastructure. These offer a number of advantages, however the demand of high
traffic flows in MANETs increases rapidly. For these demands, limited bandwidth of wireless network is the
important parameter that restrains the development of real time multimedia applications. In this work, we
propose a solution to utilize available bandwidth of the channel for on demand multiple disjoint paths. The
approximate bandwidth of a node is used to find the available bandwidth of the path. The source chooses
the primary route for data forwarding on the basis of path bandwidth. The simulation results show that the
proposed solution reduces the frequency of broadcast and performs well in improving the end to end
throughput, packet delivery ratio, and the end to end delay.
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
PERFORMANCE COMPARISON OF LINK, NODE AND ZONE DISJOINT MULTI-PATH ROUTING STR...ijwmn
The high-level contribution of this paper is a simulation-based analysis to evaluate the tradeoffs between
lifetime and hop count of link-disjoint, node-disjoint and zone-disjoint multi-path routes vis-à-vis singlepath minimum hop routes for mobile ad hoc networks. The link-disjoint, node-disjoint and zone-disjoint
algorithms proposed in this paper can be used to arrive at benchmarks for the time between successive
multi-path route discoveries, the number of disjoint paths per multi-path set and the hop count per multipath set. We assume a multi-path set exists as long as at least one path in the set exists. Simulation results
indicate that the number of zone-disjoint paths per multi-path set can be at most 2, which is far lower
than the number of node and link-disjoint paths available per multi-path set. Also, the time between zonedisjoint multi-path discoveries would be far lower than the time between node and link-disjoint multi-path
route discoveries and can be at most 45% more than the time between single minimum-hop path route
discoveries. However, there is no appreciable difference in the average hop counts per zone-disjoint,
node-disjoint and link-disjoint multi-path sets and it can be only at most 15% more than the average
minimum hop count determined using single-path routing. We also observe that even though the number
of link-disjoint paths per multi-path set can be as large as 35-78% more than the number of node-disjoint
paths per multi-path set, the time between two successive link-disjoint multi-path discoveries can be at
most 15-25% more than the time between two successive node-disjoint multi-path discoveries, without
any significant difference in the hop count per multi-path set.
Performance Evaluation of Routing Protocols Ankush Mehta
This is a research project based on Performance checking of the Routing Protocols. This Presentation shows the basic knowledge of the Protocols use (AODV, DSDV and DSR) and in the end it shows the Result and Conclusion by comparing the graphs which are generated through out the work.
A Survey on Cross Layer Routing Protocol with Quality of ServiceIJSRD
Wireless is playing the wide role in today’s industrial application. Central idea of this paper is to enhance quality of service (QoS) for multimedia transmission over ad-hoc network. This paper describes the operational of different QoS routing protocols, their properties and various parameters advantages and disadvantages. Also describes the use of QoS in Cross layer routing protocol. Finally, it concludes by study of all these cross layer QoS routing protocols.
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.
GRID Signage: Future of Digitlal Signage
Convert any of your display into digital signage with android devices including android Mini PC, smarthphone, and tablet with easy to use cloud platfrom for Create-Deploy-Manage right in one spot
Challenges and Advances in Large-scale DFT Calculations on GPUs using TeraChemCan Ozdoruk
Recent advances in reformulating electronic structure algorithms for stream processors such as graphical processing units have made DFT calculations on systems comprising up to O(10 to the 3) atoms feasible. Simulations on such systems that previously required half a week on traditional processors can now be completed in only half an hour. Listen to Professor Heather Kulik, Massachusetts Institute of Technology, as she discusses how she leverages these GPU-accelerated quantum chemistry methods in the code TeraChem to investigate large-scale quantum mechanical features in applications ranging from protein structure to mechanochemical depolymerization. In each case, large-scale and rapid evaluation of electronic structure properties is critical for unearthing previously poorly understood properties and mechanistic features of these systems. Professor Kulik also discusses outstanding challenges in the use of Gaussian localized-basis-set codes on GPUs pertaining to limitations in basis set size and how she circumvents such challenges to computational efficiency with systematic, physics-based error corrections to basis set incompleteness
Performance analysis of routing protocols and tcp variants under http and ftp...IJCNCJournal
MANET stands for mobile ad-hoc network that has multi-hop and dynamic nature, where each station changes its location frequently and automatically configures itself. In this paper, four routing protocols
that areOLSR,GRP,DSR, and AODV are discussed along with three TCP variants that are SACK, New Reno and Reno. The main focus of this paper is to study the impact
scalability, mobility and traffic loads on routing protocols and TCP variants. Thepaper results shows that the proactive protocols OLSR and GRP outperform the reactive protocols AODV and DSR with the same nodes size, nodes speed, and traffic load. On the other hand, the TCP variants research reveal the superiority of the TCP SACK variant over the other two variants in case of adapting to varying network size, while the TCP Reno variant acts more
robustly in varying mobility speeds and traffic loads.
Delay Sensitive Packet Scheduling Algorithm for MANETs by Cross LayerAM Publications
The delay sensitive packet scheduling and routing algorithm to effectively deliver delay sensitive data’s over a multihop
networks. First packet urgency, node urgency, route urgency are calculated on the basis of end-to-end delay requirements.
Based on these urgency metrics, the proposed packet scheduling algorithm determines the transmission order of each packet to
minimize the node urgency without unnecessary packet drop, and the proposed routing algorithm establishes a route to minimize
the derivatives of route urgency in order to maximize the number of packets delivered within the required end-to-end delay.
Finally experimental results are presented to evaluate the performance of the proposed joint working algorithms.
Bandwidth aware on demand multipath routing in manetsijwmn
Mobile Ad-hoc Networks (MANETs) are self configuring, decentralized and dynamic nature wireless
networks which have no infrastructure. These offer a number of advantages, however the demand of high
traffic flows in MANETs increases rapidly. For these demands, limited bandwidth of wireless network is the
important parameter that restrains the development of real time multimedia applications. In this work, we
propose a solution to utilize available bandwidth of the channel for on demand multiple disjoint paths. The
approximate bandwidth of a node is used to find the available bandwidth of the path. The source chooses
the primary route for data forwarding on the basis of path bandwidth. The simulation results show that the
proposed solution reduces the frequency of broadcast and performs well in improving the end to end
throughput, packet delivery ratio, and the end to end delay.
Comparative Analysis of MANET Routing Protocols and Cluster Head Selection Te...IJERA Editor
Mobile Ad-hoc Network is a kind of wireless network. It is a backbone of new generation advanced communication technology. MANET is an ideal applicant for rescue and emergency situation due to its independence of connected devices of fixed wires. This paper represents a work on trust based system in MANET cluster that can be used to improve the performance of the network even in the existence of not trusted nodes. In the cluster architecture, cluster head and gateway nodes form a communication for routing among neighbouring clusters. But selection of cluster head is the important problem in dynamic Ad-hoc network because cluster head work as coordinator in clustered architecture. In this work, some values have used correspond to the threshold values of forward packet and dropped packet of each node within the network cluster. These values have been used dynamically updated every time and the node is selected as cluster head. In this technique of selecting the node as cluster head, the node which has maximum trusted value is elected as cluster head and this information is updated in every node’s trusted table. After implementation of our desired work, the proposed Dynamic Trust Evaluation of Cluster Head (DTE-CH) technique is analysed with traditional routing protocols and traditional clustering technique viz. Highest Degree Algorithm. The simulation is done by using network simulator software on the basis of different performance metrics throughput, packet delivery ratio, routing overhead, packet drop, average end to end delay and remain energy. Simulation result presents that proposed DTE-CH technique improves the performance of network as compare to most suitable existing AODV MANET protocol based technique as well as traditional highest degree clustering technique.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
PERFORMANCE COMPARISON OF LINK, NODE AND ZONE DISJOINT MULTI-PATH ROUTING STR...ijwmn
The high-level contribution of this paper is a simulation-based analysis to evaluate the tradeoffs between
lifetime and hop count of link-disjoint, node-disjoint and zone-disjoint multi-path routes vis-à-vis singlepath minimum hop routes for mobile ad hoc networks. The link-disjoint, node-disjoint and zone-disjoint
algorithms proposed in this paper can be used to arrive at benchmarks for the time between successive
multi-path route discoveries, the number of disjoint paths per multi-path set and the hop count per multipath set. We assume a multi-path set exists as long as at least one path in the set exists. Simulation results
indicate that the number of zone-disjoint paths per multi-path set can be at most 2, which is far lower
than the number of node and link-disjoint paths available per multi-path set. Also, the time between zonedisjoint multi-path discoveries would be far lower than the time between node and link-disjoint multi-path
route discoveries and can be at most 45% more than the time between single minimum-hop path route
discoveries. However, there is no appreciable difference in the average hop counts per zone-disjoint,
node-disjoint and link-disjoint multi-path sets and it can be only at most 15% more than the average
minimum hop count determined using single-path routing. We also observe that even though the number
of link-disjoint paths per multi-path set can be as large as 35-78% more than the number of node-disjoint
paths per multi-path set, the time between two successive link-disjoint multi-path discoveries can be at
most 15-25% more than the time between two successive node-disjoint multi-path discoveries, without
any significant difference in the hop count per multi-path set.
Performance Evaluation of Routing Protocols Ankush Mehta
This is a research project based on Performance checking of the Routing Protocols. This Presentation shows the basic knowledge of the Protocols use (AODV, DSDV and DSR) and in the end it shows the Result and Conclusion by comparing the graphs which are generated through out the work.
A Survey on Cross Layer Routing Protocol with Quality of ServiceIJSRD
Wireless is playing the wide role in today’s industrial application. Central idea of this paper is to enhance quality of service (QoS) for multimedia transmission over ad-hoc network. This paper describes the operational of different QoS routing protocols, their properties and various parameters advantages and disadvantages. Also describes the use of QoS in Cross layer routing protocol. Finally, it concludes by study of all these cross layer QoS routing protocols.
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.
GRID Signage: Future of Digitlal Signage
Convert any of your display into digital signage with android devices including android Mini PC, smarthphone, and tablet with easy to use cloud platfrom for Create-Deploy-Manage right in one spot
Challenges and Advances in Large-scale DFT Calculations on GPUs using TeraChemCan Ozdoruk
Recent advances in reformulating electronic structure algorithms for stream processors such as graphical processing units have made DFT calculations on systems comprising up to O(10 to the 3) atoms feasible. Simulations on such systems that previously required half a week on traditional processors can now be completed in only half an hour. Listen to Professor Heather Kulik, Massachusetts Institute of Technology, as she discusses how she leverages these GPU-accelerated quantum chemistry methods in the code TeraChem to investigate large-scale quantum mechanical features in applications ranging from protein structure to mechanochemical depolymerization. In each case, large-scale and rapid evaluation of electronic structure properties is critical for unearthing previously poorly understood properties and mechanistic features of these systems. Professor Kulik also discusses outstanding challenges in the use of Gaussian localized-basis-set codes on GPUs pertaining to limitations in basis set size and how she circumvents such challenges to computational efficiency with systematic, physics-based error corrections to basis set incompleteness
http://www.wellsource.com/home.html | By actively providing wellness activities and developing a culture of health at your organization, you are investing in the greatest asset in your company – the health and well-being of your staff. It will pay rich dividends in goodwill, increased productivity, and ultimately lower healthcare costs.
Valentine's Day The Biggest Consumer Holiday In AmericaBollyArts
Happy belated Valentine's Day from BollyArts. Valentine's Day is known as the day of love and affection. But did you know, apart from spreading love and affection, Valentine's Day is also one of the biggest consumer holidays in U.S? Find out, what makes Valentine's Day the biggest consumer holiday in U.S.
Govt Banned Rs. 500 and Rs 1000 Notes from November 2016Naveen Kumar.V
Govt banned currency notes of Rs. 500 and Rs. 1000 denominations and will not be legal tender beginning 09 November 2016 to eliminates the Black Money from the system.
Few Exceptions from the Government for use of Banned Notes for the first 72 hours from Nov 8 midnight.
Government hospitals
Pharmacies in government hospitals, will accept these notes with Doctor’s prescription
Railway ticket booking counters
Air travel booking counters
Petrol , Diesel and CNG stations authorized by public sector companies
Designated Milk booths
Crematoriums, and
Government co-operative stores.
International airports will make arrangements for arriving passengers to exchange up to Rs 5000 worth of old notes for the new legal tender.
For more information, Please visit http://blog.apnaloanbazaar.com
Distributed Spatial Modulation based Cooperative Diversity Schemeijwmn
: In this paper, a distributed spatial modulation based cooperative diversity scheme for relay
wireless networks is proposed. Where, the space-time block code is exploited to integrate with distributed
spatial modulation. Therefore, the interested transmission scheme achieves high diversity gain. By using
Monte-Carlo simulation based on computer, we showed that our proposed transmission scheme outperforms
state-of-the-art cooperative relaying schemes in terms bit error rate (BER) performance.
Manets: Increasing N-Messages Delivery Probability Using Two-Hop Relay with E...ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Determining the Optimum Number of Paths for Realization of Multi-path Routing...TELKOMNIKA JOURNAL
Multi-Protocol Label Switching for Traffic Engineering (MPLS-TE) technology is an intelligent and
advanced tool for handling traffic through the core networks and implementing new services based on
virtual transport. Since MPLS-TE combines channel and network layer mechanisms, network
administrators can optimally integrate and allocate the traffic loads while maintaining the speed of
technologies such as Asynchronous Transfer Mode (ATM) technology. In this paper, the problem of the
developed algorithm of multi-path routing which allows us to determine the optimum number of
independent shortest paths is theoretically solved. In details, the article proposes a way for finding the set
of shortest paths using Dijkstra's algorithm, and then determination of the maximum flow for each of the
shortest paths based on the mathematical concepts and finally, introducing the solution of the multi-criteria
optimization problem for a set of shortest paths. According to our approach, optimizing the use of
resources in the core networks is possible with using the MPLS-TE technology.
RTH-RSS Mac: Path loss exponent estimation with received signal strength loca...IOSR Journals
Abstract: Nowadays , Wireless Sensor Networks (WSNs) succed in domain of technology trends; new
require’sare continuously have more complex challenging, such as the real time location. The MAC layer
plays a crucial role in these networks; it controls the communication module and manages the medium sharing.
In this work, we integrate the received signal strength path-loss exponent estimation (RSS PLE) based on
location technique in Real Time Hybrid MAC (RTHMAC) protocol in goal to minimize the delay phase’s and
get more life time node’s. It combinesalso the advantages of both TDMA and FDMA in order to give a soft real
time communication for WSN.
Keywords: Duty cycle, RSS, PLE ,FDMA,TDMA, WSN ,Cluster
PRACTICAL PARTIAL DECODE AND FORWARD ENCODING SCHEME FOR RELAY CHANNELijwmn
In this paper, a source-destination pair, which is augmented by a half-duplex relay, is considered. Two
practical partial decode and forward encoding schemes are proposed. In these transmission schemes, the
relay may decode the source's signal either partially or completely. In each encoding technique, twophase transmission scheme is developed in which the relay can partially listen to the source in the first
phase until it can generate the source’s message and then, in the second phase, forward it to its destination.
By employing these transmission phases, the achievable rates are obtained . Rigorous numerical examples
are presented to i) show the value of power allocation between the source and the relay, and ii) optimize
the length of the listening phase.
PRACTICAL PARTIAL DECODE AND FORWARD ENCODING SCHEME FOR RELAY CHANNELijwmn
In this paper, a source-destination pair, which is augmented by a half-duplex relay, is considered. Two
practical partial decode and forward encoding schemes are proposed. In these transmission schemes, the
relay may decode the source's signal either partially or completely. In each encoding technique, twophase transmission scheme is developed in which the relay can partially listen to the source in the first
phase until it can generate the source’s message and then, in the second phase, forward it to its destination.
By employing these transmission phases, the achievable rates are obtained . Rigorous numerical examples
are presented to i) show the value of power allocation between the source and the relay, and ii) optimize
the length of the listening phase.
Fault tolerant wireless sensor mac protocol for efficient collision avoidancegraphhoc
In sensor networks communication by broadcast methods involves many hazards, especially collision. Several MAC layer protocols have been proposed to resolve the problem of collision namely ARBP, where the best achieved success rate is 90%. We hereby propose a MAC protocol which achieves a greater success rate (Success rate is defined as the percentage of delivered packets at the source reaching the destination successfully) by reducing the number of collisions, but by trading off the average propagation delay of transmission. Our proposed protocols are also shown to be more energy efficient in terms of energy dissipation per message delivery, compared to the currently existing protocol.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Synchronous optical networking (SONET) and synchronous digital hierarchy (SDH) are standardized protocols that transfer multiple digital bit streams synchronously over optical fiber using lasers or highly coherent light from light-emitting diodes (LEDs). At low transmission rates data can also be transferred via an electrical interface. The method was developed to replace the plesiochronous digital hierarchy (PDH) system for transporting large amounts of telephone calls and data traffic over the same fiber without synchronization problems.
ENHANCEMENT OF OPTIMIZED LINKED STATE ROUTING PROTOCOL FOR ENERGY CONSERVATIONcscpconf
Mobile Ad-hoc network (MANET) is infrastructure less network in which nodes are mobile, self
reconfigurable, battery powered. As nodes in MANET are battery powered, energy saving is an
important issue. We are using routing protocol to save energy so as to extend network lifetime.
We have extended original Optimized Linked State Routing (OLSR) protocol by using two
algorithms and named it as Enhancement in OLSR using Residual Energy approach (EOLSRRE)
and Enhancement in OLSR using Energy Consumption approach (EOLSR-EC). To analyze
relative performance of modified protocol EOLSR-RE and EOLSR-EC over OLSR, we
performed various trials using Qualnet simulator. The performance of these routing protocols is
analyzed in terms of energy consumption, control overheads, end to end delay, packet delivery
ratio. The modified OLSR protocol improves energy efficiency of network by reducing 20 %
energy consumption and 50% control overheads.
Clustering based Time Slot Assignment Protocol for Improving Performance in U...journal ijrtem
Recently, numerous approaches have been proposed for designing medium access control (MAC)
in underwater acoustic networks (UANs). Some of those works tried to adapt MAC protocols proposed for
terrestrial networks. However, unique environmental characteristics of UANs make the MAC protocols hard to be
used in the UANs and degrade network performance. In order to improve network performance, COD-TS MAC
protocol was proposed. COD-TS focuses on both single hop and multi-hop mode and utilizes CDMA for
exchanging schedule information between cluster heads. COD-TS has shortcomings such as collisions, additional
energy consumption by exchanging schedule information and near-far effect of CDMA. To overcome above
shortcomings, we propose a clustering-based time slot assignment protocol. In the proposed protocol, nodes are
clustered, and each cluster head performs two-hop neighbor cluster discovery operation. And then, a cluster head
obtains its own relative position information. Finally, the cluster head assigns its own time slot for data
transmission based on the information. Simulation results show that the proposed protocol has always better
performance compared to the COD-TS.
Clustering based Time Slot Assignment Protocol for Improving Performance in U...IJRTEMJOURNAL
Recently, numerous approaches have been proposed for designing medium access control (MAC)
in underwater acoustic networks (UANs). Some of those works tried to adapt MAC protocols proposed for
terrestrial networks. However, unique environmental characteristics of UANs make the MAC protocols hard to be
used in the UANs and degrade network performance. In order to improve network performance, COD-TS MAC
protocol was proposed. COD-TS focuses on both single hop and multi-hop mode and utilizes CDMA for
exchanging schedule information between cluster heads. COD-TS has shortcomings such as collisions, additional
energy consumption by exchanging schedule information and near-far effect of CDMA. To overcome above
shortcomings, we propose a clustering-based time slot assignment protocol. In the proposed protocol, nodes are
clustered, and each cluster head performs two-hop neighbor cluster discovery operation. And then, a cluster head
obtains its own relative position information. Finally, the cluster head assigns its own time slot for data
transmission based on the information. Simulation results show that the proposed protocol has always better
performance compared to the COD-TS.
LAN Technologies
Ethernet and IEEE Token Ring
IEEE Token Ring
Message transfer in OSI reference Model
Example of Message Transfer in the OSI Model
Application Layer Protocols.
An Energy-Efficient Dual Hop Cooperative Relay Model With Best Relay Selectioninventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
SCTP-MANET NEW EXTENSION OF SCTP PROTOCOL FOR THE OPTIMIZATION OF MANET PERFO...ijwmn
Ad Hoc mobile networks are constituted of nodes that move freely without a centralized administration.
These nodes contribute in the routing of data packets that are sent by a source. This happens when the
latter is not capable of reaching its destination. On the other hand, their mobility causes recurrent
breakdowns of the routing paths notably with sparse MANET. In order to optimize the performance of such
networks, we suggest a new extension of protocols: Stream Control Transmission Protocols (SCTP) named
SCTP-MANET. Their main function is therefore to improve the availability of the links in sparse MANET
protocols. This could be achieved by a better integration of Multihoming. With this aim in mind, this new
extension is based on a cross-layer interface between transport and routing layers as well as the use of
specific messages.
Similar to Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1(m) Traffic (20)
MobiManager helps you to manage, control, and secure company-owned Android devices. It allows you to distribute apps and contents across a wide range of mobile devices from the cloud.
MobiManager platform consists of overlapping defense and security mechanisms that protect against intrusion, malware, and more malicious threats.
Business benefit of Mobile device managementSyeful Islam
MobiManager - Cloud-based mobile device management solution which helps small and large businesses to
• Secure
• Monitor
• Manage
• Support mobile devices, deployed across organization for work purpose.
INfor- Mobile cloud Solution
Bring your essentials wherever your Mobile takes you. INforcloud puts your data at your fingertips, under your control. Store your documents, calendar, contacts and photos on a server at home, at one of our providers or in a data center you know.
A New Approach: Automatically Identify Proper Noun from Bengali Sentence for ...Syeful Islam
More than hundreds of millions of people of almost all levels of education and attitudes from different country communicate with
each other for different using various languages. Machine translation is highly demanding due to increasing the usage of web
based Communication. One of the major problem of Bengali translation is identified a naming word from a sentence, which is
relatively simple in English language, because such entities start with a capital letter. In Bangla we do not have concept of small
or capital letters and there is huge no. of different naming entity available in Bangla. Thus we find difficulties in understanding
whether a word is a proper noun or not. Here we have introduce a new approach to identify proper noun from a Bengali sentence
for UNL without storing huge no. of naming entity in word dictionary. The goal is to make possible Bangla sentence conversion
to UNL and vice versa with minimal storing word in dictionary.
A New Approach: Automatically Identify Naming Word from Bengali Sentence for ...Syeful Islam
More than hundreds of millions of people of almost all levels of education and attitudes from
different country communicate with each other for different using various languages. Machine
translation is highly demanding due to increasing the usage of web based Communication. One of
the major problem of Bengali translation is identified a naming word from a sentence, which is
relatively simple in English language, because such entities start with a capital letter. In Bangla we
do not have concept of small or capital letters and there is huge no. of different naming entity
available in Bangla. Thus we find difficulties in understanding whether a word is a naming word
(proper noun) or not. Here we have introduced a new approach to identify naming word from a
Bengali sentence for UNL without storing huge no. of naming entity in word dictionary. The goal is
to make possible Bangla sentence conversion to UNL and vice versa with minimal storing word in
dictionary.
Disordered Brain Modeling Using Artificial Network SOFMSyeful Islam
Autism is known as a neurobiological developmental disorder which affects language,
communication, and cognitive skill. In the case of autism attention shift impairment and
strong familiarity preference are considered to be prime deficiencies. Attention shift
impairment is one of the most seen behavioral disorders found in autistic patients. We
have model this behavior by employing self-organizing feature map (SOFM).
It covers:
- What is jQuery?
- Why jQuery?
- How include jQuery in your web page
- Creating and manipulating elements
- Events
- Animations and effects
- Talking to the server
- jQuery UI
- Writing plugins
- Breaking news around new releases
- Using the CDN
An Algorithm for Electronic Money Transaction Security (Three Layer Security)...Syeful Islam
In the era ofinternet, most ofthe people all over the world completed their transaction
on internet. Though the user of electronic transaction or E-money transaction system
increase rapidly but the majority person are concern about the security of this system.
The growth in online transactions has resulted in a greater demand for fast and accurate
user identification and authentication. Conventional method of identification based on
possession of ID cards or exclusive knowledge like a social security number or a
password are not all together reliable. Identification and authentication by individuals'
biometric characteristics is becoming an accepted procedure that is slowly replacing the
most popular identification procedure – passwords. Among all the biometrics, fingerprint
based identification is one of the most mature and proven technique. Along with the
combination of conventional system, biometric security, Global positioning system(GPS)
and mobile messaging we have design an algorithm which increase security ofelectronic
transaction and more reliable to user. A three layer security model to enhancing security
ofelectronic transaction is proposed in this paper.
A New Approach: Automatically Identify Naming Word from Bengali Sentence for ...Syeful Islam
More than hundreds of millions of people of almost all levels of education and attitudes from different country communicate with each other for different purposes using various languages. Machine translation is highly demanding due to increasing the usage of web based Communication. One of the major problem of Bengali translation is identified a naming word from a sentence, which is relatively simple in English language, because such entities start with a capital letter. In Bangla we do not have concept of small or capital letters and there is huge no. of different naming entity available in Bangla. Thus we find difficulties in understanding whether a word is a naming word or not. Here we have introduced a new approach to identify naming word from a Bengali sentence for machine translation system without storing huge no. of naming entity in word dictionary. The goal is to make possible Bangla sentence conversion with minimal storing word in dictionary.
Design Analysis Rules to Identify Proper Noun from Bengali Sentence for Univ...Syeful Islam
Abstract—Now-a-days hundreds of millions of people of
almost all levels of education and attitudes from different
country communicate with each other for different
purposes and perform their jobs on internet or other
communication medium using various languages. Not all
people know all language; therefore it is very difficult to
communicate or works on various languages. In this
situation the computer scientist introduce various inter
language translation program (Machine translation). UNL
is such kind of inter language translation program. One of
the major problem of UNL is identified a name from a
sentence, which is relatively simple in English language,
because such entities start with a capital letter. In Bangla
we do not have concept of small or capital letters. Thus
we find difficulties in understanding whether a word is a
proper noun or not. Here we have proposed analysis rules
to identify proper noun from a sentence and established
post converter which translate the name entity from
Bangla to UNL. The goal is to make possible Bangla
sentence conversion to UNL and vice versa. UNL system
prove that the theoretical analysis of our proposed system
able to identify proper noun from Bangla sentence and
produce relative Universal word for UNL.
This tutorial will help you to understand about Java OOP’S concepts with examples. Let’s discuss about what are the features of Object Oriented Programming. Writing object-oriented programs involves creating classes, creating objects from those classes, and creating applications, which are stand-alone executable programs that use those objects.
Emergency Notification:
It is an emergency case to notify some important person or other concern person when we fall in any problem such as accident or attacked by criminal or any other incidence. On other hands it also needs to track victim location to help him from incidence.
Already some concept grows about emergency notification some people try to give solution. But they can’t think the whole scenario or their solution is not realistic or they use this concept to resolve other purpose.
To resolve this problem here I proposed an interactive, user friendly and more efficient solution by smartphone. I have given an idea about emergency notification system in Samsung phone, which can solve this.
Here I want to mention some common incidence and how our phone helps us in that incident. In our regular life we can fall into various incidents such as
- Accident
- Attacked by snatcher, criminal or terrorist
- Suddenly fall into sick (Heart attack, stroke or others) etc.
In the case of accident if victim fatally injured or there is any situation that, victim can’t get enough time to call or notify someone or group of people to help him. This situation can happen if anyone fall in sudden sick and he/she want to call his/her relatives to help him. But they cannot capable to talk. If anyone attacked by snatcher, criminal or terrorist, then it is emergency to informed police or other concern person. But it is impossible to inform police by call.
To overcome this problem I proposed a system which can notify concern person automatically if user fall any incident. There is also need to track the location of victims because the location of victims can be changed and it is emergency to know the latest location where victim exist otherwise it is difficult to find out the victim and help him.
Business Value:.
- This is more realistic feature and more users friendly and efficient.
- I hope this also minimize our life risk or our tension when we are out of home or away from family members or there’s.
Development of analysis rules to identify proper noun from bengali sentence f...Syeful Islam
- Today the regional economies, societies, cultures and educations are integrated through a globe-spanning network of communication and trade.
- This globalization trend evokes for a homogeneous platform so that each member of the platform can apprehend what other intimates and perpetuates the discussion in a mellifluous way.
- However the barriers of languages throughout the world are continuously obviating the whole world from congregating into a single domain of sharing knowledge and information.
- Therefore researcher works on various languages and tries to give a platform where multi lingual people can communicate through their native language.
- Researcher analyze the language structure and form structural grammar and rules which used to translate one language to other.
- From the last few years several language-specific translation systems have been proposed.
- Since these systems are based on specific source and target languages, these have their own limitations.
- As a consequence United Nations University/Institute of Advanced Studies (UNU/IAS) were decided to develop an inter-language translation program .
- The corollary of their continuous research leads a common form of languages known as Universal Networking Language (UNL) and introduces UNL system.
- UNL system is an initiative to overcome the problem of language pairs in automated translation. UNL is an artificial language that is based on Interlingua approach.UNL acts as an intermediate form computer semantic language whereby any text written in a particular language is converted to text of any other forms of languages.
- UNL system consists of major three components:
- language resources
- software for processing language resources (parser) and
- supporting tools for maintaining and operating language processing software or developing language resources.
- The parser of UNL system take input sentence and start parsing based on rules and convert it into corresponding universal word from word dictionary.
- The challenge in detection of named is that such expressions are hard to analyze using UNL because they belong to the open class of expressions, i.e., there is an infinite variety and new expressions are constantly being invented.
- Bengali is the seventh popular language in the world, second in India and the national language of Bangladesh.
- So this is an important problem since search queries on UNL dictionary for proper nouns while all proper nouns(names) cannot be exhaustively maintained in the dictionary for automatic identification.
In this research project we do this task , Proper noun detection and conversion.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
How world-class product teams are winning in the AI era by CEO and Founder, P...
Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1(m) Traffic
1. Journal of Information Processing Systems, Vol.7, No.4, December 2011 http://dx.doi.org/10.3745/JIPS.2011.7.4.679
Performance Evaluation of Finite Queue Switching
Under Two-Dimensional M/G/1(m) Traffic
Md. Syeful Islam*, Md. Rezaur Rahman*, Anupam Roy*, Md. Imdadul Islam*
and M. R. Amin**
Abstract—In this paper we consider a local area network (LAN) of dual mode service
where one is a token bus and the other is a carrier sense multiple access with a collision
detection (CSMA/CD) bus. The objective of the paper is to find the overall cell/packet
dropping probability of a dual mode LAN for finite length queue M/G/1(m) traffic. Here, the
offered traffic of the LAN is taken to be the equivalent carried traffic of a one-millisecond
delay. The concept of a tabular solution for two-dimensional Poisson’s traffic of circuit
switching is adapted here to find the cell dropping probability of the dual mode packet
service. Although the work is done for the traffic of similar bandwidth, it can be extended
for the case of a dissimilar bandwidth of a circuit switched network.
Keywords—Carried Traffic, LST, Two-Dimensional Traffic, Cell Dropping Probability,
M/G/1 Model
1. INTRODUCTION
In many communication systems, two or more traffic links are usually merged together to
form a common trunk line or different types of traffic may share the bus or ring of a local area
network (LAN). If a communication network is in statistical equilibrium and serving two or
more different types of traffic, it can be modeled by the help of a multi-dimensional state transi-tion
diagram. The transmission of real time data, like audio or video, which needs a constant
arrival rate in sequential order to play the signal instantly at the receiving end requires circuit
switching. On the other hand, packet switching is more efficient for data, which can withstand
delays (such as e-mails, word files, etc.). For example, if any link experiences two types of Pois-son’s
offered traffic A1 and A2 , then a two-dimensional Markov chain is considered as the sim-plest
solution. The solution of the two-dimensional Markov chain (both similar and dissimilar
bandwidth traffic) can be obtained in tabular form [1-3] for a limited trunk case. A good exam-ple
of multidimensional traffic is the mobile cellular network, where two different arrivals, (i.e.,
new originating and handoff arrival traffic) are prevalent, as summarized in [4-6], where the
bandwidth of both the traffic is the same since both are voice signals. If there is a provision of
another offered traffic of a different bandwidth, say, if video/text/image data is added with the
Manuscript received May 26, 2011; first revision October 5, 2011; accepted October 27, 2011.
Corresponding Author: M. R. Amin
* Department of Computer Science and Engineering, Jahangirnagar University, Savar, Dhaka 1342, Bangladesh
679
(imdad@juniv.edu)
** Department of Electronics and Communications Engineering, East West University, 43 Mohakhali, Dhaka 1212,
Bangladesh (ramin@ewubd.edu)
Copyright ⓒ 2011 KIPS (ISSN 1976-913X)
2. Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1(m) Traffic
conventional mobile cellular system, then the system is known as a voice-data integrated net-work
680
[7-8].
For non-Markovian traffic, the situation is different. For example, in packet switching, the
information/message, regardless of content, type, or structure is converted into suitably-sized
blocks, called packets. The sequences of packets from different information sources can share
the common trunk and arrival of these packets (variable-bit-rate data streams) upon which a
switch /router is routed to the appropriate outgoing link. In case of an appropriate router
(because of huge traffic) being available, the packets are buffered or queued. After some instant
of time (variable amount of delay), the outgoing link becomes free and the packets are routed to
appropriate directions.
In this paper, we consider dual mode terminals of a LAN of BUS topology, where each ter-minal
can send packets using either a token bus or a carrier sense multiple access with collision
detection (CSMA/CD) protocol. We consider the packet traffic of a LAN that follows the M/G/1
model, where a packet may experience infinite delay since the size of the buffer is infinite. If a
similarly offered traffic is applied to a limited buffer system, for example the M/G/1(m) model,
some packets will be lost.
According to teletraffic theory, the probability of occupancy by a full buffer is the probability
of loss of packets. The probability of delay and cell/packet loss is prevalent but it is a cumber-some
task to determine the traffic parameters of a combined packet traffic stream [9, 10]. In this
paper, the probability states of M/G/1(m) before normalization are evaluated and the corres-ponding
analysis is presented in the next section. The triangular matrix of a two-dimensional
Markov chain is built for token bus and CSMA/CD traffic. Finally, the triangular matrix is nor-malized
and complete occupied states are selected. The sum of the complete occupied states
gives the packet loss probability. Sometimes it is necessary to determine the cell loss probability
of a finite buffer network, which is equivalent to a finite amount of delay of an infinite buffer
network. The model used here can solve the condition of the determination of the length of the
queue to keep the quality of service (QoS) equivalent to the delay of an infinite buffer case.
The paper is organized as follows: Section II deals with the theoretical analysis of determina-tion
of the mean delay of the Token BUS and the CSMA/CD traffic of the M/G/1 model. Sec-tion
III provides the theoretical analysis of determination for the probability states and for the
probability of cell loss rate of a finite buffer network. Section IV gives the results corresponding
to a combined traffic model along with an example, and finally, Section V concludes the entire
analysis.
2. THE PACKET TRAFFIC OF AN INFINITE BUFFER
2.1 Token Ring
In a token ring LAN, a special packet called a token (permission to access the ring) circulates
among a number of terminals in a ring configuration as shown in Fig. 1. Terminals get the op-portunity
to seize the token sequentially. Once the terminal gets the token, the terminal converts
it to a busy packet with a destination address. After receiving the packet, the destination node
sends the acknowledgment to the source node. Receiving the acknowledgment, the sending node
generates a new token to be used by another station.
Under the independent Poisson’s process, the mean message arrival rate at queue is assumed
3. Md. Syeful Islam, Md. Rezaur Rahman, Anupam Roy, Md. Imdadul Islam and M. R. Amin
Fig. 1. Token Ring LAN
to be: ... ... ... 3 2 1 N / , where i
(1 / )
, (1)
681
is the arrival rate of station i, and N is the
number of users. The switchover time is r1 r2 r3 ... ... ... R / N r , where ri is the
switchover time from queue i to i+1 and N
R i ri 1 . The mean waiting time (queuing delay) at
the sending station is:
[ ]
2(1 ) [ ]
2(1 )
2
[ ]
2 2
E S
Nr N E S
r
E W
N
i i
where 2 is the variance of the switchover time, 1 1
is the traffic intensity
under normalized condition, i iE[Si ] , E[Si ] is the mean service time of station i that
follows the general distribution, and E[S] is the mean service time (packet length in time unit)
expressed as E[S] E[Lp ] Lh / R / , where Lp and Lh are the mean packet length
and header length respectively.
For constant service time, we use E[S 2 ] E2[S] and for exponential service time,
E[S 2 ] 2E2[S] is used. The average propagation delay is E[Tp ] / 2 ; where is the
round trip propagation delay. The propagation time Tp is the time elapsed from the beginning
of the transmission of the message until the arrival of the first bit of the message at the destina-tion.
The mean transfer delay is: E[D] E[W] E[S] E[Tp ] . In Eq. (1), the negative (-) sign
in the numerator of the second term of the right-hand side is for the exhaustive service (the serv-er
serves a queue of work station transmitting all of the data, including the date received during
the transmission, until there is no message left in that queue) and the positive (+) sign for the
gated service. (The server does a similar job only for the data that was waiting before the trans-mission
began. In this type of service a gate is closed behind the waiting customer at the instant
the server in that queue. The customers in front of the gate are served.) The transmission/service
time S is the time elapsed between the arrival of the first bit of the message at the destination
and the arrival of the last bit.
4. Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1(m) Traffic
2.2 Token Bus
The operation for token bus protocol is similar to that of the token ring. Here, instead of a ring,
bus topology is used and the stations are ordered in such a way that they form a logical ring. The
typical ordering of stations on a bus (token bus) is shown in Fig. 2. Let the length of the bus be l
and corresponding end-to-end propagation delay be . Furthermore, let us consider that the
mean message arrival rate at the queue according to the independent Poisson’s process is: / N ,
as mentioned in the previous subsection. Similarly, the switchover time is: r R / N . For a to-ken
passing bus, we have r / 3 c , 2 2 /18 , the mean propagation delay
is E[Tp ] / 3 , where c (Lt Lb ) / R , Lt is the length of the token in bits and Lb is the
bit delay by each station.
If the mean transfer delay is D, including waiting time W (queuing delay) at the sending sta-tion,
if the service time of the message is S and if the propagation delay isTp , then the average
( / 3 ) 1 /
E D E S
(2)
2 2 2
E D E S e E S e e
[ ] [ ] (4 2) [ ] 5 4 (2 1)
E S e
2(1 [ [ ] 2 ])
2
e e e
1
3
(1 ) 2
682
of D can be written as:
.
3
[ ]
[ ]
2 1 [ ]
2 1
36( / 3 )
[ ]
2 2
E S
N c N E S
c
In Eq. (2), the minus (-) sign is for exhaustive service and the plus (+) sign is for the gated
service.
2.3 CSMA/CD Bus
In CSMA/CD, a node starts its transmission after sensing that there is no carrier in the bus,
therefore, the collision of packets from simultaneous users are reduced. If the node finds the bus
busy then it waits for a random amount of time and re-sensed the channel. If a node experiences
collision during transmission it stops the transmission and waits for a random amount of time for
retransmission.
Considering the M/G/1 queuing source, the mean delay will be:
2 [ ]
,
( ) 1
3
e E S
e F e e
(3)
Fig. 2. A Token Bus LAN
5. Md. Syeful Islam, Md. Rezaur Rahman, Anupam Roy, Md. Imdadul Islam and M. R. Amin
where F( ) is the Laplace transform of the message transmission time distribution f (t)
and can be expressed as:
dt e t f F t
0
( ) ( ) . (4)
For constant message lengths, it can be shown that F( ) e and E[S 2 ] E2[S] , where
E[S] and 1/e=0.368. For exponentially distributed message lengths, F( ) 1/(1 )
and E[S 2 ] 2E2[S] .
Entire analysis of the above network is done for the case of an infinite queue so the pack-et/
cell will experience only a delay but no cells will be lost. We will check the cell loss rate of
the above network for a finite queuing model.
3. CONNECTION ORIENTED PACKET SWITCHING OF M/G/1(M) TRAFFIC
Let j , h j ,Vj ,and y j be the call arrival rate, the mean call holding (connection) time, data
speed, and the data activity rate for class jJ respectively. The input traffic load a and the utili-zation
,
c
L
s i
a
k j j j p p
683
ρco of the transmission line are given by
a
h
(1 ) 1 ,
j J
j j j j
p
co
j J
j j
h V y
L c
B
(5)
where B is the call blocking probability, Lc is the cell length (53 bytes for ATM), Lp is the
payload length (48 bytes for an asynchronous transfer mode (ATM)), and c is the transmission
speed. From Erlang’s loss formula, the cell loss rate is given with the following expression:
B
a
s
i
i
s
0 !
/
!
, (6)
where s is the number of virtual channels (VCs) assigned to the transmission line. According
to [11] for M/G/1 system, we have the steady probability state:
*
1
1
1
*
0
*
k
j
k
; j = 0, 1, 2, … (7)
where pj is the probability that j calls arrive during the service time.
The mean cell delay of M/G/1 traffic is:
6. Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1(m) Traffic
W a
h C
a
, (8)
p p k p
j j j j k ; j = 0, 1, 2, …, m-1. (9)
C C p p C p
j j j j k k ; j = 0, 1, 2, …, m-1. (10)
1 1
* . (11)
C
m j
j
(12)
m j
1 C
c
1 ( 1)
co mC m k C
co k
B B mB
(1 )
2
W
684
1 2
(1
) 2
where a = λh, λ is the packet arrival rate, h is the service time, and the parameter C is defined
after Eq. ((10).
For the M/G/1(m) system, *j 0 for j ≥ m+1 and Eq. (7) takes the following recurrence
form:
1
0
*
1
1
*
0
* *
1
j
k
Taking *
C j * j / 0
, we get:
1
0
1
j
k
Let mj
C 0C j with C0 = 1 and by combining the above equations, we obtain:
aC
C
P j
j j j
1
The cell loss rate is:
.
1
1
1
1 1
0 0
C
aC
B P P
co
m
j
Form the Little formula, the mean cell delay Wco can be written as:
m
k
co
C
h
W
1
1
, (13)
. For a very small value of
where hc=Lc/c is the cell transmission time and p k e co / k !
k co
B or large value of m, the approximate formula ofWco can be derived to be:
c
co
co
co h
2(1
)
. (14)
Equation (14) gives the approximate expression for the mean cell delay and can be derived
using Little’s formula and taking the mean residual service time hc / 2 and the waiting probabil-
7. Md. Syeful Islam, Md. Rezaur Rahman, Anupam Roy, Md. Imdadul Islam and M. R. Amin
Traffic intensity (rho)
685
* B B B co
ity 1 * (1 ) .
1 0
mj
j To reduce the computational complexity, the
above approximate equation, Eq. (14), for the mean cell delay, can be used instead of using Eq.
(13) for a network of large buffer.
4. RESULTS
Fig. 3 shows the profile for carried traffic intensity (Erls/trunk) against the mean delay in
mille-second (ms) for both CSMA/CD BUS and Token BUS by taking the length of the payload
part of the packet as a parameter. For the length of the payload of a packet of 500 bits and a de-lay
of 1 ms, the carried traffic intensity of CSMA/CD BUS is 0.53 Erls/trunk and that of the
Token BUS is 0.66 Erls/trunk. The carried traffic for the two cases are decreased to 0.3 and 0.33
respectively when the length of the payload is increased to 800 bits.
Now our aim is to determine the cell loss rate of the finite queuing system for the offered traf-fic
intensity of 0.53 Erls/trunk of the CSMA/CD BUS and 0.66Erls/trunk for that of the Token
BUS. This cell loss rate will be equivalent to the delay of 1ms for an infinite queuing system.
Let us now consider the length of the queue of a router to be 7 and considering the arrival of two
types of M/G/1(7) traffic. Let the vector of probability states of CSMA/CD BUS be Q (for 0.53
Erls/trunk) and that of Token BUS be P (for 0.66 Erls/trunk). Applying the traffic model of
M/G/1(m) of Sec. III, we determine the probability states for Cj (before normalization) and put
them in the following vectors:
0.1 0.2 0.3 0.4 0.5 0.6
2.5
2
1.5
1
E[D] CSMA/CD BUS for Lp=800 bits
E[D] CSMA/CD BUS for Lp=500 bits
E[D] Token BUS for Lp=800 bits
E[D] Token BUS for Lp=500 bits
Mean Delay E[D] in ms
Fig. 3. Variation of mean delay against carried traffic
8. Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1(m) Traffic
P = [1.00000000 0.93400000 0.53100000
0.25500000 0.11700000 0.05300000
0.02300000 9.5600E-03]
and
Q= [1.00000000 0.69900000 0.28600000
0.09600000 0.03000000 8.8900E-03
2.2500E-03 1.6800E-04].
The above vectors, after normalization, become:
Pnorm [0.34216601 0.31958310 0.18169000
0.08725200 0.04003300 0.01813500
0.00787000 0.00327000]
and
Qnorm [0.47118500 0.32935900 0.13475900
0.04523400 0.01413600 0.00418800
0.00106000 7.9100E-05].
Now the vectors P and Q can be applied to a two-dimensional traffic model of the tabular
form of [12] as shown in Table 1(a) and (b) respectively.
From the above vectors and tables, we can easily determine the individual and combined sys-tem
blocking probability. For only CSMA/CD BUS traffic, the blocking probability (from nor-malization
vector P) is found to be B1 = 0.00327. Similarly, only for Token BUS traffic, the
blocking probability (from normalization vector Q) is found to be B2 = 7.906E-05.
Let us now determine the overall/combined cell blocking probability when both types of traf-fic
exist simultaneously on a BUS. The work can be done in the tabular form of a two-dimensional
traffic model of [13] as shown in Table 1. In Table 1(a) and Table 1(b), the proba-bility
states are determined before and after normalization. The sum of the complete occupied
states provides the overall cell blocking probability. Thus, the overall blocking probability is
found to be:
B0 =2.72E-05+ 3.41E-04+7.66E-04+1.24E-03+1.82E-03+2.46E-03+2.61E-03+1.55E-03
=1.08E-03,
which is seen to be greater than the sum of the individual blocking probabilities. This happens
because of the statistical distribution of the offered traffic.
686
9. Md. Syeful Islam, Md. Rezaur Rahman, Anupam Roy, Md. Imdadul Islam and M. R. Amin
Table 1. (a) Before Normalization, (b) After Normalization
(a)
5. CONCLUSION
The paper deals with the two-dimensional packet traffic of a M/G/1(m) case. Usually, the per-formance
of two-dimensional packet traffic for a general service-time distribution case is ana-lyzed
by incorporating the Markov modulated Poisson’s process (MMPP) model with M/G/1(m)
traffic. Our present analysis has the flexibility of enhancement for a multi-dimensional dissimi-lar
bandwidth case of packet traffic even for complete sharing or partitioning a call admission
scheme. It has been demonstrated that the packet dropping probability of the combined traffic is
687
Q7
1.68
E-04
1.68
E-04
Q6 2.25
E-03
2.25
E-03
2.10
E-03
Q5 8.89
E-03
8.89
E-03
8.30
E-03
4.72
E-03
Q4 0.03 3.00
E-02
2.80
E-02
1.59
E-02
7.65
E-03
Q3 0.096 9.60
E-02
8.97
E-02
5.10
E-02
2.45
E-02
1.12
E-02
Q2 0.286 2.86
E-01
2.67
E-01
1.52
E-01
7.293
E-02
3.35
E-02
1.52
E-02
Q1 0.699 6.99
E-01
6.53
E-01
3.71
E-01
1.78
E-01
8.18
E-02
3.71
E-02
1.61
E-02
Q0 1 1.00
E+00
9.34
E-01
5.31
E-01 0.255 0.117 0.053 0.023 9.56
E-03
1 0.934 0.531 0.255 0.117 0.053 0.023 9.56
E-03
P0 P1 P2 P3 P4 P5 P6 P7
(b)
Q7 1.68
E-04
2.72
E-05
Q6 2.25
E-03
3.65
E-04
3.41
E-04
Q5 8.89
E-03
1.44
E-03
1.35
E-03
7.66
E-04
Q4 0.03 4.87
E-03
4.54
E-03
2.58
E-03
1.24
E-03
Q3 0.096 1.56
E-02
1.45
E-02
8.27
E-03
3.97
E-03
1.82
E-03
Q2 0.286 4.64
E-02
4.33
E-02
2.46
E-02
1.18
E-02
5.43
E-03
2.46
E-03
Q1 0.699 1.13
E-01
1.06
E-01
6.02
E-02
2.89
E-02
1.33
E-02
6.01
E-03
2.61
E-03
Q0 1 1.62
E-01
1.51
E-01
8.61
E-02
4.14
E-02
1.90
E-02
8.60
E-03
3.73
E-03
1.55
E-03
1 0.934 0.531 0.255 0.117 0.053 0.023 9.56
E-03
P0 P1 P2 P3 P4 P5 P6 P7
10. Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1(m) Traffic
much larger than the individual service case and is even larger than the sum of the individual
service cases. This happens because of the statistical distribution of the occupancy of the states.
This work can be extended for the case of a dissimilar bandwidth or three-dimensional traffic or
even for star LAN. The work will be helpful for a network planar to select the capacity of the
link for a LAN to maintain the desired QoS in multi-dimensional traffic services.
REFERENCES
[1] D. Bear, Principle of Telecommunication Traffic Engineering, Second Edition, Peter
Peregrinus Ltd., Hertfordshire, U.K., 1988.
[2] Md. I. Islam, M. Q. Maula and L. J. Rozario, “Analysis of two dimensional limited source
and mixed traffic model for a BTS of a small mobile cellular network,” Proceedings of the
4th International Conference on Computers and Information Technology (ICCIT), Dhaka,
December 2001.
[3] P. Srisukpibul, “Traffic Measurement on a Cellular Mobile Network,” Masters Thesis,
Division of Telecommunications, AIT, Bangkok, Thailand, 1997.
[4] Paul Fitzpatrick, Cheng Siong Lee and Bob Warfiled, “Teletraffic Performance of Mobile
Radio Networks with Hierarchical Cells and Overflow,” IEEE J. Select. Areas Commun.,
Vol.15, No.8, 1997, pp.1549-57.
[5] Kwan L. Yeung and Sanjib Nanda, “Channel Management in Micro/Macro Cellular Radio
Systems,” IEEE Trans. Veh. Technol., Vol.45, No.4, 1996, pp.14-23.
[6] M. I. Islam and S. Hossain, “An analytical model of traffic performance of mobile cellular
network in underlay overlay cell system,” Proceedings of the 6th International Conference
on Computers and Information Technology (ICCIT), Dhaka, Bangladesh, Dec. 2003.
[7] M. Mahdavi, R.M. Edwards and S.R. Cvetkovic, “Polycy Enhancement of Traffic in
TDMA Hybrid Switched Integrated Integrated Voice/Data Cellular Mobile Communica-tions
Systems,” IEEE Commun. Lett., Vol.5, No.6, 2004, pp.242-244.
[8] Bin Li, Lizhong, Bo Li and Xi-Ren Cao, “Call admission control for voice/data integrated
cellular networks: performance analysis and comparative study,” IEEE J. Select. Areas
Commun., Vol.22, No.4, 2004, pp.706-718.
[9] W. Bux, “Performance issues in local area networks,” IBM Syst. Journal, Vol.23, No.4,
688
1984, pp.351-374.
[10] T. Supot and H. Akimaru, “A performance evaluation for heterogeneous bus CSMA/CD
LANs,” IEICE Trans. Commun., Vol.E74-B, No.9, 991, pp.2721-2727.
[11] Md. Imdadul Islam, Md. Shahriar Karim, J. K. Das and M. R. Amin, “Evaluation of Traf-fic
Parameters of Multidimensional Traffic of a Combined Link Using a Tabular
Method,” Proceedings of the 11th International Conference on Computers and Informa-tion
Technology (ICCIT), KUET, Bangladesh, December 2008.
[12] Haruo Akimaru, Marion R. Finley and Kyoko Yamori “A Practical Dimensioning Method
for ATM System,” IEEE Trans. Commun., Vol.47, No.2, 1999, pp.311-315.
[13] S. Hossain and Imdadul Islam, “Analysis of SDMA PCT-II Traffic for Duplicated First
Case: A Theoretical Study,” International Conference on Wireless Communications, Net-working
and Mobile Computing, Wuhan, China, September 2005.
11. Md. Syeful Islam, Md. Rezaur Rahman, Anupam Roy, Md. Imdadul Islam and M. R. Amin
Md. Syeful Islam recieved his B.Sc. degree in Computer Science and Engi-neering
from Jahangirnagar University in Dhaka, Bangladesh in 2011. Currently,
he is working as a software consultant in the Micro-Finance Solutions Depart-ment
of Southtech Limited in Uttara, Dhaka, Bangladesh.
Md. Rezaur Rahman received his B.Sc. degree in Computer Science and
Engineering from Jahangirnagar University in Dhaka, Bangladesh in 2011. He is
currently working as a Lecturer in the Department of Computer Science and
Engineering at the Daffodil Institute of Information Technology in Dhaka, Bangla-desh.
Anupam Roy received his B.Sc. in Computer Science and Engineering from
Jahangirnagar University in Savar, Dhaka, Bangladesh in 2007. He is now pur-suing
his M.Sc. in Engineering at the same department. He worked for a few
months as a General Software Developer at MFASIA LTD (A joint venture com-pany
between Bangladesh and England) and as a Java Programmer at ATI LTD
in Dhaka, Bangladesh. He is now working as a Programmer at BJIT LTD (A joint
venture company between Bangladesh and Japan) in Dhaka, Bangladesh.
Md. Imdadul Islam has received his B.Sc. and M.Sc. in Electrical and Elec-tronic
Engineering from the Bangladesh University of Engineering and Technolo-gy
in Dhaka, Bangladesh in 1993 and 1998 respectively and completed his Ph.D.
degree in 2010 at the Department of Computer Science and Engineering at Ja-hangirnagar
University in Dhaka, Bangladesh in the field of network traffic engi-neering.
He is now working as a Professor in the Department of Computer
Science and Engineering at Jahangirnagar University in Savar, Dhaka, Bangla-desh.
Previously, he worked as an Assistant Engineer at Sheba Telecom (Pvt.)
LTD (A joint venture company between Bangladesh and Malaysia, for mobile cellular and WLL) from
Sept. '94 to July '96. He has very good field experience in the installation of Radio Base Stations and
Switching Centers for WLL. His research fields are network traffic, wireless communications, wavelet
transform, OFDMA, WCDMA, adaptive filter theory, ANFIS, and array antenna systems. He has more
than a hundred research papers in national and international journals and conference proceedings.
689
12. Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1(m) Traffic
M. R. Amin received his B.Sc. and M.Sc. degrees in Physics from Jahangirna-gar
University in Dhaka, Bangladesh in 1984 and 1986 respectively and his Ph.D.
degree in Plasma Physics from the University of St. Andrews in the U. K. in 1990.
He is a Professor of Electronics and Communications Engineering at East West
University in Dhaka, Bangladesh. He served as a Post-Doctoral Research Asso-ciate
in Electrical Engineering at the University of Alberta, Canada, during 1991-
1993. He was an Alexander von Humboldt Research Fellow at the Max-Planck
Institute for Extraterrestrial Physics in Garching/Munich, Germany during 1997-
1999. Dr. Amin was awarded the Commonwealth Postdoctoral Fellowship in 1997. Besides these, he
has also received several awards for his research, including the Bangladesh Academy of Science
Young Scientist Award for the year 1996 and the University Grants Commission Young Scientist Award
for 1996. He is a member of the IEEE. His current field of research is wireless communications and
networks.
690