• Title/Summary/Keyword: international networks

Search Result 1,165, Processing Time 0.024 seconds

PERFORMANCE ANALYSIS OF CONGESTION CONTROL ALGORITHM IN COMMON CHANNEL SIGNALING NETWORKS

  • Park, Chul-Geun;Ahn, Seong-Joon;Lim, Jong-Seul
    • Journal of applied mathematics & informatics
    • /
    • v.12 no.1_2
    • /
    • pp.395-408
    • /
    • 2003
  • Common Channel Signaling(CCS) networks need special controls to avoid overload of signaling networks and degradation of call process-ing rate, since they play an important role of controlling communication transfer networks. Congestion control and flow control mechanisms are well described in ITU-T recommendation on Signaling System No.7(SS7). For the practical provisions, however, we need an analysis on the relation among service objects, system requirements and implementation of congestion control algorithms. SS7 provides several options for controlling link congestion in CCS networks. In this paper we give a general queueing model of congestion control algorithm which covers both the international and national options. From the queuing model, we obtain the performance parameters such as throughput, message loss rate and mean delay for the international option. To show the performance of the algorithm, some numerical results are also given.

Dynamic Routing and Spectrum Allocation with Traffic Differentiation to Reduce Fragmentation in Multifiber Elastic Optical Networks

  • ZOUNEME, Boris Stephane;ADEPO, Joel;DIEDIE, Herve Gokou;OUMTANAGA, Souleymane
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.3
    • /
    • pp.1-10
    • /
    • 2021
  • In recent decades, the heterogeneous and dynamic behavior of Internet traffic has placed new demands on the adaptive resource allocation of the optical network infrastructure. However, the advent of multifiber elastic optical networks has led to a higher degree of spectrum fragmentation than conventional flexible grid networks due to the dynamic and random establishment and removal of optical connections. In this paper, we propose heuristic routing and dynamic slot allocation algorithms to minimize spectrum fragmentation and reduce the probability of blocking future connection requests by considering the power consumption in elastic multifiber elastic optical networks.

Secure Cluster Selection in Autonomous Vehicular Networks

  • Mohammed, Alkhathami
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.1
    • /
    • pp.11-16
    • /
    • 2023
  • Vehicular networks are part of the next generation wireless and smart Intelligent Transportation Systems (ITS). In the future, autonomous vehicles will be an integral part of ITS and will provide safe and reliable traveling features to the users. The reliability and security of data transmission in vehicular networks has been a challenging task. To manage data transmission in vehicular networks, road networks are divided into clusters and a cluster head is selected to handle the data. The selection of cluster heads is a challenge as vehicles are mobile and their connectivity is dynamically changing. In this paper, a novel secure cluster head selection algorithm is proposed for secure and reliable data sharing. The idea is to use the secrecy rate of each vehicle in the cluster and adaptively select the most secure vehicle as the cluster head. Simulation results show that the proposed scheme improves the reliability and security of the transmission significantly.

A Study on the Improvement of Bayesian networks in e-Trade (전자무역의 베이지안 네트워크 개선방안에 관한 연구)

  • Jeong, Boon-Do
    • International Commerce and Information Review
    • /
    • v.9 no.3
    • /
    • pp.305-320
    • /
    • 2007
  • With expanded use of B2B(between enterprises), B2G(between enterprises and government) and EDI(Electronic Data Interchange), and increased amount of available network information and information protection threat, as it was judged that security can not be perfectly assured only with security technology such as electronic signature/authorization and access control, Bayesian networks have been developed for protection of information. Therefore, this study speculates Bayesian networks system, centering on ERP(Enterprise Resource Planning). The Bayesian networks system is one of the methods to resolve uncertainty in electronic data interchange and is applied to overcome uncertainty of abnormal invasion detection in ERP. Bayesian networks are applied to construct profiling for system call and network data, and simulate against abnormal invasion detection. The host-based abnormal invasion detection system in electronic trade analyses system call, applies Bayesian probability values, and constructs normal behavior profile to detect abnormal behaviors. This study assumes before and after of delivery behavior of the electronic document through Bayesian probability value and expresses before and after of the delivery behavior or events based on Bayesian networks. Therefore, profiling process using Bayesian networks can be applied for abnormal invasion detection based on host and network. In respect to transmission and reception of electronic documents, we need further studies on standards that classify abnormal invasion of various patterns in ERP and evaluate them by Bayesian probability values, and on classification of B2B invasion pattern genealogy to effectively detect deformed abnormal invasion patterns.

  • PDF

Single Image Dehazing: An Analysis on Generative Adversarial Network

  • Amina Khatun;Mohammad Reduanul Haque;Rabeya Basri;Mohammad Shorif Uddin
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.2
    • /
    • pp.136-142
    • /
    • 2024
  • Haze is a very common phenomenon that degrades or reduces the visibility. It causes various problems where high quality images are required such as traffic and security monitoring. So haze removal from images receives great attention for clear vision. Due to its huge impact, significant advances have been achieved but the task yet remains a challenging one. Recently, different types of deep generative adversarial networks (GAN) are applied to suppress the noise and improve the dehazing performance. But it is unclear how these algorithms would perform on hazy images acquired "in the wild" and how we could gauge the progress in the field. This paper aims to bridge this gap. We present a comprehensive study and experimental evaluation on diverse GAN models in single image dehazing through benchmark datasets.

Performance Evaluation for a Unicast Vehicular Delay Tolerant Routing Protocol Networks

  • Abdalla, Ahmed Mohamed
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.2
    • /
    • pp.167-174
    • /
    • 2022
  • Vehicular Ad hoc Networks are considered as special kind of Mobile Ad Hoc Networks. VANETs are a new emerging recently developed, advanced technology that allows a wide set of applications related to providing more safety on roads, more convenience for passengers, self-driven vehicles, and intelligent transportation systems (ITS). Delay Tolerant Networks (DTN) are networks that allow communication in the event of connection problems, such as delays, intermittent connections, high error rates, and so on. Moreover, these are used in areas that may not have end-to-end connectivity. The expansion from DTN to VANET resulted in Vehicle Delay Tolerant Networks (VDTN). In this approach, a vehicle stores and carries a message in its buffer, and when the opportunity arises, it forwards the message to another node. Carry-store-forward mechanisms, packets in VDTNs can be delivered to the destination without clear connection between the transmitter and the receiver. The primary goals of routing protocols in VDTNs is to maximize the probability of delivery ratio to the destination node, while minimizing the total end-to-end delay. DTNs are used in a variety of operating environments, including those that are subject to failures and interruptions, and those with high delay, such as vehicle ad hoc networks (VANETs). This paper discusses DTN routing protocols belonging to unicast delay tolerant position based. The comparison was implemented using the NS2 simulator. Simulation of the three DTN routing protocols GeOpps, GeoSpray, and MaxProp is recorded, and the results are presented.

Enhancing Internet of Things Security with Random Forest-Based Anomaly Detection

  • Ahmed Al Shihimi;Muhammad R Ahmed;Thirein Myo;Badar Al Baroomi
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.6
    • /
    • pp.67-76
    • /
    • 2024
  • The Internet of Things (IoT) has revolutionized communication and device operation, but it has also brought significant security challenges. IoT networks are structured into four levels: devices, networks, applications, and services, each with specific security considerations. Personal Area Networks (PANs), Local Area Networks (LANs), and Wide Area Networks (WANs) are the three types of IoT networks, each with unique security requirements. Communication protocols such as Wi-Fi and Bluetooth, commonly used in IoT networks, are susceptible to vulnerabilities and require additional security measures. Apart from physical security, authentication, encryption, software vulnerabilities, DoS attacks, data privacy, and supply chain security pose significant challenges. Ensuring the security of IoT devices and the data they exchange is crucial. This paper utilizes the Random Forest Algorithm from machine learning to detect anomalous data in IoT devices. The dataset consists of environmental data (temperature and humidity) collected from IoT sensors in Oman. The Random Forest Algorithm is implemented and trained using Python, and the accuracy and results of the model are discussed, demonstrating the effectiveness of Random Forest for detecting IoT device data anomalies.

Hierarchy in Signed Networks

  • Jamal Maktoubian
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.9
    • /
    • pp.111-118
    • /
    • 2024
  • The concept of social stratification and hierarchy among human dates back to the origin of human race. Presently, the growing reputation of social networks has given us with an opportunity to analyze these well-studied phenomena over different networks at different scales. Generally, a social network could be defined as a collection of actors and their interactions. In this work, we concern ourselves with a particular type of social networks, known as trust networks. In this type of networks, there is an explicit show of trust (positive interaction) or distrust (negative interaction) among the actors. In other words, an actor can designate others as friends or foes. Trust networks are typically modeled as signed networks. A signed network is a directed graph in which the edges carry an edge weight of +1 (indicating trust) or -1 (indicating distrust). Examples of signed networks include the Slashdot Zoo network, the Epinions network and the Wikipedia adminship election network. In a social network, actors tend to connect with each other on the basis of their perceived social hierarchy. The emergence of such a hierarchy within a social community shows the manner in which authority manifests in the community. In the case of signed networks, the concept of social hierarchy can be interpreted as the emergence of a tree-like structure comprising of actors in a top-down fashion in the order of their ranks, describing a specific parent-child relationship, viz. child trusts parent. However, owing to the presence of positive as well as negative interactions in signed networks, deriving such "trust hierarchies" is a non-trivial challenge. We argue that traditional notions (of unsigned networks) are insufficient to derive hierarchies that are latent within signed networks In order to build hierarchies in signed networks, we look at two interpretations of trust namely presence of trust (or "good") and lack of distrust (or "not bad"). In order to develop a hierarchy signifying both trust and distrust effectively, the above interpretations are combined together for calculating the overall trustworthiness (termed as deserve) of actors. The actors are then arranged in a hierarchical fashion based on these aggregate deserve values, according to the following hypothesis: actor v is assigned as a child of actor u if: (i) v trusts u, and (ii) u has a higher deserve value than v. We describe this hypothesis with additional qualifiers in this thesis.

Industrial Networks and Evolution of the International Quaternary Place System

  • Nahm, Kee-Bom
    • Journal of the Korean Regional Science Association
    • /
    • v.11 no.1
    • /
    • pp.93-111
    • /
    • 1995
  • This study investigated the nature of spatial concentration and dispersion of corporate control within an international system of decision-making centers. It introduces a simplified model of the global evolution of quaternary places. Linked to the national quaternary place model, the proposed model is useful for examinations involving real world situations associated with international corporations. This five stage model emphasizes the importance of the organizational structure of large corporations, industrial networks and the development of information technology. It suggests the dispersion of international quaternary places along with the diversification of corporate control linkages among quaternary centers. A case study for 1974-1991 uses information statistics to identify the current stage of the international quaternary system. The result is in general agreement with major elements of the stage model. This theoretical concept and empirical research contribute to the expansion of quaternary place theory to the global scale in particular, and to the development of location analysis in general.

  • PDF

Enhanced MPR Selection Strategy for Multicast OLSR

  • Matter, Safaa S.;Al Shaikhli, Imad F.;Hashim, Aisha H.A.;Ahmed, Abdelmoty M.;Khattab, Mahmoud M.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.10
    • /
    • pp.137-144
    • /
    • 2022
  • Wireless community networks (WCNs) are considered another form of ownership of internet protocol (IP) networks, where community members manage and own every piece of equipment in a decentralized way, and routing for traffic is done in a cooperative manner. However, the current routing protocols for WCNs suffer from stability and scalability issues. In this paper, an enhanced routing protocol is proposed based on the optimized link state routing (OLSR) protocol to meet the standards of efficiency in terms of stability and scalability. The proposed routing protocol is enhanced through two phases: multicasting expansion and multipoint relay (MPR) selection based on an analytical hierarchical process (AHP). The experimental results demonstrate that the proposed routing protocol outperforms the OLSR protocol in terms of network control overhead and packet delivery ratio by 18% and 1% respectively.