Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579390
M. Islam, U. Kabir
Load balancing is the key to the efficient operation of distributed systems. To efficiently utilize computing resources provided by distributed systems, an underlying dynamic load balancing (DLB) scheme must address both heterogeneous and dynamic features of distributed systems. In this paper, a DLB scheme for solution adaptive finite element graph applications on distributed systems is proposed. Experiments show that by using the proposed distributed DLB scheme, the execution time and the number of process migration is close to using condensed binary tree load balancing (CBTLB) scheme which does not consider the dynamic nature and diverse platform of distributed systems.
{"title":"A dynamic load balancing approach for solution adaptive finite element graph applications on distributed systems","authors":"M. Islam, U. Kabir","doi":"10.1109/ICCITECHN.2007.4579390","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579390","url":null,"abstract":"Load balancing is the key to the efficient operation of distributed systems. To efficiently utilize computing resources provided by distributed systems, an underlying dynamic load balancing (DLB) scheme must address both heterogeneous and dynamic features of distributed systems. In this paper, a DLB scheme for solution adaptive finite element graph applications on distributed systems is proposed. Experiments show that by using the proposed distributed DLB scheme, the execution time and the number of process migration is close to using condensed binary tree load balancing (CBTLB) scheme which does not consider the dynamic nature and diverse platform of distributed systems.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132099574","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579363
A. Saber, S. Ahmmed, A. Alshareef, A. Abdulwhab, K. Adbullah-Al-Mamun
This paper presents a modified particle swarm optimization (MPSO) for constrained non-linear optimization problems. Optimization problems are very complex in real life applications. The proposed modified PSO consists of problem (complexity) dependent variable number of promising values (in velocity vector), error-iteration dependent step length, unlocking the dead look of idle particles and so on. It reliably and accurately tracks a continuously changing solution of the complex function and no extra concentration/effort is needed for more complex higher order functions. Constraint management is incorporated in the modified PSO by penalty function. The modified PSO has balance between local and global searching abilities, and an appropriate fitness function helps to converge it quickly. To avoid the method to be frozen, stagnated/idle particles are reset. Finally, benchmark data and methods are used to show the effectiveness of the proposed method.
{"title":"Constrained non-linear optimization by modified particle swarm optimization","authors":"A. Saber, S. Ahmmed, A. Alshareef, A. Abdulwhab, K. Adbullah-Al-Mamun","doi":"10.1109/ICCITECHN.2007.4579363","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579363","url":null,"abstract":"This paper presents a modified particle swarm optimization (MPSO) for constrained non-linear optimization problems. Optimization problems are very complex in real life applications. The proposed modified PSO consists of problem (complexity) dependent variable number of promising values (in velocity vector), error-iteration dependent step length, unlocking the dead look of idle particles and so on. It reliably and accurately tracks a continuously changing solution of the complex function and no extra concentration/effort is needed for more complex higher order functions. Constraint management is incorporated in the modified PSO by penalty function. The modified PSO has balance between local and global searching abilities, and an appropriate fitness function helps to converge it quickly. To avoid the method to be frozen, stagnated/idle particles are reset. Finally, benchmark data and methods are used to show the effectiveness of the proposed method.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131450705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579388
A. Rahman, M. Murshed
Dynamic textures are textures with motion. Characterization of visual processes consisting of multiple dynamic textures is of vital importance to computer vision research, with a diverse set of applications in the field of robot navigation, and remote monitoring applications etc. In the current literature, however, studies are mostly limited to characterization of single dynamic textures. In this paper we aim to address the problem of segmenting image sequences consisting of multiple dynamic textures. More precisely we separate image segments having different characteristic motion patterns - a key attribute of individual dynamic textures. Experimental results demonstrate the ability of the proposed technique by segmenting a wide variety of multiple dynamic texture image sequences.
{"title":"Segmentation of dynamic textures","authors":"A. Rahman, M. Murshed","doi":"10.1109/ICCITECHN.2007.4579388","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579388","url":null,"abstract":"Dynamic textures are textures with motion. Characterization of visual processes consisting of multiple dynamic textures is of vital importance to computer vision research, with a diverse set of applications in the field of robot navigation, and remote monitoring applications etc. In the current literature, however, studies are mostly limited to characterization of single dynamic textures. In this paper we aim to address the problem of segmenting image sequences consisting of multiple dynamic textures. More precisely we separate image segments having different characteristic motion patterns - a key attribute of individual dynamic textures. Experimental results demonstrate the ability of the proposed technique by segmenting a wide variety of multiple dynamic texture image sequences.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133414690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579370
D. Yasmin, S. Rafique
In this research study, an integrated network of GPS-24, GEO and LEO has been designed to improve the worst-case precision values. The precision values to be realized by the receiver with an algorithm have been proposed. It is expected that a good worldwide availability of best four selected orbiting satellites among many having maximum coverage would be the preferred constellation for navigation. A new approach for minimum dilution of precision (DOP) determination using integrated constellation is developed. Satellite visibility through GPS receiver has been investigated using complex simulations of failure scenarios by giving shadow effect. This work is to improve coverage and satellite visibility for accurate, flexible, fast and cost-effective navigation purpose using integrated network. Using a 3-step algorithm a set of best four satellites selection is possible by minimum calculation by determining minimum DOP. A measurement for positioning, satellites at low elevation angles and at high elevation angles has been compared. The proposed model and algorithm will hopefully be used for navigation purposes in the worst case. The system can also be used academically as well as for commercial purpose.
{"title":"Integration of GPS-24, GEO & LEO: Modeling, receiver selection algorithm and performance analysis for navigation","authors":"D. Yasmin, S. Rafique","doi":"10.1109/ICCITECHN.2007.4579370","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579370","url":null,"abstract":"In this research study, an integrated network of GPS-24, GEO and LEO has been designed to improve the worst-case precision values. The precision values to be realized by the receiver with an algorithm have been proposed. It is expected that a good worldwide availability of best four selected orbiting satellites among many having maximum coverage would be the preferred constellation for navigation. A new approach for minimum dilution of precision (DOP) determination using integrated constellation is developed. Satellite visibility through GPS receiver has been investigated using complex simulations of failure scenarios by giving shadow effect. This work is to improve coverage and satellite visibility for accurate, flexible, fast and cost-effective navigation purpose using integrated network. Using a 3-step algorithm a set of best four satellites selection is possible by minimum calculation by determining minimum DOP. A measurement for positioning, satellites at low elevation angles and at high elevation angles has been compared. The proposed model and algorithm will hopefully be used for navigation purposes in the worst case. The system can also be used academically as well as for commercial purpose.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132993573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579377
M. Haque, R. Mishra
The construction activity level intricacy makes the whole construction process quite complicated and difficult for planners and builders. 4D (3D+Time) construction planning is a promising area, and it presents the ability to represent the construction process with the additional sequential dimension. It makes the virtual models easy to analyze and plan for the sequence of activities. Traditionally, architectural/construction engineering and technology education, especially construction scheduling has been dependent on bar charts and network diagrams. However, students can hardly understand the schedule-construction progress relationship using a CPM network or a bar chart. Using 4D visualization students can learn time-space relationship in construction schedule more effectively. The objective of this research was to create a user-friendly 5D (3D+time+cost) model by adding the cost of project with reference to the time line so that the planners would be able to peg the cost control measures with the schedule. The study provides a structured method and a systematic approach that will enable the students and planners to develop 5D models without worrying about the errors and software hitches. This 5D visualization model will facilitate developing a more realistic approach to the whole construction process. The entire model is integrated to produce an interactive visualization to make the process fairly easier for students as well as the construction industry professionals. In addition to this, changes to the 5D model can be done easily by triggering changes at one level. The techniques demonstrated through 5D virtual construction models can potentially be a valuable tool not only in the classroom, but also as an effective learner-centered self-directed tool to learn planning and construction processes.
{"title":"5D virtual constructions: Designer/constructor’s perspective","authors":"M. Haque, R. Mishra","doi":"10.1109/ICCITECHN.2007.4579377","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579377","url":null,"abstract":"The construction activity level intricacy makes the whole construction process quite complicated and difficult for planners and builders. 4D (3D+Time) construction planning is a promising area, and it presents the ability to represent the construction process with the additional sequential dimension. It makes the virtual models easy to analyze and plan for the sequence of activities. Traditionally, architectural/construction engineering and technology education, especially construction scheduling has been dependent on bar charts and network diagrams. However, students can hardly understand the schedule-construction progress relationship using a CPM network or a bar chart. Using 4D visualization students can learn time-space relationship in construction schedule more effectively. The objective of this research was to create a user-friendly 5D (3D+time+cost) model by adding the cost of project with reference to the time line so that the planners would be able to peg the cost control measures with the schedule. The study provides a structured method and a systematic approach that will enable the students and planners to develop 5D models without worrying about the errors and software hitches. This 5D visualization model will facilitate developing a more realistic approach to the whole construction process. The entire model is integrated to produce an interactive visualization to make the process fairly easier for students as well as the construction industry professionals. In addition to this, changes to the 5D model can be done easily by triggering changes at one level. The techniques demonstrated through 5D virtual construction models can potentially be a valuable tool not only in the classroom, but also as an effective learner-centered self-directed tool to learn planning and construction processes.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130110431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579448
K.H. Rahman, F. Ahmed, S. A. Sagor, M. G. Mostafa
Collision is a problem which degrades the performance of the radio frequency identification (RFID) system while multiple tags are communicating with the reader simultaneously. Currently this problem is handled by various procedures such as framed ALOHA protocol, binary tree protocol, tree walking algorithm or using spread spectrum modulation scheme. The current solutions are slow, power wasting and cannot solve collision problem in better aspect. The proposed system eliminates collision while multiple tags are responding to the reader under its network and provides better power savings than existing systems.
{"title":"An efficient anti-collision technique for Radio Frequency Identification Systems","authors":"K.H. Rahman, F. Ahmed, S. A. Sagor, M. G. Mostafa","doi":"10.1109/ICCITECHN.2007.4579448","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579448","url":null,"abstract":"Collision is a problem which degrades the performance of the radio frequency identification (RFID) system while multiple tags are communicating with the reader simultaneously. Currently this problem is handled by various procedures such as framed ALOHA protocol, binary tree protocol, tree walking algorithm or using spread spectrum modulation scheme. The current solutions are slow, power wasting and cannot solve collision problem in better aspect. The proposed system eliminates collision while multiple tags are responding to the reader under its network and provides better power savings than existing systems.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114929100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579423
N. Jahangir, A. Chowdhury
Automated banknote recognition system can be a very good utility in banking systems and other field of commerce. It can also aid visually impaired people. Although in Bangladesh, bill money recognition machines are not common but it is used in other countries. In this paper, for the first time, we have proposed a Neural Network based recognition scheme for Bangladeshi banknotes. The scheme can efficiently be implemented in cheap hardware which may be very useful in many places. The recognition system takes scanned images of banknotes which are scanned by low cost optoelectronic sensors and then fed into a Multilayer Perceptron, trained by Backpropagation algorithm, for recognition. Axis Symmetric Masks are used in preprocessing stage which reduces the network size and guarantees correct recognition even if the note is flipped. Experimental results are presented which show that this scheme can recognize currently available 8 notes (1, 2, 5, 10, 20, 50, 100 & 500 Taka) successfully with an average accuracy of 98.57%.
{"title":"Bangladeshi banknote recognition by neural network with axis symmetrical masks","authors":"N. Jahangir, A. Chowdhury","doi":"10.1109/ICCITECHN.2007.4579423","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579423","url":null,"abstract":"Automated banknote recognition system can be a very good utility in banking systems and other field of commerce. It can also aid visually impaired people. Although in Bangladesh, bill money recognition machines are not common but it is used in other countries. In this paper, for the first time, we have proposed a Neural Network based recognition scheme for Bangladeshi banknotes. The scheme can efficiently be implemented in cheap hardware which may be very useful in many places. The recognition system takes scanned images of banknotes which are scanned by low cost optoelectronic sensors and then fed into a Multilayer Perceptron, trained by Backpropagation algorithm, for recognition. Axis Symmetric Masks are used in preprocessing stage which reduces the network size and guarantees correct recognition even if the note is flipped. Experimental results are presented which show that this scheme can recognize currently available 8 notes (1, 2, 5, 10, 20, 50, 100 & 500 Taka) successfully with an average accuracy of 98.57%.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129190889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579381
M.N. Islam, M. Islam, I.J. Shadaque, M. Khan
Searching is an important factor in p2p network for content retrieval. Most of the searches in p2p system are title-based with their limited functionality. Without knowing the unique filename we canpsilat retrieve the content of the file in title based search. Here super peer p2p network is designed that supports content-based search for relevant documents. At the beginning, a general and extensible framework is proposed which is based on hierarchical summary structure for searching similar documents in p2p network. The summary structure is formed by Vector Space Model (VSM), Latent Semantic Indexing (LSI) and Singular Value Decomposition (SVD) techniques. Than an effective document searching is developed by summarizing and maintaining all documents within the network with different factors. Finally at the end, the experimental result is verified on a real p2p prototype and large scale network. The results show the effectiveness, efficiency and scalability of the proposed system.
{"title":"Developing an extensible framework for content based searching in super peer p2p network","authors":"M.N. Islam, M. Islam, I.J. Shadaque, M. Khan","doi":"10.1109/ICCITECHN.2007.4579381","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579381","url":null,"abstract":"Searching is an important factor in p2p network for content retrieval. Most of the searches in p2p system are title-based with their limited functionality. Without knowing the unique filename we canpsilat retrieve the content of the file in title based search. Here super peer p2p network is designed that supports content-based search for relevant documents. At the beginning, a general and extensible framework is proposed which is based on hierarchical summary structure for searching similar documents in p2p network. The summary structure is formed by Vector Space Model (VSM), Latent Semantic Indexing (LSI) and Singular Value Decomposition (SVD) techniques. Than an effective document searching is developed by summarizing and maintaining all documents within the network with different factors. Finally at the end, the experimental result is verified on a real p2p prototype and large scale network. The results show the effectiveness, efficiency and scalability of the proposed system.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122192761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2007-12-01DOI: 10.1109/ICCITECHN.2007.4579413
S. Redwan
This work has been done as a software engineering research-based course work using the principles of designing a user-interface. The objective of the research was to finding out how the current WIMP based operating systemspsila start menu can be made more usable to the users. In an imaginary WIMP based future operating system, the mouse and voice can be made more usable in regard of accessing the start menu. In this paper I propose a user-interface for the WIMP based start menu which I named dasiaInstant-access start menupsila. I have broadly described the possible dasialook and feelpsila and functionalities of such start menu and its accessibility features. I have listed all the user interface design principles that I have used to design my start menu. I have also mentioned briefly about the user interface metaphors I have used to design it. At the end, I have narrated the usability of my designed start menu along with the usability engineering attributes my start menu contains.
{"title":"Instant-access start menu for an imaginary WIMP based future operating system","authors":"S. Redwan","doi":"10.1109/ICCITECHN.2007.4579413","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579413","url":null,"abstract":"This work has been done as a software engineering research-based course work using the principles of designing a user-interface. The objective of the research was to finding out how the current WIMP based operating systemspsila start menu can be made more usable to the users. In an imaginary WIMP based future operating system, the mouse and voice can be made more usable in regard of accessing the start menu. In this paper I propose a user-interface for the WIMP based start menu which I named dasiaInstant-access start menupsila. I have broadly described the possible dasialook and feelpsila and functionalities of such start menu and its accessibility features. I have listed all the user interface design principles that I have used to design my start menu. I have also mentioned briefly about the user interface metaphors I have used to design it. At the end, I have narrated the usability of my designed start menu along with the usability engineering attributes my start menu contains.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121493467","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Call admission control (CAC) protocol will try to be fair, fast, reducing inconveniences, and maintaining quality of service (QoS) at the time of deciding whether a call request will be accepted or rejected into a network or communication system. A good CAC should have the ability to select the calls among the requested calls in such a way so that maximum fairness is justified by its performances at the sometime it should achieve some targets such as maximizing the revenue considering the constraints of the network system such as limited bandwidth. In the todaypsilas communication world the demand of bandwidth increases sharply due to the different users different types of service requirements such as audio, video, voice etc. from the same communication system. Besides need to deal with different tariff. So considering all these issues a CAC needs to decide which call requests should be admitted or not, which is obviously a critical and difficult task. In this paper a new CAC protocol is proposed that can select the best calls for the communication system, it can optimize the generated revenue from the network system, it can handle the different call admission situations in a fairness way, it can consider the different priorities based on class, can maximize the revenue of the communication system and also maintains the overall QoS for any network or communication system. Empirical results have shown its excellent performances for any network and communication platform.
{"title":"A new CAC protocol for optimizing revenue and ensuring QoS","authors":"Tania Taharima Chowdhary, Md. Shafiul Alam, Md. Mohiuddin Soel, Raiyan Kabir, Suman Ahmmed","doi":"10.1109/ICCITECHN.2007.4579382","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2007.4579382","url":null,"abstract":"Call admission control (CAC) protocol will try to be fair, fast, reducing inconveniences, and maintaining quality of service (QoS) at the time of deciding whether a call request will be accepted or rejected into a network or communication system. A good CAC should have the ability to select the calls among the requested calls in such a way so that maximum fairness is justified by its performances at the sometime it should achieve some targets such as maximizing the revenue considering the constraints of the network system such as limited bandwidth. In the todaypsilas communication world the demand of bandwidth increases sharply due to the different users different types of service requirements such as audio, video, voice etc. from the same communication system. Besides need to deal with different tariff. So considering all these issues a CAC needs to decide which call requests should be admitted or not, which is obviously a critical and difficult task. In this paper a new CAC protocol is proposed that can select the best calls for the communication system, it can optimize the generated revenue from the network system, it can handle the different call admission situations in a fairness way, it can consider the different priorities based on class, can maximize the revenue of the communication system and also maintains the overall QoS for any network or communication system. Empirical results have shown its excellent performances for any network and communication platform.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123392667","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：