In wireless communication environments, backoff is traditionally based on the IEEE binary exponential backoff (BEB). Using BEB results in a high delay in message transmission, collisions, and ultimately wasting the limited available bandwidth. As each node has to obtain medium access before transmitting a message, in dense networks, the collision probability in the medium access control (MAC) layer becomes very high, when a poor backoff algorithm is used. The logarithmic algorithm proposes some improvements to the backoff algorithms that aim to efficiently use the channel and to reduce collisions. The algorithm under study is based on changing the incremental behavior of the backoff value.
The BEB is used by the local area networks (LANs) standards, IEEE 802.11, MAC. BEB uses a uniform random distribution to choose the backoff value; this often leads to reducing the effect of a window-sized increment. This paper carries out a deeper study and analysis of the logarithmic backoff algorithm that uses logarithmic increments, instead of an exponential extension of the window size to eliminate the degrading effect of random number distribution.
Results from simulation experiments reveal that the algorithm subject under study achieves higher throughput and less packet loss, when in a mobile ad hoc environment. Abstract = 'In wireless communication environments, backoff is traditionally based on the IEEE binary exponential backoff (BEB). Using BEB results in a high delay in message transmission, collisions, and ultimately wasting the limited available bandwidth.
As each node has to obtain medium access before transmitting a message, in dense networks, the collision probability in the medium access control (MAC) layer becomes very high, when a poor backoff algorithm is used. The logarithmic algorithm proposes some improvements to the backoff algorithms that aim to efficiently use the channel and to reduce collisions. The algorithm under study is based on changing the incremental behavior of the backoff value. The BEB is used by the local area networks (LANs) standards, IEEE 802.11, MAC. BEB uses a uniform random distribution to choose the backoff value; this often leads to reducing the effect of a window-sized increment. This paper carries out a deeper study and analysis of the logarithmic backoff algorithm that uses logarithmic increments, instead of an exponential extension of the window size to eliminate the degrading effect of random number distribution.
Results from simulation experiments reveal that the algorithm subject under study achieves higher throughput and less packet loss, when in a mobile ad hoc environment.' TY - JOUR T1 - On a Modified Backoff Algorithm for MAC Protocol in MANETs AU - Manaseer, Saher AU - Ould-Khaoua, Mohamed AU - Mackenzie, Lewis PY - 2009 Y1 - 2009 N2 - In wireless communication environments, backoff is traditionally based on the IEEE binary exponential backoff (BEB).
Using BEB results in a high delay in message transmission, collisions, and ultimately wasting the limited available bandwidth. As each node has to obtain medium access before transmitting a message, in dense networks, the collision probability in the medium access control (MAC) layer becomes very high, when a poor backoff algorithm is used. The logarithmic algorithm proposes some improvements to the backoff algorithms that aim to efficiently use the channel and to reduce collisions. The algorithm under study is based on changing the incremental behavior of the backoff value. The BEB is used by the local area networks (LANs) standards, IEEE 802.11, MAC. BEB uses a uniform random distribution to choose the backoff value; this often leads to reducing the effect of a window-sized increment.
This paper carries out a deeper study and analysis of the logarithmic backoff algorithm that uses logarithmic increments, instead of an exponential extension of the window size to eliminate the degrading effect of random number distribution. Results from simulation experiments reveal that the algorithm subject under study achieves higher throughput and less packet loss, when in a mobile ad hoc environment. AB - In wireless communication environments, backoff is traditionally based on the IEEE binary exponential backoff (BEB). Using BEB results in a high delay in message transmission, collisions, and ultimately wasting the limited available bandwidth.
As each node has to obtain medium access before transmitting a message, in dense networks, the collision probability in the medium access control (MAC) layer becomes very high, when a poor backoff algorithm is used. The logarithmic algorithm proposes some improvements to the backoff algorithms that aim to efficiently use the channel and to reduce collisions. The algorithm under study is based on changing the incremental behavior of the backoff value. The BEB is used by the local area networks (LANs) standards, IEEE 802.11, MAC.
BEB uses a uniform random distribution to choose the backoff value; this often leads to reducing the effect of a window-sized increment. This paper carries out a deeper study and analysis of the logarithmic backoff algorithm that uses logarithmic increments, instead of an exponential extension of the window size to eliminate the degrading effect of random number distribution. Results from simulation experiments reveal that the algorithm subject under study achieves higher throughput and less packet loss, when in a mobile ad hoc environment. KW - Ad Hoc Networks KW - Backoff Algorithm KW - IEEE 802.11 KW - Medium Access Control KW - Throughput UR - UR - U2 - 10.4018/jbdcn. DO - 10.4018/jbdcn. M3 - Article VL - 5 SP - 60 EP - 73 JO - International Journal of Business Data Communications and Networking T2 - International Journal of Business Data Communications and Networking JF - International Journal of Business Data Communications and Networking SN - 1548-0631 IS - 1 ER.
Abstract: The blending operation is a key process in alumina production. The real-time optimization (RTO) of finding an optimal raw material proportioning is crucially important for achieving the desired quality of the product. However, the presence of uncertainty is unavoidable in a real process, leading to much difficulty for making decision in real-time. This paper presents a novel robust real-time optimization (RRTO) method for alumina blending operation, where no prior knowledge of uncertainties is needed to be utilized. The robust solution obtained is applied to the real plant and the two-stage operation is repeated.
When compared with the previous intelligent optimization (IRTO) method, the proposed two-stage optimization method can better address the uncertainty nature of the real plant and the computational cost is much lower. From practical industrial experiments, the results obtained show that the proposed optimization method can guarantee that the desired quality of the product quality is achieved in the presence of uncertainty on the plant behavior and the qualities of the raw materials. This outcome suggests that the proposed two-stage optimization method is a practically significant approach for the control of alumina blending operation. Abstract: In this paper, we discuss the uncertain portfolio selection problem where the asset returns are represented by interval data. Since the parameters are interval values, the gain of returns is interval value as well. A new multiperiod mean semi-absolute deviation interval portfolio selection model with the transaction costs, borrowing constraints, threshold constraints and diversification degree of portfolio has been proposed, where the return and risk are characterized by the interval mean and interval semi-absolute deviation of return, respectively.
The diversification degree of portfolio is measured by the presented possibilistic entropy. Threshold constraints limit the amount of capital to be invested in each stock and prevent very small investments in any stock. Based on interval theories, the model is converted to a dynamic optimization problem. Because of the transaction costs, the model is a dynamic optimization problem with path dependence. The discrete approximate iteration method is designed to obtain the optimal portfolio strategy. Finally, the comparison analysis of differently desired number of assets and different preference coefficients are provided by numerical examples to illustrate the efficiency of the proposed approach and the designed algorithm. Abstract: This paper addresses weapon selection and planning problems (WSPPs), which can be considered as an amalgamation of project portfolio and project scheduling problems.
A multi-objective optimization model is proposed for WSPPs. The objectives include net present value (NPV) and effectiveness. To obtain the Pareto optimal set, a multi-objective evolutionary algorithm is presented for the problem. The basic procedure of NSGA-Ⅱ is employed. The problem-specific chromosome representation and decoding procedure, as well as genetic operators are redesigned for WSPPs. The dynamic nature of the planning environment is taken into account.
Dynamic changes are modeled as the occurrences of countermeasures of specific weapon types. An adaptation process is proposed to tackle dynamic changes.
Furthermore, we propose a flexibility measure to indicate a solution's ability to adapt in the presence of changes. The experimental results and analysis of a hypothetical case study are presented in this research. Abstract: In this paper, the valuation of an investment opportunity in a high-tech corporation using real option theory and modern capital budgeting is studied. Some key characteristics such as high-risk, multi-stage and technology life cycle of a high-tech project are considered in the proposed model.
Since a real option is usually not tradable in the market, an actuarial approach is adopted in our study. We employ an irreversible regime-switching Markov chain to model the multi-stage and technology life cycle of the project in the high-tech industry. The valuation of captured real option can be formulated as the valuation of an American option with time-dependent strike price. For the purpose of practical implementation, a novel lattice-based method is developed to value the American option. Numerical examples are given to illustrate the proposed models and methods.
Abstract: We consider a queueing system with two classes of customers, two heterogeneous servers, and discriminatory random order service (DROS) discipline. The two servers may have either the same or different DROS weights for each class. Customers of each class arrive according to a Poisson process and the service times of each class of customers are assumed to be exponentially distributed with service rate depending on both the customer's class and the servers. We provide stability and instability conditions for this two-class two-server queue with DROS discipline. Abstract: In order to reduce the average delay of secondary user (SU) packets and adapt to various levels of tolerance for transmission interruption, we propose a novel opportunistic channel access mechanism with admission threshold and probabilistic feedback in cognitive radio networks (CRNs).
Considering the preemptive priority of primary user (PU) packets, as well as the sensing errors of missed detection and false alarm caused by SUs, we establish a type of priority queueing model in which two classes of customers may interfere with each other. Based on this queueing model, we evaluate numerically the proposed mechanism and then present the system performance optimization. By employing a matrix-geometric solution, we derive the expressions for some important performance measures. Then, by building a reward function, we investigate the strategies for both the Nash equilibrium and the social optimization.
Finally, we provide a pricing policy for SU packets to coordinate these two strategies. With numerical experiments, we verify the effectiveness of the proposed opportunistic channel access mechanism and the rationality of the proposed pricing policy. Abstract: In this paper, we investigate a continuous-time mean-variance portfolio selection model with only risky assets and its optimal Sharpe ratio in a new way.
We obtain closed-form expressions for the efficient investment strategy, the efficient frontier and the optimal Sharpe ratio. Using these results, we further prove that (ⅰ) the efficient frontier with only risky assets is significantly different from the one with inclusion of a risk-free asset and (ⅱ) inclusion of a risk-free asset strictly enhances the optimal Sharpe ratio. Also, we offer an explicit expression for the enhancement of the optimal Sharpe ratio.
Finally, we test our theory results using an empirical analysis based on real data of Chinese equity market. Out-of-sample analyses shed light on advantages of our theoretical results established. Abstract: A special type of multi-variate polynomial of degree 4, called the double well potential function, is studied.
It is derived from a discrete approximation of the generalized Ginzburg-Landau functional, and we are interested in understanding its global minimum solution and all local non-global points. The main difficulty for the model is due to its non-convexity. In part Ⅰ of the paper, we first characterize the global minimum solution set, whereas the study for local non-global optimal solutions is left for Part Ⅱ. We show that, the dual of the Lagrange dual of the double well potential problem is a linearly constrained convex minimization problem, which, under a designated nonlinear transformation, can be equivalently mapped to a portion of the original double well potential function containing the global minimum. In other words, solving the global minimum of the double well potential function is essentially a convex minimization problem, despite of its non-convex nature. Numerical examples are provided to illustrate the important features of the problem and the mapping in between. Abstract: In contrast to taking the dual approach for finding a global minimum solution of a double well potential function, in Part Ⅱ of the paper, we characterize the local minimizer, local maximizer, and global minimizer directly from the primal side.
It is proven that, for a 'nonsingular' double well function, there exists at most one local, but non-global, minimizer and at most one local maximizer. Moreover, the local maximizer is 'surrounded' by local minimizers in the sense that the norm of the local maximizer is strictly less than that of any local minimizer.
We also establish necessary and sufficient optimality conditions for the global minimizer, local non-global minimizer and local maximizer by studying a convex secular function over specific intervals. These conditions lead to three algorithms for identifying different types of critical points of a given double well function. Abstract: This paper considers single server retrial queues with setup time where the server is aware of the existence of retrying customers. In the basic model, the server is switched off immediately when the system becomes empty in order to save energy consumption.
Arriving customers that see the server occupied join the orbit and repeat their attempt after some random time. The new feature of our models is that an arriving customer that sees the server off waits at the server and the server is turned on. The server needs some setup time to be active so as to serve the waiting customer. If the server completes a service and the orbit is not empty, it stays idle waiting for either a new or retrial customer. Under the assumption that the service time and the setup time are arbitrarily distributed, we obtain explicit expressions for the generating functions of the joint queue length. We also obtain recursive formulas for computing the moments of the queue length.
We then consider an extended model where the server has a closedown time before being turned off for which an explicit solution is also obtained. Abstract: Nowadays, customers are the decisive part in the market. The retailers who are closest to final consumers in a supply chain begin to show their power and thereby dominate the supply chain. Thus, the research about a retailer-led supply chain continues to be a burning question in the recent trade press and academic literature. Our research adds fresh fuel to the fire by studying how one channel member' fairness concern affects the coordination of a two-stage supply chain with a dominant retailer and a supplier. We carry out our investigation in two cases which involve different degrees of trust between the channel members about the unit cost $c$ provided by the supplier. Our analysis shows that if the channel members have the same degree of trust on $c$-value, the dominant retailer can use a constant markup pricing contract to align the fair-minded supplier's interest with the channel's and coordinate the channel with a wholesale price higher than the supplier's marginal cost; but the coordination fails if the dominant retailer is the only one who cares about fairness, and he obtains a lower profit than nobody cares about fairness.
If the dominant retailer and the supplier have different degrees of trust on $c$-value, the retailer can not coordinate the channel with a markup pricing contract when only the supplier has fairness concerns. Abstract: The paper introduces a class of vacation queues where the arrival and service processes are modulated by the same Markov process, hence they can be dependent. The main result of the paper is the probability generating function for the number of jobs in the system. The analysis follows a matrix-analytic approach. A step of the analysis requires the evaluation of the busy period of a quasi birth death process with arbitrary initial level.
This element can be useful in the analysis of other queueing models as well. We also discuss several special cases of the general model. We show that these special settings lead to simplification of the solution.
Abstract: Inspired by the inertial proximal algorithms for finding a zero of a maximal monotone operator, in this paper, we propose two inertial accelerated algorithms to solve the split feasibility problem. One is an inertial relaxed-CQ algorithm constructed by applying inertial technique to a relaxed-CQ algorithm, the other is a modified inertial relaxed-CQ algorithm which combines the KM method with the inertial relaxed-CQ algorithm. We prove their asymptotical convergence under some suitable conditions. Numerical results are reported to show the effectiveness of the proposed algorithms. Abstract: In this paper, we study the valuation of a single-name credit default swap and a $k$th-to-default basket swap under a correlated regime-switching hazard processes model.
We assume that the defaults of all the names are driven by a Markov chain describing the macro-economic conditions and some shock events modelled by a multivariate regime-switching shot noise process. Based on some expressions for the joint Laplace transform of the regime-switching shot noise processes, we give explicit formulas for the spread of a CDS contract and the $k$th-to-default basket swap. Abstract: This paper studies a newsvendor problem with random supply capacity, where the retailer (newsvendor) is loss-averse and the shortage cost is considered. When the retailer orders, the quantity actually received is the minimum between the order quantity and supply capacity, and his objective is to choose an order quantity to maximize the expected utility. It is shown that under different conditions, the loss-averse retailer may order larger than, equal to or less than the risk-neutral one, which is different from the existing result in the case without considering shortage cost. Further, if the shortage cost is less than a critical value, then the loss-averse retailer's optimal order quantity is always less than the risk-neutral retailer's. The numerical experiments are conducted to demonstrate our theoretical results.
Abstract: This study investigates a challenging problem of rescheduling a hybrid flow shop in the steelmaking-continuous casting (SCC) process, which is a major bottleneck in the production of iron and steel. In consideration of uncertain disturbance during SCC process, we develop a time-indexed formulation to model the SCC rescheduling problem. The performances of the rescheduling problem consider not only the efficiency measure, which includes the total weighted completion time and the total waiting time, but also the stability measure, which refers to the difference in the number of operations processed on different machines for the different stage in the original schedule and revised schedule. With these objectives, this study develops a Lagrangian heuristic algorithm to solve the SCC rescheduling problem. The algorithm could provide a realizable termination criterion without having information about the problem, such as the distance between the initial iterative point and the optimal point. This study relaxes machine capacity constraints to decompose the relaxed problem into charge-level subproblems that can be solved using a polynomial dynamic programming algorithm.
A heuristic based on the solution of the relaxed problem is presented for obtaining a feasible reschedule. An improved efficient subgradient algorithm is introduced for solving Lagrangian dual problems. Numerical results for different events and problem scales show that the proposed approach can generate high-quality reschedules within acceptable computational times. Abstract: In this paper, we consider a cognitive radio network with multiple Secondary Users (SUs).
The SU packets generated from the SUs are divided into SU1 packets and SU2 packets, and the SU1 packets have higher priority than the SU2 packets. Different from the conventional preemptive priority scheme (called Scheme Ⅰ), we propose a non-preemptive priority scheme for the SU1 packets (called Scheme Ⅱ) to guarantee the transmission continuity of the SU2 packets. By constructing a three-dimensional Markov chain, we give the transition probability matrix of the Markov chain, and obtain the steady-state distribution of the system model. Accordingly, we derive some performance measures, such as the channel utilization, the blocking probability of the SU1 packets, the interruption probability of the SU1 packets and the SU2 packets, the normalized throughput of the SU1 packets, and the average latency of the SU2 packets. Moreover, we provide numerical experiments to compare different performance measures between the two priority schemes. Finally, we show and compare the Nash equilibrium strategy and the socially optimal strategy for the SU2 packets between Scheme Ⅰ and Scheme Ⅱ. Abstract: In this paper, we consider a discrete time Geo/Geo/1 repairable queueing system with a pseudo-fault, setup time, $N$-policy and multiple working vacations.
We assume that the service interruption is caused by pseudo-fault or breakdown, and occurs only when the server is busy. If the pseudo-fault occurs, the server will enter into a vacation period instead of a busy period. At a breakdown instant, the repair period starts immediately and after repaired the server is assumed to be as good as new.
Using a quasi birth-and-death chain, we establish a two-dimensional Markov chain. We obtain the distribution of the steady-state queue length by using a matrix-geometric solution method. Moreover, we analyze the considered queueing system and provide several performance indices of the system in steady-state. According to the queueing system, we first investigate the individual and social optimal behaviors of the customer.
Then we propose a pricing policy to optimize the system socially, and study the Nash equilibrium and social optimization of the proposed strategy to determine the optimal expected parameters of the system. Finally, we present some numerical results to illustrate the effect of several parameters on the systems.
. Part of the book series (CCIS, volume 89) Abstract Data Link Layer is the most important Layer in any type of Local Area Network. The main functions of the Data Link Layer is access control and flow control. The efficient implementation of access control protocol, decides the optimal usage of network resources. The backoff algorithm is a very important aspect in access control protocol implementation. Backoff algorithm is used to reduce the probability of frequent collisions when stations try to access the medium simultaneously. The basic Binary Exponential Backoff algorithm, Modified Binary Exponential Backoff algorithm and their drawbacks are analyzed and a new variation called Probability Based Backoff algorithm is proposed, which takes network traffic also into consideration.
Cite this paper as: Rajagopalan N., Mala C. (2010) Analysis and Comparative Study of Different Backoff Algorithms with Probability Based Backoff Algorithm. In: Meghanathan N., Boumerdassi S., Chaki N., Nagamalai D. (eds) Recent Trends in Network Security and Applications. Communications in Computer and Information Science, vol 89.
Springer, Berlin, Heidelberg. DOI.
Publisher Name Springer, Berlin, Heidelberg. Print ISBN 978-3-642-14477-6. Online ISBN 978-3-642-14478-3. eBook Packages.
. Part of the book series (CCIS, volume 89) Abstract Data Link Layer is the most important Layer in any type of Local Area Network. The main functions of the Data Link Layer is access control and flow control. The efficient implementation of access control protocol, decides the optimal usage of network resources. The backoff algorithm is a very important aspect in access control protocol implementation. Backoff algorithm is used to reduce the probability of frequent collisions when stations try to access the medium simultaneously.
The basic Binary Exponential Backoff algorithm, Modified Binary Exponential Backoff algorithm and their drawbacks are analyzed and a new variation called Probability Based Backoff algorithm is proposed, which takes network traffic also into consideration. Cite this paper as: Rajagopalan N., Mala C. (2010) Analysis and Comparative Study of Different Backoff Algorithms with Probability Based Backoff Algorithm. In: Meghanathan N., Boumerdassi S., Chaki N., Nagamalai D.
Designed to make video editing quick and easy, VideoPad Video Editor for Mac. Free NCH Software Mac OS X 10.10/10.11/10.3/10.4/10.5/10.6/10.7/10.8/10.9,. The award-winning VideoPad video editing software has all the features you need to. Mac OS X 10.5 or above; iPhone/iPad version runs on iOS 6.0 or higher. NCH VideoPad Video Editor Pro Crack Full Version Download Software Apps, Mac. Apple has updated Logic Pro X — its Mac OS X software for professional. Nch software video pad crack for mac. Download cracked VideoPad Professional IPA file from the largest cracked App. Category: Video; By: NCH Software; Version: 6.03; Released: 2018-04-24. NCH VideoPad Universal Crack / Serial Number Code Free, Software, Video Editing. Official Windows 8.1 Activator Free For You Mac Download, Adobe.
(eds) Recent Trends in Network Security and Applications. Communications in Computer and Information Science, vol 89. Springer, Berlin, Heidelberg. DOI.
Publisher Name Springer, Berlin, Heidelberg. Print ISBN 978-3-642-14477-6.
Online ISBN 978-3-642-14478-3. eBook Packages.
Conference Publications (accepted/published). Elias Bou-Harb, Mourad Debbabi, Chadi Assi; A Statistical Approach for Fingerprinting Probing Activities; 8th International Conference on Availability, Reliability and Security (“ARES”) 2013 (BEST paper award). Elias Bou-Harb, Mourad Debbabi, Chadi Assi. On Detecting and Clustering Distributed Cyber Scanning, in the 9th IEEE International Wireless Communications and Mobile Computing Conference (IWCMC 2013). Mohammad Nurujjaman, Samir Sebbah, Chadi Assi: Planning and optimization of highly resilient multi-ring ERP-based mesh networks.: 203-209.
Assi, 'Regional Failure Survivability for Cloud Networking Services Using Post Fault Resoration' IEEE Systems of Systems (SoSE) 2013, Hawai, June,. Maurice Khabbaz, Hamed Alazemi, Chadi Assi, “Stochastic Data Delivery Delay Analysis In Intermittently Connected Vehicular Networks” IEEE Globecom 2012, Anaheim, CA, US. Mohammad Nurujjaman, Samier Sebbah, Chadi Assi, Improving Service Availability In ERP Based Mesh Networks IEEE Globecom 2012, Anaheim, CA, US. Elias Bou-Harb, Mourad Debbabi, Chadi Assi, “A First Look on the Effects and Mitigation of VoIP SPIT Flooding in 4G Mobile Networks” IEEE International Conference on Communications, ICC 2012, Ottawa, Canada. Faisal Uddin, Chadi Assi, Ali Ghrayeb, “Joint Optimal Relay Selection and Power Allocation in Multicast Cooperative Networks” IEEE International Conference on Communications, ICC 2012, Ottawa, Canada. Mohamad Kiaei, Kerim Fouli, Martin Maier, Martin Reisslin, Chadi Assi, “Delay Analysis for Ethernet Long-Reach Passive Optical Networks” IEEE International Conference on Communications, ICC 2012, Ottawa, Canada. Mohammad Nurujjaman, Samir Sebbah, Chadi Assi, Martin Maier “Optimal Capacity Planning and RPL Placement in Carrier Ethernet Mesh Network Design” IEEE International Conference on Communications, ICC 2012, Ottawa, Canada.
Maurice Khabbaz, Wissam Fawaz, Chadi Assi, “”Modeling and Analysis of Bulk Bundle Release Schemes in Two-Hop Vehicular DTNs” IEEE GLOBECOM 2011, Ad-hoc and Sensor Networking Symposium, Houston, 2011. Mohammad Nurujjaman, Mehdi Sherifi, Chadi Assi, Martin Maier, “Minimizing EEE overhead in Green Packet Optical Transport Networks (P-OTNs)” IEEE GLOBECOM 2011 - Optical Networks and Systems Symposium, Houston, 2011. Mohamad Kiaei, Samir Sebbah, Anton Cerny, Hamed Alazemi, Chadi Assi, “Survivable Network Design Models based on Pre-Cross-Connected Trails” ICCCN 2011, To appear, Hawai. Maurice Khabbaz, Wissam Fawaz, Chadi Assi, “A Probabilistic Bundle Relay Strategy In Two-Hop Vehicular Delay Tolerant Networks” ICC 2011 Wireless Networking Symposium, Japan, 2011. Mohamad Kiaei, Chadi Assi, Martin Maier, “Joint Scheduling and Bandwidth Allocation Methods for 10G-EPON and Beyond” ICC 2011 Next Generation Networking and Internet Symposium, Japan, 2011. Faisal Uddin, Hamed Alazemi, Chadi Assi, Optimal Flexible Spectrum Partitioning for Multihop Wireless Networks with Software Defined Radios, 13th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems – MSWIM, 2010, Turkey., Mohammad Nurujjaman, Chadi Assi: Joint Scheduling and Spectrum Allocation in Wireless Networks with Frequency-Agile Radios. ADHOC-NOW 2010, Alberta, Canada.
Mina Yazdanpanah, Chadi Assi, Yousef Shayan “Optimal Joint Routing and Scheduling in Wireless Mesh Networks with Smart Antennas” 2nd IEEE Workshop on Hot Topics in Mesh Networking, Montreal, Canada, 2010. Basel Alawieh, Chadi Assi, Hussein Mouftah, Hamed Alazemi, “An Effective Rate Adaptation Scheme for Multihop Wireless Networks” IEEE Symposium on Computers and Communications, ISCC 2010, Italy, 2010. Kaiei, Lehan Meng, Chadi Assi, Martin Maier, “'Efficient Joint Scheduling and Grant Sizing in Multichannel WDM PONs'” IEEE International Conference on Communications, ICC, Optical Networks and Systems Symposium, 2010. Mohammad Uddin, Chadi Assi, Hamed Alazemi “Joint Routing, Scheduling and Variable-Width Channel allocation for Multi-hop WMNs” IEEE International Conference on Communications, ICC, Ad-hoc, Sensor and Mesh Networking Symposium, 2010.
Mina Yazdanpanah, Chadi Assi, Yousef Shayan “Cross-layer Optimization for Wireless Mesh Networks with Multi-antenna Beam-forming” IEEE Wireless Communications and Networking Conference, 2010. Kiaei, M.S. Assi, C. “Improved availability models for p-cycle-based network design” Proceedings 7th International Workshop on Design of Reliable Communication Networks, 2009. Lehan Meng, Jad-El-Najjar, Hamed Al-Azemi, Chadi Assi “” Accepted to appear in the 21st International Teletraffic Congress, Sept., Paris, France, 2009 (This paper received a commemorative bursary award from the conference organizing committee). Saman Barghi, Abderrahim Benslimane, Chadi Assi, “A Lifetime-based Routing Protocol for Connecting VANETs to the Internet” The 10th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WOWMOM 2009, Greece.
Jad El-Najjar, Chadi Assi, Brigitte Jaumard, “Joint Routing and Scheduling in WiMAX-based mesh networks: A Column Generation Approach” The 10th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WOWMOM 2009, Greece. Lehan Meng, Chadi Assi, Martin Maier, and A. Dhaini, “ Resource Management in Stargate-based Ethernet Passive Optical Networks (SG-EPONs)” IEEE ICC 2009, June 14-18, Dresden, Germany, 2009. Basel Alawieh., Yongning Zhang., Chadi Assi, “A Novel Physical Carrier Sensing Scheme for enhancing Spatial Reuse in Multihop Wireless Networks ” The IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, IEEE WoWMoM 2008.
Basel Alawieh., Yongning Zhang., Chadi Assi, “A Distributed Power and Rate Control Scheme for MANET” Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, IEEE WiOPT 2008. Jad El-Najjar., Brigitte Jaumard, Chadi Assi, “ Maximum Network Lifetime in Interference-Aware WiMax/802.16 Mesh Centralized Scheduling” 17th International Conference on Computer Communications and Networks, ICCCN 2008. Jad El-Najjar., Brigitte Jaumard, Chadi Assi, “ Minimizing Interference in WiMax/802.16 based Mesh Networks with Centralized Scheduling” IEEE Globecom 2008, Wireless Network Symposium.
Jad El-Najjar., Brigitte Jaumard, Chadi Assi, “Efficient Routing in WiMAX/802.16 based Mesh Networks with Centralized Scheduling” IEEE Symposium on Computer and Communications, ISCC 2008. Khoder Shamy., Jad El-Najjar, Chadi Assi, “ Efficient Rate Adaptation with QoS Support for Wireless Networks” IEEE Globecom 2008, Ad Hoc, Sensor and Mesh Networking Symposium. Jad El-Najjar., Brigitte Jaumard, Chadi Assi, “Efficient Routing in WiMAX/802.16 based Mesh Networks with Centralized Scheduling” IEEE Symposium on Computer and Communications, ISCC 2008.
Basel Alawieh., Yongning Zhang, Chadi Assi, Hussein Mouftah “An Efficient Rate Adaptation Scheme for Multihop Wireless Networks Using Kalman Filter” IEEE Symposium on Computer and Communications, ISCC 2008. Amin Ranjbar., Chadi Assi, “Availability-Aware Design in FIPP p-cycles Protected Mesh Networks” 12th Conference on Optical Network Design and Modeling, ONDM 2008, IFIP, IEEE.
Khoder Shamy., Chadi Assi, Lei Guang. “A Study on Binary Exponential backoff in Noisy Heterogenous Environment” International Conference on Mobile and Sensor Networks IEEE MSN, 2007, Beijing, China. Basel Alawieh., Chadi Assi, Hussein Mouftah, “Invetigation of Power Aware IEEE 802.11” International Conference on Mobile and Sensor Networks IEEE MSN, 2007, Beijing, China.
Hadi Otrok., Mourad Debbabi, Chadi Assi, Prabir Bhattacharya, “ A Cooperative Approach for Analyzing Intrusions in Mobile Ad hoc Networks.” proceedings of the 27th International Conference on Distributed Computing Systems - Workshops (ICDCS Workshops 2007), Toronto, Canada, June 25 - 29, 2007, IEEE Press. Basel Alawieh., Chadi Assi, “Modeling and Analysis of Power-Aware Ad hoc Networks with Directional Antennas” IEEE ISCC 2007. Basel Alawieh., Chadi Assi, Wessam Ajib “A Hybrid Power Control Scheme for Mobile Ad hoc Networks using Kalman Filter” 21st International Conference on Advanced Information Networking and Applications, AINA 2007, IEEE. Shami, “Admission Control in Ethernet Passive Optical Networks (EPONs)” IEEE ICC 2007.
Abderrezak Rachedi, Abderrahim Benslimane, Lei Guang., Chadi Assi, “A Confident Community to Secure Mobile Ad-Hoc Networks” IEEE ICC 2007. Basel Alawieh., Chadi Assi, Wessam Ajib, “A Power Control Scheme for Directional MAC protocols in MANET” IEEE WCNC 2007. Kim-Khoa Nguyen., Hicham Mahkoum., Brigitte Jaumard, Chadi Assi, Mark Lanoue, “Towards a Distributed Control Plane Architecture for Next Generation Routers” IEEE EUROCOM 2007. Lei Guang., Chadi Assi, Abderahim Bensalimane, “Modeling and Analysis of Predictable Random Backoff in Selfish Environments” ACM/IEEE MSWiM 2006. Lei Guang., Chadi Assi, Abderahim Bensalimane, “Interlayer Attacks in Mobile Ad Hoc Networks” IEEE MSN, Hong Kong, 2006. Xiaofeng Bai, Abdallah Shami, Khalim Amjad Meerja, Chadi Assi, “New Distributed QoS Control Scheme for IEEE 802.16 Wireless Access Networks” IEEE Globecom 2006, San Francisco.
Mona Mehrandish., Hadi Otrok., Mourad Debbabi, Chadi Assi, Prabir Bhattacharya, “A Game Theoretic Approach to Detect Network Intrusions: The Cooperative Intruders Scenario” IEEE Globecom 2006, San Francisco. Yi Liu., Chadi Assi, Anjali Agarwal, “Enhanced Per-Flow Admission Control and QoS Provisioning in IEEE 802.11e Wireless LANs” IEEE Globecom 2006, San Francisco. Yi Liu., Shamsher Singh Pawar., Chadi Assi, and Anjali Agarwal, “Dynamic Admission and Congestion Control for Real Time Traffic in IEEE 802.11e Wireless LANs” IEEE WiMob'06 Montreal, Canada, 2006. Lei Guang., Chadi Assi, “Mitigating Smart Selfish MAC Layer Misbehavior in Ad Hoc Networks” IEEE WiMob'06 Montreal, Canada, 2006 (As of August 2012, this paper has been cited 24 times). Hassan Issa., Chadi Assi, Mourad Debbabi, “QoS-Aware Middleware for Web Services Composition - A Qualitative Approach” IEEE International Symposium on Computer and Communications, ISCC 2006, Italy. Ahmad Dhaini., Chadi Assi, Abdallah Shami, “ Quality of Service in TDM/WDM Ethernet Passive Optical Networks (EPONs)” IEEE International Symposium on Computer and Communications, ISCC 2006, Italy.
Haque., Chadi Assi, “OLEAR: Optimal Localized Energy Aware Routing in Mobile Ad Hoc Networks” IEEE International Conference on Communication, Turkey, 2006. Wei Huo., Chadi Assi, Abdallah Shami, “Multiple-Link Failures Survivability in Optical Networks with Traffic Grooming Capability” IEEE International Conference on Communication, Turkey, 2006.
Lei Guang., Chadi Assi, “A Self-Adaptive Detection Approach for MAC Misbehavior in Ad Hoc Networks” IEEE International Conference on Communication, Turkey, 2006. Dev Shankar Mukherjee., Chadi Assi, Anjali Agarwal, “Alternate Strategies for dual failure restoration using p-cycle” IEEE International Conference on Communication, Turkey, 2006. Mona Mehrandish., Chadi Assi, Mourad Debbabi, “A Game Theoretic Model to Handle Network Intrusions over Multiple Packets” IEEE International Conference on Communication, Turkey, 2006. Ahmad Dhaini., Chadi Assi, Abdallah Shami, “Adaptive Fairness through intra-ONU Scheduling for Ethernet Passive Optical Networks” IEEE International Conference on Communication, Turkey, 2006.
Atthuru, S.K. Assi, “Multi-Tiered Service Survivability in Next-Generation SONET/SDH Networks” IEEE International Conference on Communication, Turkey, 2006. ASM Delowar Hossain, A.
Assi, M.Ali, “Supporting Private Networking Capability in EPON”, IEEE International Conference on Communication, Turkey, 2006. Lei Guang., Chadi Assi “Cross-Layer Cooperation to Handle MAC Misbehavior in Ad Hoc Networks”, Proceedings of 19th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE’06), 2006, Ottawa, ON, Canada, May, 2006. Ahmad Dhaini., Chadi Assi, Abdallah Shami, “Dynamic Bandwidth Allocation Schemes in Hybrid TDM/WDM Passive Optical Networks” IEEE Consumer Communications and Networking Conference (CCNC 2006), 8-10 January 2006, Las Vegas, NV, USA. Dorsinville, M. Assi, “Protection for a ring-based EPON architecture” Broadband Networks, IEEE 2nd International Conference on Broadband Networks, 2005. Atwood “Randomized Energy Aware Routing Algorithms in Mobile Ad Hoc Networks” The 8-th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM, October 10-13, 2005, Montreal, QC. Lei Guang., Chadi Assi, “On the Resiliency of Mobile Ad Hoc Networks to MAC Layer Misbehavior” The 2nd ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN 2005), October 10-13, 2005, Montreal, Qc.
Academic Conferences: Analytical Study Of Backoff Algorithms For Mac Mac
Shami, and C. Assi, “Statistical Bandwidth Multiplexing in Ethernet Passive Optical Networks,” Proceedings of IEEE GLOBECOM 2005, Nov. Louis, Missouri, USA.
Lei Guang., Chadi Assi, “Impact of MAC Misbehavior on Routing Performance in Ad Hoc Routing”, WiMob'05 Montreal, Canada, August 2005. Chadi Assi, W. Shami, “Impact of Resource Sharability on Dual Failure Restorability in Optical Mesh Networks”, IFIP Networking Conference (NETWORKING 2005), May 2005, Waterloo, Ontario, Canada. Lei Guang., Chadi Assi, “MAC Misbehavior in the Ad Hoc Network”, 18th Annual Canadian Conference on Electrical and Computer Engineering IEEE CCECE05, Saskatchewan, Canada May 1-4, 2005. Wei Huo., Lei Guang., Chadi Assi, Abdallah Shami, “Survivable Traffic Grooming in Optical Networks with Multiple Failures” 18th Annual Canadian Conference on Electrical and Computer Engineering, IEEE CCECE05, Saskatchewan, Canada May 1-4, 2005. Xiaofeng Bai, Abdallah Shami, Nasir Ghani and Chadi Assi, “A Hybrid Granting Algorithm for QoS Support in Ethernet Passive Optical Networks” IEEE International Conference on Communications (ICC), Seoul, Korea, May 2005. (Selected in the top best 5 papers).
Chadi Assi, Wei Huo., Abdallah Shami, and Nasir Ghani “On The Benefits of Lightpath Re-Provisioning in Optical Mesh Networks” IEEE International Conference on Communications (ICC), Seoul, Korea, May 2005. Chadi Assi, Wei Huo. and Abdallah Shami “Centralized vs. Distributed Re-provisioning in Optical Mesh Networks”, 4th International Conference on Networking (ICN 2005), April 2005, Reunion Island.
Debbabi, and C. Improving the Security of SNMP in Wireless Networks. In Proceedings of the IEEE Conference on Wireless Networks, Communications, and Mobile Computing, Wirelesscom'2005, Pages 1-5, Maui, Hawaii, USA, June 2005, IEEE Press. Debbabi and M. Vulnerability Assessment of Civil Infrastructure Systems: A Network Approach. In Proceedings of the first CSCE Specialty Conference on Infrastructure Technologies, Management and Policy, Pages 1-8, Toronto, Ontario, Canada, June 2005 (Received an Award of Excellence).
Boukhtouta, F. Guerroumi, C. A new Paradigm for Information Systems Integration. In Proceedings of Montreal Conference on e-Technologies, MCETECH'05, Pages 63-72, Montreal, Quebec, Canada, January 2005.
Ghani “Quality of Service in Two-Stage Ethernet Passive Optical Access Networks” 13th International Conference on Computer, Communications and Networks, IEEE, October 11-13, 2004 Chicago, IL USA. Wei Huo., Chadi Assi, and Abdallah Shami “ A New Framework for Rapid Restoration in Optical Mesh Networks” IWNDA 2004, Montreal, Canada, August 2004. Ghani “A New Dynamic Bandwidth Allocation Scheme in Ethernet Passive Optical Access Networks” IWNDA 2004, Montreal, Canada, August 2004. Hadjiantonis, G. Ellinas, and M. Ali, “ On Dynamic Multicast Traffic Grooming In WDM Networks”, IEEE Symposium on Computers and Communications, ISCC'2004, June 29-July 1st, Egypt, 2004. Shami, and M.
Ali, “Integrated Traffic Grooming in Converged Data-Optical Networks” ”, IEEE Symposium on Computers and Communications, ISCC'2004, June 29-July 1st, Egypt, 2004. Hadjiantonis, G. Ellinas, and M. Ali, “ Multicast Traffic Grooming in WDM Networks” IEEE CCECE 2004, May 2-5 2004. Shami “Inverse Multiplexing in Multi-Layer Optical Grooming Networks”, IEEE SARNOFF, April 26- 27, 2004, Princeton, NJ.
Raja, “ Quality of Service in Ethernet Passive Optical Networks,” IEEE SARNOFF, April 26- 27, 2004, Princeton, NJ. Chadi Assi, Y. Dixit, “ Support of QoS in IP-based Ethernet-PON Networks” IEEE GLOBECOM, San Francisco, December 2003. Chadi Assi, A. Ghani, and M. Ali, “ Efficient Shared Path Protection in Mesh WDM Networks”, IEEE Symposium on Computers and Communications, ISCC'2003, Turkey.
Chadi Assi, Y. Ali, “ Performance Evaluation of Efficient Path Selection and Fast Restoration Algorithms for Shared Restorable Mesh WDM Networks” Proc. Of IEEE ICC 2003, Anchorage, Alaska.
Chadi Assi, Y. Ali, “A Hybrid Distributed Fault-Management Protocol for Combating Single-Fiber Failures in Mesh-based DWDM Optical Networks” IEEE GLOBECOM 2002, Taipei, Taiwan. Ali, “ Analytical Modeling of Blocking Probabilities in WDM-Based Optical Networks with Fixed Alternate Routing and Trunk Reservation”, International Conference on Communications and Computer Networks, Cambridge, MIT, Nov. Ali, “ Performance Evaluation of Two GMPLS-Based Distributed Control and Management Protocols for Dynamic Lightpath Provisioning in Future IP Networks” Proc.
Of IEEE, ICC’02. Chadi Assi, Yinghua Ye, Abdallah Shami, and M. Ali, “ On the Merit of IP/MPLS Protection/Restoration in IP over WDM networks”, IEEE GLOBECOM 2001, San Antonio, Texas. Abdallah Shami, Yinghua Ye, Chadi Assi and M. Ali “A Novel Distributed Connection Management Scheme for Wavelength-Routed Optical Networks” IEEE GLOBECOM 2001, San Antonio, Texas.
Yinghua Ye, Chadi Assi, Sudhir Dixit, and M. Ali, “ The Impact of Shared Protection Mechanisms in IP over WDM Networks” Proceedings, SPIE APOC2001, China.
Zhang, Chadi Assi, Abdallah Shami, and X. Liu “Impact of wavelength converters on the performance of optical networks” Proceedings, SPIE APOC2001, China. Ali “ Multi-Path Based Distributed Routing Algorithm for WDM Routed Networks,” Proc. IEEE/LEOS ECOC, September 2001, Amsterdam, Holland. Chadi Assi, Yinghua Ye, Abdallah Shami, and M.
Ali “Designing a Survivable IP over WDM networks” Proceedings, SPIE OPTICOMM 2001, Denver, Colorado. Abdallah Shami, Yinghua Ye, Chadi Assi and M.
Ali “A Novel Distributed Connection Management Scheme for Wavelength-Routed Optical Networks” Proceedings, SPIE OPTICOMM 2001, Denver, Colorado. Abdallah Shami, Chadi Assi, Mohamed A. Ali: Dynamic Wavelength Provisioning in DWDM-Based Optical Network. ONDM 2001: 357-370.
Comments are closed.
|
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |