Search Results - bandwidth ((((normalization algorithm) OR (optimisation algorithm))) OR (optimization algorithm))

Development of a scalable video compression algorithm by Khalifa, Othman Omran, Issa, Sinzobakwira, Olanweraju, Rashidah Funke, Al Khazmi, El Mahdi A

“…The result shows that the managed complexity algorithm based on Lagrangian Multiplier function outperforms the normal encoder. …”
Get full text
Get full text
Get full text

QTCP: an optimized and improved congestion control algorithm of high-speed TCP networks by Qureshi, Barkatullah, Othman, Mohamed, K. Subramaniam, Shamala, Abdul Hamid, Nor Asilah Wati

“…To overcome these problems Quick Transport Control Protocol (QTCP) algorithm based on optimizations of HS-TCP slow start algorithm and Additive Increase and Multiplicative Decrease (AIMD) algorithm have been proposed. …”
Get full text
Get full text

Optimizing lossless compression by normalized data length in Huffman Algorithm by Tonny, Hidayat

“…It was found that the 4-ary/MQ compression benefits the compressed data that is stored in local storage media as well as for hosting and optimizing bandwidth. The new algorithm also has a good performance in producing optimal CR with fast CT in most of the 16-bit WAV audio datasets. …”
Get full text
Get full text
Get full text
Get full text

Tasks Distribution In Driver Scheduling Using Dynamic Set Of Bandwidth In Harmony Search Algorithm With 2-Opt by Shaffiei, Zatul Alwani

“…The existing techniques (HS and its variants) have issues in terms of searching strategy (exploration and exploitation), slow convergence rate and high computation time for solving the scheduling problems maximally or near to optimal one. Therefore, a tasks distribution in driver scheduling using dynamic set of bandwidth in harmony search algorithm with 2-opt (SBHS2-opt) was proposed in this research. …”
Get full text
Get full text
Get full text
Get full text

Application of optimized higher order sliding mode control on MEMS optical switch by Keramati, Ehsan, Teimoortashloo, Mazdak, Mohd Noor, Samsul Bahari

“…The algorithm requires time derivatives of the sliding variable. …”
Get full text
Get full text

Enhancing Harmony Search Parameters Based On Step And Linear Function For Bus Driver Scheduling And Rostering Problems by Mansor, Nur Farraliza

“…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
Get full text
Get full text
Get full text
Get full text

Optimal solution to the fractional knapsack problem for LTE overload-state scheduling by Ferdosian, Nasim, Othman, Mohamed, Kweh, Yeah Lun, Mohd Ali, Borhanuddin

“…System performance has been evaluated in terms of loss, delay and throughput in comparison with reference algorithms.…”
Get full text
Get full text
Get full text

Adaptive policing and shaping algorithms on inbound traffic using generalized Pareto distribution / Nor Azura Ayop by Ayop, Nor Azura

“…Log likelihood estimation technique is used to fit the best 2-parameter CDF compared to Weibull, Normal and Rician distribution model. The percentage level 5% under original bandwidth used is developed on policing and shaping algorithms to control bandwidth used. …”
Get full text
Get full text

Fair bandwidth assignment in hierarchical scheduling for mobile WiMAX system by Alsahag, Ali Mohammed Mansoor, Mohd Ali, Borhanuddin, Noordin, Nor Kamariah, Mohamad, Hafizal

“…Simulations result showed that the proposed algorithm optimize the overall system throughput and assigns bandwidth effectively to the different service classes while ensuring that the QoS requirements are satisfied.…”
Get full text
Get full text

Fair bandwidth distribution marking and scheduling algorithm in network traffic classification by Al-Kharasani, Ameen Mohammed Abdulkarem

“…Second, an Optimized time sliding window packet marker (OTSWTCM) algorithm. …”
Get full text
Get full text

A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

“…This thesis describes a new algorithm called “COPPA,” which is an in-band path probing algorithm for measuring the end-to-end available bandwidth of an overlay path accurately and continuously. …”
Get full text
Get full text

Peak time bandwidth control algorithms with fitted traffic model on broadband network YouTube video traffic: article / Aini Azmi by Azmi, Aini

“…Bandwidth Control Algorithms is developed based on Peak Time of day and night. …”
Get full text
Get full text

Peak time bandwidth control algorithms with fitted traffic model on broadband network YouTube video traffic / Aini Azmi by Azmi, Aini

“…Bandwidth Control Algorithms is developed based on Peak Time of day and night. …”
Get full text
Get full text

Adaptive policing and shaping algorithms on inbound traffic using generalized Pareto distribution: article / Nor Azura Ayop by Ayop, Nor Azura

“…Log likelihood estimation technique is used to fitted the best 2-parameter CDF compared to WeibuII, Normal and Rician distribution model. The percentage level 5% under original bandwidth used is developed on policing and shaping algorithms to control bandwidth used. …”
Get full text
Get full text

An optimized aggregate marker algorithm for bandwidth fairness improvement in classifying traffic networks by Al-Kharasani, Ameen Mohammed Abdulkarem, Othman, Mohamed, Abdullah, Azizol, Kweh, Yeah Lun

“…This article analyses and evaluates a new time sliding window traffic marker algorithm called the Optimized time sliding window Three Colour Marker (OtswTCM). …”
Get full text
Get full text
Get full text

Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network by Al-Kharasani, Nori Mohammed Abdulkarem

“…The proposed Quality of Path QoP metric is incorporated into the modified relay selection algorithm, which improves the efficiency of relay selection mechanism to find optimal path with high link quality. …”
Get full text
Get full text

Global priority DBA using fuzzy logic in Ethernet PON by Radzi N.A.M., Din N.Md., Majid Mohd.S.A., Al-Mansoori M.H.

“…In order to fully optimize the bandwidth in upstream Ethernet passive optical network, dynamic bandwidth allocation (DBA) algorithm is used to allocate the bandwidth efficiently. …”

Algorithm optimization and low cost bit-serial architecture design for integer-pixel and sub-pixel motion estimation in H.264/AVC / Mohammad Reza Hosseiny Fatemi by Hosseiny Fatemi, Mohammad Reza

“…This thesis is concerned with algorithm optimization and efficient low cost architecture design for integer motion estimation (IME) and sub-pixel motion estimation (SME) of H.264/AVC. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Optimization of NoC Wrapper Design Under Bandwidth and Test Time Constraints by Hussin, Fawnizu Azmadi, Yoneda, Tomokazu, Fujiwara, Hideo

“…Two wrapper optimization algorithms are applied to both wrapper designs under channel bandwidth and test time constraints, resulting in very little or no increase in the test application time compared to conventional TAM approaches.…”
Get full text
Get full text

Optimized performance data transmission in Mobile IP networks by Gholizadeh, Somayyeh, Abdullah, Azizol, Othman, Mohamed, Mohd Hanapi, Zurina, Heydarian, Mohsen

“…Suppose that an MIPN uses an optimal routing algorithm and transmits data from a source node to a destination node optimally. …”
Get full text
Get full text