• Title/Summary/Keyword: network-distributed computing

Search Result 450, Processing Time 0.023 seconds

Lower Bound of Message Complexity for Election Alogorithm in a Complete Network with Intermittent Faults (간헐적 고장이 있는 완전 네트워크에서 선거알고리즘을 위한 메시지 복잡도의 낮은 경계)

  • Kim, Seong-Dong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.11
    • /
    • pp.2855-2861
    • /
    • 1998
  • Election is a fundamental problem in the distributed computing. We consider n nodes in the network with f maximum number of faulty links incident on each node, where $f{\le}{\llcorner}(n-1/2){\lrcorner}$. In general, electing a leader, finding the maximum identifier and constructing a spanning tree belong to the same class in the distributed computing because of the same order of the message complexity. Using a spanning tree, we prove that the lower bound of message complexity for a leader election algorithm in an asynchronous complete network with intermittent link faults is $O(n^3)$.

  • PDF

A Design CORBA Security Service for DataBase Security in Ubiquitous Computing (유비쿼터스 환경의 데이터베이스 보안을 위한 CSS 설계)

  • Lee, Dae-Sik;Yun, Dong-Sic;Ahn, Heui-Hak
    • Convergence Security Journal
    • /
    • v.5 no.3
    • /
    • pp.15-22
    • /
    • 2005
  • The spread of Internet and the appear of Downsizing, SI(System Integration) is chaning centralized computing to distributed computing. Also distributed computing is rapidly changing to Ubiquitous computing escape from hard wire connected network. CORBA(Common Object Request Broker Architecture) is a middleware that used for smoothness communication between application program and operation system in a different environment. However distributed computing environment is not safe from the danger, the attack like virus, worm is too intellectual and variety. In this paper, we design a new DB security model and suggest efficiency of it in Ubiquitous environment base on CSS(CORBA Security Service) that present ed from OMG(Object Management Group).

  • PDF

Service ORiented Computing EnviRonment (SORCER) for deterministic global and stochastic aircraft design optimization: part 1

  • Raghunath, Chaitra;Watson, Layne T.;Jrad, Mohamed;Kapania, Rakesh K.;Kolonay, Raymond M.
    • Advances in aircraft and spacecraft science
    • /
    • v.4 no.3
    • /
    • pp.297-316
    • /
    • 2017
  • With rapid growth in the complexity of large scale engineering systems, the application of multidisciplinary analysis and design optimization (MDO) in the engineering design process has garnered much attention. MDO addresses the challenge of integrating several different disciplines into the design process. Primary challenges of MDO include computational expense and poor scalability. The introduction of a distributed, collaborative computational environment results in better utilization of available computational resources, reducing the time to solution, and enhancing scalability. SORCER, a Java-based network-centric computing platform, enables analyses and design studies in a distributed collaborative computing environment. Two different optimization algorithms widely used in multidisciplinary engineering design-VTDIRECT95 and QNSTOP-are implemented on a SORCER grid. VTDIRECT95, a Fortran 95 implementation of D. R. Jones' algorithm DIRECT, is a highly parallelizable derivative-free deterministic global optimization algorithm. QNSTOP is a parallel quasi-Newton algorithm for stochastic optimization problems. The purpose of integrating VTDIRECT95 and QNSTOP into the SORCER framework is to provide load balancing among computational resources, resulting in a dynamically scalable process. Further, the federated computing paradigm implemented by SORCER manages distributed services in real time, thereby significantly speeding up the design process. Part 1 covers SORCER and the algorithms, Part 2 presents results for aircraft panel design with curvilinear stiffeners.

Service ORiented Computing EnviRonment (SORCER) for deterministic global and stochastic aircraft design optimization: part 2

  • Raghunath, Chaitra;Watson, Layne T.;Jrad, Mohamed;Kapania, Rakesh K.;Kolonay, Raymond M.
    • Advances in aircraft and spacecraft science
    • /
    • v.4 no.3
    • /
    • pp.317-334
    • /
    • 2017
  • With rapid growth in the complexity of large scale engineering systems, the application of multidisciplinary analysis and design optimization (MDO) in the engineering design process has garnered much attention. MDO addresses the challenge of integrating several different disciplines into the design process. Primary challenges of MDO include computational expense and poor scalability. The introduction of a distributed, collaborative computational environment results in better utilization of available computational resources, reducing the time to solution, and enhancing scalability. SORCER, a Java-based network-centric computing platform, enables analyses and design studies in a distributed collaborative computing environment. Two different optimization algorithms widely used in multidisciplinary engineering design-VTDIRECT95 and QNSTOP-are implemented on a SORCER grid. VTDIRECT95, a Fortran 95 implementation of D. R. Jones' algorithm DIRECT, is a highly parallelizable derivative-free deterministic global optimization algorithm. QNSTOP is a parallel quasi-Newton algorithm for stochastic optimization problems. The purpose of integrating VTDIRECT95 and QNSTOP into the SORCER framework is to provide load balancing among computational resources, resulting in a dynamically scalable process. Further, the federated computing paradigm implemented by SORCER manages distributed services in real time, thereby significantly speeding up the design process. Part 1 covers SORCER and the algorithms, Part 2 presents results for aircraft panel design with curvilinear stiffeners.

A Study on Network Game Based on Client/Server (클라이언트/서버 기반의 네트워크 게임 연구)

  • Byun, Young-Ki;Lee, Han-Kwon;Kim, Jong-Gyeum;Cho, Tae-Kyung
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.55 no.2
    • /
    • pp.73-77
    • /
    • 2006
  • A server is simply a computer that is running software that enables it to serve specific requests from other computers, called 'clients.' Distributed systems are considered by some to be the 'next wave' of computing. A collection of probably heterogeneous distribution systems is transparent to the user so that the system appears as one local machine. This paper is going to search about whole of Client/Server distributed systems environment through network game. This paper presents game by one example of network game. The ladder game uses JAVA and embody to do random every time using Random function and remainder operation repeatedly. Analyze execution principle of network game through this tame and investigate about Client/Server's distributed environment through this.

Distributed Computing Models for Wireless Sensor Networks (무선 센서 네트워크에서의 분산 컴퓨팅 모델)

  • Park, Chongmyung;Lee, Chungsan;Jo, Youngtae;Jung, Inbum
    • Journal of KIISE
    • /
    • v.41 no.11
    • /
    • pp.958-966
    • /
    • 2014
  • Wireless sensor networks offer a distributed processing environment. Many sensor nodes are deployed in fields that have limited resources such as computing power, network bandwidth, and electric power. The sensor nodes construct their own networks automatically, and the collected data are sent to the sink node. In these traditional wireless sensor networks, network congestion due to packet flooding through the networks shortens the network life time. Clustering or in-network technologies help reduce packet flooding in the networks. Many studies have been focused on saving energy in the sensor nodes because the limited available power leads to an important problem of extending the operation of sensor networks as long as possible. However, we focus on the execution time because clustering and local distributed processing already contribute to saving energy by local decision-making. In this paper, we present a cooperative processing model based on the processing timeline. Our processing model includes validation of the processing, prediction of the total execution time, and determination of the optimal number of processing nodes for distributed processing in wireless sensor networks. The experiments demonstrate the accuracy of the proposed model, and a case study shows that our model can be used for the distributed application.

Real Time simulation programming in Object Oriented Distributed Computing Systems (객체지향 분산 컴퓨팅 시스템에서 실시간 시뮬레이션 프로그래밍)

  • Bae, Yong-Geun;Chin, Dal-Bok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.2
    • /
    • pp.159-168
    • /
    • 2002
  • Real-time(RT) object-oriented(OO) distributed computing is a form of RT distributed computing realized with a distributed computer system structured in the form of an object network. Several approached proposed in recent years for extending the conventional object structuring scheme to suit RT applications, are briefly reviewed. Then the approach named the Real Time Simulation Programing(RTSP) structuring scheme was formulated with the goal of instigating a quantum productivity jump in the design of distributed time triggered simulation. The RTSP scheme is intended to facilitate the pursuit of a new paradigm in designing distributed time triggered simulation which is to realize real-time computing with a common and general design style that does not alienate the main-stream computing industry and yet to allow system engineers to confidently produce certifiable distributed time triggered simulation for safety-critical applications. The RTSP structuring scheme is a syntactically simple but semantically Powerful extension of the conventional object structuring approached and as such, its support tools can be based on various well-established OO programming languages such as C+ + and on ubiquitous commercial RT operating system kernels. The Scheme enables a great reduction of the designers efforts in guaranteeing timely service capabilities of application systems.

An Enhanced University Registration Model Using Distributed Database Schema

  • Maabreh, Khaled Saleh
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3533-3549
    • /
    • 2019
  • A big database utilizes the establishing network technology, and it became an emerging trend in the computing field. Therefore, there is a necessity for an optimal and effective data distribution approach to deal with this trend. This research presents the practical perspective of designing and implementing distributed database features. The proposed system has been establishing the satisfying, reliable, scalable, and standardized use of information. Furthermore, the proposed scheme reduces the vast and recurring efforts for designing an individual system for each university, as well as it is effectively participating in solving the course equivalence problem. The empirical finding in this study shows the superiority of the distributed system performance based on the average response time and the average waiting time than the centralized system. The system throughput also overcomes the centralized system because of data distribution and replication. Therefore, the analyzed data shows that the centralized system thrashes when the workload exceeds 60%, while the distributed system becomes thrashes after 81% workload.

A Data Sharing Algorithm of Micro Data Center in Distributed Cloud Networks (분산클라우드 환경에서 마이크로 데이터센터간 자료공유 알고리즘)

  • Kim, Hyuncheol
    • Convergence Security Journal
    • /
    • v.15 no.2
    • /
    • pp.63-68
    • /
    • 2015
  • Current ICT(Information & Communication Technology) infrastructures (Internet and server/client communication) are struggling for a wide variety of devices, services, and business and technology evolution. Cloud computing originated simply to request and execute the desired operation from the network of clouds. It means that an IT resource that provides a service using the Internet technology. It is getting the most attention in today's IT trends. In the distributed cloud environments, management costs for the network and computing resources are solved fundamentally through the integrated management system. It can increase the cost savings to solve the traffic explosion problem of core network via a distributed Micro DC. However, traditional flooding methods may cause a lot of traffic due to transfer to all the neighbor DCs. Restricted Path Flooding algorithms have been proposed for this purpose. In large networks, there is still the disadvantage that may occur traffic. In this paper, we developed Lightweight Path Flooding algorithm to improve existing flooding algorithm using hop count restriction.

Block-VN: A Distributed Blockchain Based Vehicular Network Architecture in Smart City

  • Sharma, Pradip Kumar;Moon, Seo Yeon;Park, Jong Hyuk
    • Journal of Information Processing Systems
    • /
    • v.13 no.1
    • /
    • pp.184-195
    • /
    • 2017
  • In recent decades, the ad hoc network for vehicles has been a core network technology to provide comfort and security to drivers in vehicle environments. However, emerging applications and services require major changes in underlying network models and computing that require new road network planning. Meanwhile, blockchain widely known as one of the disruptive technologies has emerged in recent years, is experiencing rapid development and has the potential to revolutionize intelligent transport systems. Blockchain can be used to build an intelligent, secure, distributed and autonomous transport system. It allows better utilization of the infrastructure and resources of intelligent transport systems, particularly effective for crowdsourcing technology. In this paper, we proposes a vehicle network architecture based on blockchain in the smart city (Block-VN). Block-VN is a reliable and secure architecture that operates in a distributed way to build the new distributed transport management system. We are considering a new network system of vehicles, Block-VN, above them. In addition, we examine how the network of vehicles evolves with paradigms focused on networking and vehicular information. Finally, we discuss service scenarios and design principles for Block-VN.