IP Library › Granted Patent US 12,248,527
Granted Patent B2
US 12,248,527 · App. 18/054,849 · Granted Mar 11, 2025

Requesting an IP address using a non-textual graphical resource identifier

Inventor: Venkataramana Logasundaram Jaganathan (Chennai, IN)
Assignee: International Business Machines Corporation
G06F16/9566G06F16/9024G06F16/953H04L67/01
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,248,527
App. No.
18/054,849
Granted
Mar 11, 2025
Kind
B2
Abstract

A computer-implemented method comprises displaying a grid comprising a plurality of cells; receiving user input modifying a state of one or more of the plurality of cells to create a graphical shape in the grid, wherein each of the plurality of cells is limited to one of a plurality of predefined states; requesting an internet protocol (IP) address corresponding to the graphical shape; and in response to receiving the IP address corresponding to the graphical shape, retrieving a web resource located at the IP address.

Claims (51)

1. A computer-implemented method comprising:

displaying a grid comprising a plurality of cells;

receiving user input individually modifying a state of one or more of the plurality of cells to create a non-textual based graphical shape in the grid, wherein each of the plurality of cells is configured to accept only a predetermined set of non-textual patterns such that each of the plurality of cells is limited to a predetermined number of possible predefined states;

requesting an internet protocol (IP) address using the non-textual based graphical shape as a resource identifier for a web resource located at the IP address, wherein the requesting comprises:

converting the non-textual based graphical shape into a punycode corresponding to the non-textual based graphical shape; and

transmitting the punycode to a Domain Name System (DNS) server to request the IP address based on the punycode; and

in response to receiving the IP address corresponding to the non-textual based graphical shape, retrieving the web resource located at the IP address.

2. The computer-implemented method of claim 1 , wherein converting the non-textual based graphical shape into the punycode comprises:

detecting coordinates of one or more lines in respective one or more of the plurality of cells; and

looking up the detected coordinates of the one or more lines in a registry associating coordinates of lines in the grid with respective punycodes.

3. The computer-implemented method of claim 1 , wherein converting the non-textual based graphical shape into the punycode comprises:

calculating a value for the grid based on respective values assigned to each of the cells, wherein each cell has a value corresponding to a predetermined value for each of the possible predefined states; and

looking up the calculated value in a registry associating values of the grid with respective punycodes.

4. The computer-implemented method of claim 1 , wherein the predetermined set of non-textual patterns comprises one or more lines connecting predefined points along edges of each cell.

5. The computer-implemented method of claim 1 , wherein the non-textual based graphical shape is a web address for the web resource.

6. The computer-implemented method of claim 1 , wherein the possible predefined states comprises three predefined states;

wherein the three predefined states are a first state having a diagonal line extending from an upper right corner to a lower left corner of a first cell, a second state having a diagonal line extending from an upper left corner to a lower right corner of a second cell, and a third state having no lines.

7. The computer-implemented method of claim 1 , wherein the non-textual based graphical shape comprises a diagonal line in one or more of the plurality of cells.

8. The computer-implemented method of claim 7 , wherein converting the non-textual based graphical shape into the punycode comprises:

detecting coordinates of an end of the diagonal line within a preset tolerance of a first corner of the one or more of the plurality of cells; and

in response to the detecting, snapping the end to the first corner.

9. The computer-implemented method of claim 1 , wherein the possible predefined states comprise variations in color of at least one defined region in one or more of the plurality of cells.

10. The computer-implemented method of claim 1 , wherein the non-textual based graphical shape comprises two or more lines in a cell from the plurality of cells.

11. The computer-implemented method of claim 1 , further comprising cycling through the possible predefined states of a cell from the plurality of cells in response to a user selection of the cell.

12. A computer-implemented method comprising:

receiving, from a remote computer system over a network, a request for a resource, the request including a non-textual graphical shape comprising a plurality of individual cells;

converting the non-textual graphical shape into an internet protocol (IP) address that corresponds to the non-textual graphical shape and identifies a location of the resource, wherein the converting comprises:

converting the non-textual graphical shape into a punycode corresponding to the non-textual graphical shape; and

transmitting the punycode to a Domain Name System (DNS) server to request the IP address based on the punycode; and

transmitting the IP address that corresponds to the non-textual graphical shape to the remote computer system.

13. The computer-implemented method of claim 12 , wherein the non-textual graphical shape comprises a grid comprising the plurality of cells, and wherein converting the non-textual graphical shape into the punycode comprises:

detecting coordinates of one or more lines in respective one or more of the plurality of cells; and

looking up the detected coordinates of the one or more lines in a registry associating coordinates of lines in the grid with respective punycodes.

14. The computer-implemented method of claim 12 , wherein the non-textual graphical shape comprises a grid comprising the plurality of cells, and wherein converting the non-textual graphical shape into the punycode comprises:

calculating a value for the grid based on respective values assigned to each of the cells, wherein each cell has a value corresponding to a predetermined value for each of a plurality of predefined states; and

looking up the calculated value in a registry associating values of the grid with respective punycodes.

15. The computer-implemented method of claim 12 , wherein the non-textual graphical shape comprises a grid comprising the plurality of cells, wherein each of the plurality of cells is limited to one of a plurality of predefined states, and wherein the plurality of predefined states comprises one or more lines connecting predefined points along edges of each cell.

16. The computer-implemented method of claim 15 , wherein each of the plurality of predefined states includes only a single line.

17. The computer-implemented method of claim 15 , wherein the plurality of predefined states further comprises shading of regions defined by the edges of each cell and the one or more lines connecting the predefined points along the edges of each cell.

18. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed by a processor, causes the processor to perform a method comprising:

receiving, from a remote computer system over a network, a request for a resource, the request including a non-textual graphical shape comprising a plurality of individual cells;

converting the non-textual graphical shape into an internet protocol (IP) address that corresponds to the non-textual graphical shape, wherein the converting comprises:

converting the non-textual graphical shape into a punycode corresponding to the non-textual graphical shape; and

transmitting the punycode to a Domain Name System (DNS) server to request the IP address based on the punycode; and

transmitting the IP address that corresponds to the non-textual graphical shape to the remote computer system.

19. The computer program product of claim 18 , wherein the non-textual graphical shape comprises a grid comprising a plurality of cells, each cell has one of a plurality of predefined states, and converting the non-textual graphical shape into the punycode comprises:

detecting coordinates of one or more lines in respective one or more of the plurality of cells; and

looking up the detected coordinates of the one or more lines in a registry associating coordinates of lines in the grid with respective punycodes.

20. The computer program product of claim 18 , wherein the non-textual graphical shape comprises a grid comprising a plurality of cells, each cell has one of a plurality of predefined states, and converting the non-textual graphical shape into the punycode comprises:

calculating a value for the grid based on respective values assigned to each of the cells, wherein each cell has a value corresponding to a predetermined value for each of the plurality of predefined states; and

looking up the calculated value in a registry associating values of the grid with respective punycodes.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 11, 2022
From: LOGASUNDARAM JAGANATHAN, VENKATARAMANA
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 061744/0055 →
Continuity (2)
Continuation 16568602 · Sep 12, 2019
Related Publication 20230099690A1 · Mar 30, 2023
References Cited (71)
US 5319721A · Chefalas · 1994 [cited by applicant]
US 6023534A · Handley · 2000 [cited by applicant]
US 6285785B1 · Bellegarda · 2001 [cited by applicant]
US 6886863B1 · Mowry, Jr. · 2005 [cited by applicant]
US 7020670B1 · Andreoli · 2006 [cited by applicant]
US 7234882B2 · Takada · 2007 [cited by applicant]
US 7502511B2 · McCormack · 2009 [cited by applicant]
US 7551778B2 · Miyatake · 2009 [cited by applicant]
US 7871271B2 · Incertis · 2011 [cited by applicant]
US 7978363B2 · Takayama · 2011 [cited by applicant]
US 8385811B1 · Gedlinske · 2013 [cited by applicant]
US 8463765B2 · Lesavich · 2013 [cited by applicant]
US 8548253B2 · Besley · 2013 [cited by applicant]
US 8622306B2 · Matsumoto · 2014 [cited by applicant]
US 8668144B2 · Evevsky · 2014 [cited by applicant]
US 8751972B2 · Ouyang · 2014 [cited by examiner]
US 8825810B1 · Easttom, II · 2014 [cited by applicant]
US 8856853B2 · Casagrande · 2014 [cited by applicant]
US 8994663B2 · Harrow · 2015 [cited by applicant]
US 9024890B2 · Chin · 2015 [cited by examiner]
US 9070000B2 · Terwilliger · 2015 [cited by applicant]
US 9294542B2 · Boudville · 2016 [cited by applicant]
US 9306944B2 · Terwilliger · 2016 [cited by applicant]
US 9330331B2 · Kasthuri · 2016 [cited by applicant]
US 9537925B2 · Williamson · 2017 [cited by applicant]
US 9727657B2 · Goyal · 2017 [cited by applicant]
US 9734255B2 · Jiang · 2017 [cited by applicant]
US 9757645B2 · Seo · 2017 [cited by examiner]
US 9798944B2 · Duong · 2017 [cited by applicant]
US 10013546B1 · Johansson · 2018 [cited by applicant]
US 10015483B2 · Schaefer · 2018 [cited by applicant]
US 10042523B2 · Kleinhout · 2018 [cited by applicant]
US 10216403B2 · Gay · 2019 [cited by examiner]
US 10223565B2 · Yeakley · 2019 [cited by applicant]
US 10225097B2 · Zsigmond · 2019 [cited by applicant]
US 10402060B2 · Gay · 2019 [cited by examiner]
US 10447761B2 · Eschbach · 2019 [cited by applicant]
US 10496852B1 · Marimuthu · 2019 [cited by applicant]
US 10545662B2 · Kim · 2020 [cited by examiner]
US 10558355B2 · Bean · 2020 [cited by applicant]
US 10599836B2 · McCarty · 2020 [cited by applicant]
US 10732800B2 · Shan · 2020 [cited by applicant]
US 10824760B2 · Bandiwdekar · 2020 [cited by applicant]
US 10890993B2 · Jagtman · 2021 [cited by applicant]
US 11526571B2 · Logasundaram Jaganathan · 2022 [cited by examiner]
US 20030009495A1 · Adjaoute · 2003 [cited by applicant]
US 20050011958A1 · Fukasawa · 2005 [cited by applicant]
US 20070279474A1 · Sato · 2007 [cited by applicant]
US 20080244436A1 · Baker · 2008 [cited by examiner]
US 20080307331A1 · Kuwatani · 2008 [cited by applicant]
US 20100025470A1 · Nakagawa · 2010 [cited by applicant]
US 20110145557A1 · Li · 2011 [cited by applicant]
US 20120252410A1 · Williams · 2012 [cited by examiner]
US 20120320040A1 · Algreatly · 2012 [cited by examiner]
US 20130054404A1 · Garcia · 2013 [cited by applicant]
US 20150088847A1 · Nelson · 2015 [cited by applicant]
US 20150277696A1 · Deluca · 2015 [cited by applicant]
US 20160086072A1 · Castillo · 2016 [cited by applicant]
US 20160253069A1 · Zapletal · 2016 [cited by applicant]
US 20160342838A1 · Shah · 2016 [cited by applicant]
US 20160352851A1 · Eriksson · 2016 [cited by examiner]
US 20170013091A1 · Aoki · 2017 [cited by applicant]
US 20170177851A1 · Sawant · 2017 [cited by applicant]
US 20170285932A1 · Hastings · 2017 [cited by applicant]
US 20180260108A1 · Hajimusa · 2018 [cited by applicant]
US 20190034613A1 · Jajoo · 2019 [cited by applicant]
US 20200175889A1 · Delson · 2020 [cited by examiner]
US 20200252803A1 · Shah · 2020 [cited by examiner]
US 20210081485A1 · Logasundaram Jaganathan · 2021 [cited by applicant]
Microsoft Computer Dictionary 64 (“block”, v. def. 6) (5th ed. 2002) (Year: 2002). [cited by examiner]
List of IBM Patents or Patent Applications Treated as Related, Nov. 11, 2022, 2 pgs. [cited by applicant]