Social networking project by thuan do and jiming liu
This presentation is the property of its rightful owner.
Sponsored Links
1 / 37

Social Networking Project by Thuan Do and Jiming Liu PowerPoint PPT Presentation


  • 55 Views
  • Uploaded on
  • Presentation posted in: General

Social Networking Project by Thuan Do and Jiming Liu. Outline * Introduction * Project Scope * Mechanism * Results * Discussions * Conclusion * Future Work.

Download Presentation

Social Networking Project by Thuan Do and Jiming Liu

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Social networking project by thuan do and jiming liu

Social Networking Projectby Thuan Do and Jiming Liu


Outline introduction project scope mechanism results discussions conclusion future work

Outline* Introduction* Project Scope* Mechanism* Results* Discussions * Conclusion* Future Work


Social networking project by thuan do and jiming liu

* IntroductionWe design a network, which consists of up to MAX_SUPER super-entities, and each super entity contains up to MAX_ENTITY cyber-entities. Example: up to 10 families, and each family has up to 10 people.


Social networking project by thuan do and jiming liu

Each super-entity (or family) is like a complete graph. All cyber-entities inside the same family contain the same kind of data and they are all linked together. They all know about the positions of one another.


This is an example of a group with two families and each of them has 4 cyber entities

This is an example of a group with two families and each of them has 4 cyber-entities.


Social networking project by thuan do and jiming liu

B1

A2

B2

A1

B3

A4

A3

B4


Project scope

* Project Scope


Social networking project by thuan do and jiming liu

We will observe the behavior of the network in two cases: static and dynamic. We will compare them in term of the efficiency for locating services and saving of resources.


Social networking project by thuan do and jiming liu

Both static and dynamic network have the same design at the beginning. The static network will remain the same over time. The dynamic network will evolve. It has “replication” and “deleting” functions for cyber-entities.


Mechanism

* Mechanism


Social networking project by thuan do and jiming liu

We use C programming on a Unix machine to run this simulation. We will read in from an input file all the data we need.


Social networking project by thuan do and jiming liu

At first, we read in the number of super-entities, then the number of cyber-entities in each super-entity, then we randomly generate the coordinates of each cyber-entity as (x,y) within the range of the area.


Social networking project by thuan do and jiming liu

Next, we read in the number of links among the super-entities, and we randomly generate the links among members of pairs of cyber-entities.


Social networking project by thuan do and jiming liu

This is a small sample of network: number of super-entities is 10, and number of cyber-entities is up to 10.


We now read in the requests from the same input file we run those requests by a searching algorithm

We now read in the requests from the same input file. We run those requests by a searching algorithm.


Social networking project by thuan do and jiming liu

SEARCHING: At first, if the seeker finds the target family among his closest friends, we stop searching and begin to calculate the coordinate of the target family member which is closest to the seeker.


Social networking project by thuan do and jiming liu

If the target is not among his closest friends, we will put all of his family’s friends on a queue, then process each friend at a time. This is the same as “breadth first search”. By doing this way, we make sure that the closest target family member will be found first.


Results

* Results


Social networking project by thuan do and jiming liu

- Performance with Replication versus without Replication:Energy at some cyber-entities in the static system becomes very high, and they cannot serve all the requests.


Social networking project by thuan do and jiming liu

In the dynamic system, we have replications, and we were able to keep the energy low for all cyber-entities, thus, the service is good for all requests.


Performance with deletion versus performance without deletion

- Performance with Deletion versus Performance without Deletion


Social networking project by thuan do and jiming liu

At first, if we deleted all cyber-entities that got no request after a while: their friend-links were deleted also, and the network was ruined.


Social networking project by thuan do and jiming liu

We must be careful to choose a policy for deletion: we delete the cyber-entities that got no request after a certain time AND also have no friend-links.


Discussions

* Discussions


Social networking project by thuan do and jiming liu

In our small example, we tried to limit the number of hops around of the searching, and we found that the request message would not need to hop more than 6 times in order to find a target family


Social networking project by thuan do and jiming liu

We also run our program on a bigger network, having 100 super-entities, and each super-entities have 1,2 or 3 cyber-entities. We randomly generated a few links for each super-entities.


Social networking project by thuan do and jiming liu

The result is the same. The searching succeeds after only some hops, in most cases, two or three hops, since we do not count hopping to a sibling, or within a super-entity, as a hop.


Anyway the searching is fast if we also use family member s friends instead of one own friends

Anyway, the searching is fast if we also use family member’s friends instead of one own friends.


Conclusion

* Conclusion


1 bio network has an advantage over static network better serve users save resources

1 - Bio-network has an advantage over static network:* Better serve users* Save resources


Social networking project by thuan do and jiming liu

2 - We do not need too many hops to search for data. It never attain 8 before finding data. (at least in our network)


Future work

* Future work


Social networking project by thuan do and jiming liu

1- Within the scope of this class, we were not able to implement the “moving” of resources toward “clients”. We can implement that movement into our program in a next simulation.


Social networking project by thuan do and jiming liu

2 - We would like to investigate bigger networks. It suffice to generate a bigger input-file, with many super-entities and lots of requests. We will observe the evolution of the Bio-network over time, in a more real life situation.


Social networking project by thuan do and jiming liu

* ReferenceOur programs, test files, and outputs are put on my webpage at: http://www.ics.uci.edu/~tdo/243/project/The End


  • Login