http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Susmit Bagchi (검색결과 8 건)
- 무료
- 기관 내 무료
- 유료
-
Modeling and Analyzing Distributed Computation in Monotone Spaces with Structural Map
Susmit Bagchi 보안공학연구지원센터 2016 International Journal of Software Engineering and Vol.10 No.4
Distributed computation follows the models of discrete structures in combinatorial forms. In higher-dimensions, the simplex structures of topological spaces as well as homology are employed to model and analyze distributed asynchronous computations. However, the monotone spaces are the general forms of topological spaces and can be effectively employed to analyze distributed computation. This paper proposes an analytical model of distributed computation in monotone spaces. It is illustrated that, the modeling of distributed computation in monotone spaces helps in determining consistent cuts under closure and convergence of computation. Furthermore, a connective mapping between the simplexes and monotone is constructed.
-
Formulating Analytical Solution of Network ODE Systems Based on Input Excitations
( Susmit Bagchi ) 한국정보처리학회 2018 Journal of information processing systems Vol.14 No.2
The concepts of graph theory are applied to model and analyze dynamics of computer networks, biochemical networks and, semantics of social networks. The analysis of dynamics of complex networks is important in order to determine the stability and performance of networked systems. The analysis of non-stationary and nonlinear complex networks requires the applications of ordinary differential equations (ODE). However, the process of resolving input excitation to the dynamic non-stationary networks is difficult without involving external functions. This paper proposes an analytical formulation for generating solutions of nonlinear network ODE systems with functional decomposition. Furthermore, the input excitations are analytically resolved in linearized dynamic networks. The stability condition of dynamic networks is determined. The proposed analytical framework is generalized in nature and does not require any domain or range constraints.
-
Formulating Analytical Solution of Network ODE Systems Based on Input Excitations
Bagchi, Susmit Korea Information Processing Society 2018 Journal of information processing systems Vol.14 No.2
The concepts of graph theory are applied to model and analyze dynamics of computer networks, biochemical networks and, semantics of social networks. The analysis of dynamics of complex networks is important in order to determine the stability and performance of networked systems. The analysis of non-stationary and nonlinear complex networks requires the applications of ordinary differential equations (ODE). However, the process of resolving input excitation to the dynamic non-stationary networks is difficult without involving external functions. This paper proposes an analytical formulation for generating solutions of nonlinear network ODE systems with functional decomposition. Furthermore, the input excitations are analytically resolved in linearized dynamic networks. The stability condition of dynamic networks is determined. The proposed analytical framework is generalized in nature and does not require any domain or range constraints.
-
VMDFS: Virtual Memory based Mobile Distributed File System
Susmit Bagchi 보안공학연구지원센터 2007 International Journal of Multimedia and Ubiquitous Vol.2 No.2
The mobile computing paradigm is becoming a reality due to the advent of mobile devices such as, PDA and Smart Phones having wireless interface to WWW. As a result, the high-end applications related to mobile multimedia and distributed digital contents have gained much attention. However, the existing distributed and mobile file systems are not adequately suitable to support such applications handling the challenges offered by mobile computing systems. In this paper, the concept, design architecture and consistency model of Virtual memory based Mobile Distributed File System (VMDFS) are proposed based on thin-mobileclient/ fat-server model. VMDFS creates the migrate-able virtual memory based mobile file system on top of the disk file systems of remote servers employing dynamic frame-lock to reduce network latency and to attain high-performance. An abstract mathematical model of VMDFS is constructed and associated properties are evaluated. The kernel-level implementation framework of VMDFS is illustrated based on Linux 2.4.22. The network paging latencies for LAN, Wireless VPN and 2.5G GPRS are measured experimentally. The results indicate that VMDFS is realizable.
-
-
-
Ali, Ihtisham,Bagchi, Susmit North-Holland 2018 Future generations computer systems Vol.86 No.-
<P><B>Abstract</B></P> <P>The execution of data intensive workflow is challenging in the domain of mobile distributed systems due to the involvement of heterogeneous computing devices and dynamic network topology. Moreover, data intensive workflow execution requires frequent access to database servers for dataflow and control flow operations resulting in massive data transfer. The workflow decomposition and distribution are required to minimize data transfer and to reduce execution delay in mobile distributed systems. This paper proposes a hybrid graph model of workflow in mobile distributed systems relying on dynamic network topology and distributed database in order to facilitate workflow decomposition. The algebraic and numerical analysis of the hybrid graph model is represented providing inherent properties. Furthermore, we have presented an extensive analytical study of existing workflow decomposition approaches and have provided detailed analysis to determine the suitability of these approaches in mobile distributed systems. We have also proposed a novel framework and implementation directions for workflow decomposition based on multiple parameters for mobile distributed systems.</P> <P><B>Highlights</B></P> <P> <UL> <LI> Hybrid graph model and algorithmic analysis of workflow decomposition in mobile distributed systems. </LI> <LI> Algebraic and numerical analysis of hybrid graph model and workflow decomposition in mobile distributed systems. </LI> <LI> Modeling workflow as hybrid graph and algorithmic analysis of workflow in mobile distributed systems. </LI> </UL> </P>
-
Software architecture and algorithm for reliable RPC for geo-distributed mobile computing systems
Khan, Asmat Ullah,Bagchi, Susmit North-Holland 2018 Future generations computer systems Vol.86 No.-
<P><B>Abstract</B></P> <P>Remote Procedure Call (RPC) is a computing as well as communication model for distributed processes to execute client routines on remote servers in the distributed systems. Due to the evolution of geo-distributed mobile cloud computing systems, mobile devices are exposed to frequent disconnection due to limited battery lifetime, processing capacity and network bandwidth while roaming globally. The existing standard RPC and mobile RPC frameworks are not completely suitable for applications in geo-distributed mobile cloud computing. This paper proposes a novel software architecture and associated algorithms for realizing reliable RPC under global mobility of clients. The stateful server chaining and multiple authentication primitives are employed in the proposed design to achieve security as well as location transparency. The software architecture is implemented on heterogeneous testbed and evaluated with promising results. The heterogeneity of mobile cloud platform is considered in the design by employing specific XDR format enhancing portability. A detailed comparative analysis of the proposed design is included in the paper.</P> <P><B>Highlights</B></P> <P> <UL> <LI> GMCC-RPC: Reliable mobile RPC for geo-distributed systems. </LI> <LI> Software architecture for mobile and reliable RPC for geo-distributed systems. </LI> <LI> Mobile and Reliable RPC using server chains in geo-distributed systems. </LI> </UL> </P>
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
